Search
⌘K

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).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions
System Design Guided Practice
Exclusive content
Learn More
Questions
Meta SWE Interview QuestionsAmazon SWE Interview QuestionsGoogle SWE Interview QuestionsOpenAI SWE Interview QuestionsAnthropic SWE Interview QuestionsEngineering Manager (EM) Interview Questions
Learn
Learn System DesignLearn DSALearn BehavioralLearn ML System DesignLearn Low Level DesignGuided Practice
Links
FAQPricingGift PremiumHello Interview Premium
Legal
Terms and ConditionsPrivacy PolicySecurity
Contact
About UsProduct Support

7511 Greenwood Ave North Unit #4238 Seattle WA 98103

© 2026 Optick Labs Inc. All rights reserved.

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