Crack the passcode Problem : Tags: Mathematics, Brute force. Author: Kaustav There are many ways to approach this such as iterating over 2 dimensional keypad for the paths satisfying the Manhattan length constraint of 5 and printing the corresponding code and eliminating the case where there are unwanted characters. Also an adjacency array for every key of the keypad can be created and can be traversed to get all the possible solution paths with the given constraint. asked 12 Jan '18, 15:26
