Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
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
Google
Leetcode 351. Android Unlock Patterns
Reported Jan 7, 2025 · 1 source report
JUNIOR
Source snapshot: Nov 12, 2026
View source