Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2998. Minimum Number of Operations to Make X and Y Equal
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source