Leetcode 3377. Digit Operations to Make Two Integers Equal

Find the minimum total cost to transform integer n into m by repeatedly incrementing or decrementing any single digit by 1 (digits remain same length), where each visited number contributes its numeric value to the cost and any prime-valued intermediate state (including start) is forbidden; return -1 if no valid sequence exists.