WeRide
10 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 3123. Find Edges in Shortest Paths | Hard | 100% | TopicsDepth-First SearchBreadth-First SearchGraph TheoryHeap (Priority Queue)Shortest Path |
| 2592. Maximize Greatness of an Array | Medium | 89.3% | TopicsArrayTwo PointersGreedySorting |
| 329. Longest Increasing Path in a Matrix | Hard | 77.6% | TopicsArrayDynamic ProgrammingDepth-First SearchBreadth-First SearchGraph TheoryTopological SortMemoizationMatrixDirected Acyclic Graph |
| 778. Swim in Rising Water | Hard | 77.6% | TopicsArrayBinary SearchDepth-First SearchBreadth-First SearchUnion-FindMinimaxHeap (Priority Queue)MatrixDijkstra's Algorithm |
| 2791. Count Paths That Can Form a Palindrome in a Tree | Hard | 77.6% | TopicsHash TableBit ManipulationTreeDepth-First Search |
| 1559. Detect Cycles in 2D Grid | Medium | 77.6% | TopicsArrayDepth-First SearchBreadth-First SearchUnion-FindMatrix |
| 1235. Maximum Profit in Job Scheduling | Hard | 68.3% | TopicsArrayBinary SearchDynamic ProgrammingSorting |
| Text Justification | Hard | 68.3% | TopicsArrayStringSimulation |
| Count Binary Substrings | Easy | 68.3% | TopicsTwo PointersString |
| Design Snake Game | Medium | 68.3% | TopicsArrayHash TableDesignQueueSimulation |
