Open the Lock

Explore how to use breadth-first search to find the minimum moves needed to unlock a four-wheel lock, starting at 0000 while avoiding deadend combinations. Understand the problem constraints and implement a BFS approach to navigate through potential lock states efficiently to reach your target combination or determine if it's unreachable.