Combination Lock Solver

You are faced with a 4-dial rotary combination lock, where each dial contains 10 numeric positions labeled from '0' through '9'. The dials operate in a circular manner, meaning rotating past '9' brings you back to '0', and rotating backward from '0' brings you to '9'. Each single movement consists of rotating exactly one dial by one position in either direction.

The lock begins at the initial state "0000", representing all four dials set to zero.

You are provided with an array of forbidden codes — configurations that must be avoided at all costs. If the lock ever displays any of these forbidden combinations, the security mechanism permanently locks down, preventing any further dial rotations.

Given a target code representing the combination that successfully unlocks the lock, determine the minimum number of individual dial movements required to transition from "0000" to the target configuration while avoiding all forbidden codes.

If it is impossible to reach the target code without triggering the security lockdown, return -1.

Key Observations:

• Each dial can be rotated independently in either direction
• The circular nature of dials means '9' and '0' are adjacent positions
• You must never land on a forbidden code during any intermediate step
• The starting position "0000" itself could potentially be forbidden