10 curated coding interview questions directly asked in Weride technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 1559 | Detect Cycles in 2D Grid | Medium | Linked List | Two Pointers | 63.3% | 100.0% | 6m |
| 3123 | Find Edges in Shortest Paths | Hard | Core DSA | Implementation / Reasoning | 46.7% | 100.0% | all |
| 2592 | Maximize Greatness of an Array | Medium | Arrays | Sorting / Prefix / Scan | 61.7% | 87.5% | all |
| 1235 | Maximum Profit in Job Scheduling | Hard | Arrays | Sorting / Prefix / Scan | 54.7% | 75.0% | all |
| 329 | Longest Increasing Path in a Matrix | Hard | Arrays; Dynamic Programming | Sorting / Prefix / Scan; State Transition | 56.6% | 75.0% | all |
| 778 | Swim in Rising Water | Hard | Core DSA | Implementation / Reasoning | 67.8% | 75.0% | all |
| 2791 | Count Paths That Can Form a Palindrome in a Tree | Hard | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 52.2% | 75.0% | all |
| 68 | Text Justification | Hard | Core DSA | Implementation / Reasoning | 51.2% | 62.5% | all |
| 696 | Count Binary Substrings | Easy | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 70.4% | 62.5% | all |
| 353 | Design Snake Game | Medium | Design | Data Structure Design | 40.0% | 62.5% | all |