WeRide LeetCode Questions
10 questions all-time · 1 easy · 3 medium · 6 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Find Edges in Shortest Paths Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Path | Hard | 100 | 0.5% |
| 2 | Maximize Greatness of an Array Array, Two Pointers, Greedy, Sorting | Medium | 85 | 0.6% |
| 3 | Maximum Profit in Job Scheduling Array, Binary Search, Dynamic Programming, Sorting | Hard | 74 | 0.5% |
| 4 | Longest Increasing Path in a Matrix Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort, Memoization, Matrix | Hard | 74 | 0.6% |
| 5 | Swim in Rising Water Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix | Hard | 74 | 0.7% |
| 6 | Count Paths That Can Form a Palindrome in a Tree Hash Table, Bit Manipulation, Tree, Depth-First Search | Hard | 74 | 0.5% |
| 7 | Detect Cycles in 2D Grid Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 74 | 0.6% |
| 8 | Text Justification Array, String, Simulation | Hard | 65 | 0.5% |
| 9 | Count Binary Substrings Two Pointers, String | Easy | 65 | 0.7% |
| 10 | Design Snake Game Array, Hash Table, Design, Queue, Simulation | Medium | 65 | 0.4% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.