Knight Dialer - Leetcode 935

Today we will solve the "Knight Dialer" problem from Leetcode. We will walk through a recursive dynamic programming solution to solve this problem. Give this problem a try here: https://leetcode.com/problems/knight-dialer/description/ Don't miss Dynamic programming playlist here: https://www.youtube.com/playlist?list=PLAtZcLSBX7j-06GpCKXa6XQ5GBXHlhXBZ Don't miss Arrays playlist here: https://www.youtube.com/playlist?list=PLAtZcLSBX7j8L6QkScfDtZms_S93IN9WO Don't miss Strings playlist here: https://www.youtube.com/playlist?list=PLAtZcLSBX7j-lhMNmgq5GrNzSof5ZhFkP This question has been asked by Amazon, Meta, Google, Apple, Microsoft, and so many other companies. Please check the channel page for more Leetcode solution videos. Also don't forget to like, comment, and subscribe. Hope you enjoy the video and Thanks for watching 🙏 Chapters: 0:00 Intro and question 0:04 Examples 0:41 The next jump 1:29 The next location jump states 2:26 Bigger digits to dial 3:38 Our plan to code it up 4:16 Code walkthrough 6:17 Implement Caching 7:56 Time and Space Complexity