Knight Dialer - Leetcode 935 - Python

🚀 neetcode.io/ - A better way to prepare for Coding Interviews
🧑‍💼 LinkedIn: / navdeep-singh-3aaa14161
🥷 Discord: / discord
🐦 Twitter: / neetcode1
📸 Instagram: / neetcodeio
🐮 Support the channel: / neetcode
⭐ BLIND-75 PLAYLIST: • Two Sum - Leetcode 1 -...
💡 DYNAMIC PROGRAMMING PLAYLIST: • House Robber - Leetco...
Problem Link: leetcode.com/problems/knight-...
0:00 - Read the problem
0:30 - Drawing Explanation
8:18 - Coding Explanation
leetcode 935
#neetcode #leetcode #python

[@Phaytann]

Thank you for this solution, very well explained.
Is there a reason why you don't dive into the asymptotic analysis of your solutions during videos? I would expect that in an interview providing the correct time and space complexities are just as important as writing the algorithm.
Thank you again! I appreciate the content :)

[@gauravsingla6444]

Just an observation - the code will still work without explicitly adding base condition for n==1

[@VidyaBhandary]

Have been waiting for this one for quite a while !

[@AqidaXT]

Cyber Monday discount coming?