Question Details
Problem Count distinct phone numbers a knight can dial in N moves on a phone keypad, using dynamic programming over valid knight moves. Likely LeetCode equivalent LeetCode 935 - Knight Dialer. Tags dynamic_programming,math,recursion,swe
Full Details
🔒
Unlock all Waymo questions
Full insider details, leaked discussions, and candidate experiences.
or every company, $100/year →About This Question
This is a reported interview question from a waymo interview during the onsite round.
It covers the following topics: Recursion, Coding, Onsite, Dynamic Programming .
Topics
More Waymo Interview Questions
Reddit
For coding round SWE at Waymo do you have to code 2 questions in 45 mins for phone scree?
Reddit
Waymo Data System Design Round
1p3a
waymo fulltime machine learning engineer onsite interview experience
1p3a
Waymo Internship Interview Experience and Questions
LeetCode
#871 Minimum Number of Refueling Stops