LeetCode
Experience
·
Feb 2020
·
Los Angeles
Google | Phone screen | Knights on a m X n chess board
1,247 views
4 replies
Interview Experience
I appeard for a phone screen from Google. Here is the question and a followup question Given m (rows), n (columns) and a (x1, y1) starting postion and (x2, y2) destination, find...
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Dynamic Programming
Matrix
Recursion