Leetcode 2998. Minimum Number of Operations to Make X and Y Equal

Find the minimum number of steps to transform integer x into y using operations ±1 or dividing by 5 or 11 when divisible; this is a shortest-path problem on an implicit unweighted graph of integer states (solveable with BFS/bidirectional search given 1 ≤ x,y ≤ 10^4).