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