Leetcode 935 Knight Dialer
How many distinct numbers can you dial in N hops from a particular starting position?
interview Question
Approach 1: Dynamic Programming
dp[n][1] = dp[n-1][6] + dp[n-1][8]; //f(1, n) = f(6, n-1) + f(8, n-1)
DP
Straightforward Simulation/ DP/ Whatever
Approach 2: DFS with memo
DFS with memo