WeRide coding interview
questions, leaked.
6 problems reported across recent WeRide interviews. Top patterns: array, depth first search, breadth first search. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
WeRide's coding assessment is a gauntlet of hard problems. You're looking at five problems in the HARD bracket out of six total, with just one medium-difficulty question. The weight lands heavily on arrays, graph traversal (DFS and BFS), and problems that chain multiple concepts together. Shortest paths, matrix traversal, and dynamic programming are the real teeth here. If you blank on the live assessment, StealthCoder runs invisibly during screen share and surfaces working code in seconds, so you stay unblocked while you think.
Top problems at WeRide
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Find Edges in Shortest Paths | HARD | 100.0 | 46% | Depth-First Search · Breadth-First Search · Graph |
| 02 | Maximize Greatness of an Array | MEDIUM | 85.3 | 59% | Array · Two Pointers · Greedy |
| 03 | Maximum Profit in Job Scheduling | HARD | 80.6 | 54% | Array · Binary Search · Dynamic Programming |
| 04 | Longest Increasing Path in a Matrix | HARD | 74.5 | 55% | Array · Dynamic Programming · Depth-First Search |
| 05 | Swim in Rising Water | HARD | 65.9 | 63% | Array · Binary Search · Depth-First Search |
| 06 | Text Justification | HARD | 65.9 | 48% | Array · String · Simulation |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual WeRide OA. The proctor cannot see it. Screen share cannot detect it. Built by an engineer who got tired of watching his cohort grind for six months and still get filtered at the OA stage.
Get StealthCoder- array5 · 83%
- depth first search3 · 50%
- breadth first search3 · 50%
- binary search2 · 33%
- dynamic programming2 · 33%
- sorting2 · 33%
- heap priority queue2 · 33%
- matrix2 · 33%
- graph2 · 33%
- union find1 · 17%
Arrays dominate the question pool, appearing in five of the six problems you'll see. That's your warm-up space, but don't get comfortable: every array problem stacks extra constraints. Shortest-path graph problems (Find Edges in Shortest Paths) and matrix DP (Longest Increasing Path in a Matrix, Swim in Rising Water) form the hard core. DFS and BFS each show up three times, often paired with binary search or heap mechanics. You need to drill Dijkstra and 0-1 BFS before test day, understand memoization on grids, and be solid on greedy sorting. If you've practiced individual patterns in isolation but haven't chained them together on a grid under time pressure, StealthCoder is your real-time hedge when the hybrid problems land.
Companies with similar patterns
If you prepped for WeRide, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass WeRide.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built by an engineer who got tired of watching his cohort grind for six months and still get filtered at the OA stage. Works on HackerRank, CodeSignal, CoderPad, and Karat.
WeRide interview FAQ
How many array problems should I solve before the WeRide assessment?+
At least 10 to 15, but prioritize those that layer another topic on top: sorting plus greedy, binary search plus DP, or arrays used inside graph problems. Five out of six WeRide problems touch arrays, so breadth matters less than depth here.
Is graph traversal really that critical for WeRide?+
Yes. DFS and BFS each appear in three problems, often combined with shortest paths, matrix navigation, or union-find. You need to be fast and confident with both. Shortest-path problems (Dijkstra, 0-1 BFS) are non-negotiable.
What should I drill first if I have three days?+
Day one: matrix DFS and DP memoization (Longest Increasing Path pattern). Day two: shortest-path algorithms and binary search combined with DP. Day three: greedy sorting and two-pointer techniques. Five of six problems are hard, so skip the medium-difficulty grinding and attack the patterns directly.
Do I need to be expert-level at dynamic programming for this assessment?+
You need to recognize it and apply basic memoization, especially on grids. DP appears in two of six problems, but both are hard difficulty and pair with other topics. Focus on recursive DP with memoization rather than bottom-up optimization.
How much time should I spend on union-find and two-pointers given their low frequency?+
Union-find appears once (Swim in Rising Water as an alternative approach), and two-pointers once. Practice them as part of greedy and sorting patterns, but don't block on them. The five hard graph and DP problems are where your time compounds.