Given an N x M grid of dots, count all valid unlock patterns of length at least L. A pattern is a sequence of distinct dots. A move between two adjacent dots (horizontally, vertically, diagonally) is…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.