In this video titled Crack FAANG Interviews: Insider DSA Tips from a Hiring Manager! the candidate is asked to solve a problem related to the knight piece in chess. The interviewer explains the movement of the knight and shows the candidate a number pad. The candidate is asked to place the knight on the number pad and, given a starting digit and number of jumps, return the total possible numbers that can be generated by having the knight jump starting from the given digit. The interviewer provides examples for one and two jumps.

The candidate suggests treating every number as a node and its possible next steps as the child nodes. They propose using depthfirst search to count the number of leaves for each starting point. The interviewer asks how to define the number of branches per leaf, and the candidate suggests this is predefined by the possible paths.
Follow Playlist

Mock Interviews    • Mock Interviews  

Uplevel with Omkar Deshpande    • Uplevel with Omkar Deshpande  

Subscribe to Interview Kickstart Youtube Channel so that you don't miss any important video that may help boost your career
Subscribe    / interviewkickstart  
Join in our webinar https://www.interviewkickstart.com/

Follow us at
Facebook   / interviewkickstart  
Instagram   / interviewkickstart  

#MAANG #FAANG #InterviewTips #InterviewKickstart