Leetcode 935. Knight Dialer

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).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 935. Knight Dialer

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact