Problem database last updated: June 20, 2025
6 problems · 0 Easy, 1 Medium, 5 Hard · Ranked #225 of 459
0 Easy
0% · avg 23%
1 Medium
17% · avg 59%
5 Hard
83% · avg 18%
Based on 6 reported problems, WeRide interviews are significantly harder than average - 83% Hard vs 18% across all companies.
Compared to the industry average, WeRide puts unusual emphasis on graph (33.3% of problems, 10.3x the industry average), breadth-first-search (50% of problems, 5.8x the industry average), heap-priority-queue (33.3% of problems, 5.4x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (83.3%), depth-first-search (50%), breadth-first-search (50%), graph (33.3%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Find Edges in Shortest Paths You are given an undirected weighted graph of n nodes numbered from 0 to n - 1. The graph consists of m edges represented by a 2D array edges, where edges[i] =... | Hard | Very Likely | depth-first-searchbreadth-first-searchgraph | Solve |
Maximize Greatness of an Array You are given a 0-indexed integer array nums. You are allowed to permute nums into a new array perm of your choosing. | Medium | Very Likely | arraytwo-pointersgreedy | Solve |
Maximum Profit in Job Scheduling We have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i]. | Hard | Very Likely | arraybinary-searchdynamic-programming | Solve |
Longest Increasing Path in a Matrix Given an m x n integers matrix, return the length of the longest increasing path in matrix. | Hard | Likely | arraydynamic-programmingdepth-first-search | Solve |
Text Justification Given an array of strings words and a width maxWidth, format the text such that each line has exactly maxWidth characters and is fully (left and right) justifie... | Hard | Likely | arraystringsimulation | Solve |
Swim in Rising Water You are given an n x n integer matrix grid where each value grid[i][j] represents the elevation at that point (i, j). | Hard | Likely | arraybinary-searchdepth-first-search | Solve |
Find Edges in Shortest Paths
SolveYou are given an undirected weighted graph of n nodes numbered from 0 to n - 1. The graph consists of m edges represented by a 2D array edges, where edges[i] =...
Maximize Greatness of an Array
SolveYou are given a 0-indexed integer array nums. You are allowed to permute nums into a new array perm of your choosing.
Maximum Profit in Job Scheduling
SolveWe have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i].
Longest Increasing Path in a Matrix
SolveGiven an m x n integers matrix, return the length of the longest increasing path in matrix.
Text Justification
SolveGiven an array of strings words and a width maxWidth, format the text such that each line has exactly maxWidth characters and is fully (left and right) justifie...
Swim in Rising Water
SolveYou are given an n x n integer matrix grid where each value grid[i][j] represents the elevation at that point (i, j).
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent WeRide interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
WeRide interviews focus heavily on array, depth-first-search, breadth-first-search problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. WeRide interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 459 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
WeRide has been reported to ask 6 distinct coding problems. The most common topics are array, depth-first-search, breadth-first-search. 0 are Easy difficulty, 1 are Medium, and 5 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 6 reported problems, WeRide interviews are significantly harder than average - 83% Hard vs 18% across all companies. 17% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, depth-first-search, breadth-first-search. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real WeRide coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a WeRide interview with AIarrow_forward
