Open Lock In Minimum Turns With BFS Approach
BFS is used to find shortest path from '0000' to target while avoiding deadends in 752. Open the Lock problem.
752. Open the Lock Difficulty: Medium Topics: Array, Hash Table, String, Breadth-First Search 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. You are given a list of deadends dead ends, meaning if the lock displays any of these codes, the wheels of the lock will stop turning an...