Algorithm/DS Problem #2: Variation of Leetcode#752
May 27, 2021
You have a lock in front of you with 4 circular wheels. Each wheel has 10 slots: '0', '1', '2', '3', '4', '5', '6', '7', '8', '9'. The wheels can rotate freely and wrap around: for example we can turn '9' to be '0', or '0' to be '9'. Each move consists of turning one wheel one slot.
The lock initially starts at '0000', a string representing the state of the 4 wheels.
Find the minimum number of turns to reach the target and open the lock.
target : 9101
Output : 3
Explanation: 0 would flip back 1 to ‘9’ + 0 -> 1 (1 step) + None + 0 -> 1 (1 step) ==> 3 steps
