Question Details
Problem Find the minimum number of knight moves on a chessboard to reach a target, using BFS. Likely LeetCode equivalent Related to LC 1197 Minimum Knight Moves. Tags graph, BFS, phone-screen
Full Details
🔒
Unlock all Stackadapt questions
Full insider details, leaked discussions, and candidate experiences.
Get full access — $100 a year, unlimited accessAbout This Question
This is a reported interview question from a stackadapt interview during the phone round.
It covers the following topics: Coding, Graph, Phone, Onsite .