Weride Coding Interview Questions
We track 10 coding questions asked at Weride, tagged with the algorithms and concepts they test. The most common: Array, Depth-First Search, Breadth-First Search, Matrix, Binary Search.
Browse all 10 Weride questions →Concept mix
Each question's weight is split evenly across its concepts, so the shares sum to 100%.
- Array14.5%
- Depth-First Search10.2%
- String9.3%
- Two Pointers8.3%
- Breadth-First Search7.4%
- Sorting5.6%
- Matrix5.2%
- Binary Search4.4%
- Dynamic Programming4.2%
- Heap (Priority Queue)3.8%
- Other (10)27.3%
How many questions involve each concept
Share of all 10 tracked Weride questions that touch each concept. Questions usually involve several, so these overlap.
- Array60.0%
- Depth-First Search50.0%
- Breadth-First Search40.0%
- Matrix30.0%
- Binary Search20.0%
- Dynamic Programming20.0%
- Graph Theory20.0%
- Heap (Priority Queue)20.0%
- Sorting20.0%
- String20.0%
- Two Pointers20.0%
- Union-Find20.0%
Where Weride differs from the average company
Concept weight at Weride relative to the average across all companies we track. Green means Weride leans on it harder than most.
- Union-Find5.4×
- Depth-First Search4.4×
- Graph Theory3.6×
- Breadth-First Search3.4×
- Array0.75×
- Dynamic Programming0.68×
Weride specialties
Concepts that show up at Weride but are rarely asked elsewhere. They are easy to get blindsided by.
Difficulty mix
Level split of the 10 tracked Weride questions.
- Junior10% (1)
- Mid/Senior30% (3)
- Staff60% (6)
Every concept in Weride interviews
| Concept | Questions | % of questions | Share of mix |
|---|---|---|---|
| Array | 6 | 60.0% | 14.5% |
| Depth-First Search | 5 | 50.0% | 10.2% |
| Breadth-First Search | 4 | 40.0% | 7.4% |
| Matrix | 3 | 30.0% | 5.2% |
| Binary Search | 2 | 20.0% | 4.4% |
| Dynamic Programming | 2 | 20.0% | 4.2% |
| Graph Theory | 2 | 20.0% | 3.6% |
| Heap (Priority Queue) | 2 | 20.0% | 3.8% |
| Sorting | 2 | 20.0% | 5.6% |
| String | 2 | 20.0% | 9.3% |
| Two Pointers | 2 | 20.0% | 8.3% |
| Union-Find | 2 | 20.0% | 3.8% |
| Bit Manipulation | 1 | 10.0% | 2.8% |
| Greedy | 1 | 10.0% | 2.8% |
| Hash Table | 1 | 10.0% | 2.8% |
| Memoization | 1 | 10.0% | 1.4% |
| Shortest Path | 1 | 10.0% | 2.2% |
| Simulation | 1 | 10.0% | 3.7% |
| Topological Sort | 1 | 10.0% | 1.4% |
| Tree | 1 | 10.0% | 2.8% |
Practice a Weride interview
Take a realistic AI-led mock interview with questions Weride actually asks, with live voice and real feedback.
Start a mock interviewYour first interview is free · no credit card required