Available question text
Count how many length-n phone numbers can be formed by starting on any digit of the phone keypad and making n-1 valid knight moves: equivalently, count length-n walks in a fixed 10-node graph and return the total modulo 10^9+7 (n ≤ 5000).
Related questions
Continue with questions that share topics or the same question type.
- Check Knight Tour Configuration
Coding
- Knight Probability in Chessboard
Coding
- Minimum Knight Moves
Coding · A* Search · Bidirectional Search · Breadth-First Search
- The Knight’s Tour
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 935. Knight Dialer
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source