Minimum Knight Moves - LeetCode 1197 - JavaScript

preview_player
Показать описание


Step by step walk through of the solution to the popular Amazon coding interview question, Minimum Knight Moves.

LeetCode 1197

JavaScript

0:00 Intro
0:40 Explanation
3:28 Code

#softwareengineering #javascript #leetcode
Рекомендации по теме
Комментарии
Автор

Hi, great video. I understand how the first while loop terminates when it finds the correct coordinate, however I do not get how the first while loop terminates since queue.length would still be true

igbagboolaleye
Автор

hi, helpful video. Do you have any idea how i could possible show the steps it took to reach the goal? e.g. the cells it choose as the road. Thanks

fsocietydat
join shbcf.ru