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.”
17 Software Engineers have shared notes from their WeRide interviews, with the questions they were asked in each round. That is 81% of the 21 WeRide interview notes on Screna AI.
17 Software Engineer interview notes
“The naive recursive approach is what everyone reaches for first, and I did too for about 30 seconds before catching myself.”
“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.”
“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.”
“The race condition part was fine, i knew the answer conceptually.”
“I knew exponentiation by squaring going in, so the core logic wasn't the issue.”