Leetcode Problem 935. Knight Dialer

935. Knight Dialer

Leetcode Solutions

Define a 2d array jumps where jumps[square] contains a list of all squares that you can jump to from square.
Define a memoized function dp(remain, square):
- If remain == 0, return 1.
- Initialize ans = 0.
- Iterate nextSquare over jumps[square]:
  - Add dp(remain - 1, nextSquare) to ans.
- Return ans.
Initialize ans = 0.
Iterate square from 0 to 9:
- Add dp(n - 1, square) to ans.
Return ans.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen