LeetCode 753: Cracking the Safe
Problem Restatement We have a safe protected by an unknown password. The password has length n . Each digit can be one of: 0, 1, ..., k - 1 When we type digits into the safe, it checks the most recent n digits after every key press. For example, if the password is: 345 and we type: 012345 then the safe checks: 012 123 234 345 When it sees 345...