NeetCode #693LC-935Medium1-D Dynamic Programming
← Back to All Problems#693 · #935 · Knight Dialer(骑士拨号器)
📌 Problem Statement & Constraints
A chess knight dials phone numbers on a keypad shaped like a
3 x 4 grid holding the digits 0-9 (the bottom-left and bottom-right cells do not exist). Count how many distinct phone numbers of length n the knight can dial using n - 1 valid knight moves, modulo 10^9 + 7. Constraints: 1 <= n <= 5000.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!