WeRide·Software Engineer·Technical Phone Screen
- Compute the n-th Fibonacci number in O(log n) time.
“The naive recursive approach is what everyone reaches for first, and I did too for about 30 seconds before catching myself.”
Mid-sized
Most of these WeRide write-ups come from Software Engineers (17), then Frontend Engineers (4). The most reported rounds are the technical phone screen (20) and the behavioral / leadership round (1).
21 interview notes · updated Jun 2026
“The naive recursive approach is what everyone reaches for first, and I did too for about 30 seconds before catching myself.”
“This one tripped me up a little because I expected a surface-level 'do you use Copilot' type question, but they pushed for specifics fast.”
“Ran through Thread subclassing, Runnable, and ExecutorService.”
“Spent the first few minutes thinking about the interface before touching any logic, which I think was the right call.”
“I got the basic loop working pretty fast, timestamps in a ref, count frames over a second, setState with the result.”
“Pretty standard bracket matching problem.”
“I started with sorting because it's the easiest to explain, then moved to the min-heap approach.”
“This is where the tone got set fast.”
“This is LeetCode 778.”
“The twist on the standard Sudoku format is what slowed me down.”
Candidates most often report a technical phone screen (20 write-ups) and a behavioral / leadership round (1).
Across 20 technical phone screen write-ups, the most tagged question topics are Technical Trade-offs (30 questions), Algorithms & Data Structures (17) and System Design (15).
17 notes