Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 351. Android Unlock Patterns
Count the number of valid Android lock patterns on a 3x3 grid with length between m and n, where a move that jumps over a key is allowed only if the intermediate key has already been used. This requires combinatorial search with constraint checking (commonly solved via DFS/backtracking and symmetry-based pruning).
Asked at:
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Early January, 2025
Junior
Android phone patterns: Given n,m points, find total possible unique patterns that can be drawn with minimum length 1.
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.