Max Moves on Keypad | Dataford Interview Questions

Implement an algorithm to calculate the maximum number of moves for a chess piece on a telephone keypad at LemonEdge.

Assume the piece is a chess knight, movement follows the standard knight pattern, and a digit may not be visited more than once. Implement max_knight_moves(start_digit), returning the maximum number of valid moves from the given digit across the 0 to 9 telephone keypad; * and # are unavailable.

Constraints

0 <= start_digit <= 9
The keypad layout is fixed as 1 2 3, 4 5 6, 7 8 9, 0
The piece is always a standard chess knight
Each digit may be visited at most once

Function Signature

def max_knight_moves(start_digit):

Your question is Max Moves on Keypad. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Implement an algorithm to calculate the maximum number of moves for a chess piece on a telephone keypad at LemonEdge.

Constraints

0 <= start_digit <= 9
The keypad layout is fixed as 1 2 3, 4 5 6, 7 8 9, 0
The piece is always a standard chess knight
Each digit may be visited at most once

Function Signature

def max_knight_moves(start_digit):

Your question is Max Moves on Keypad. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.