Skip to content

Practice Minimum Number of Operations to Make X and Y Equal

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#2998
LeetCode Problem

Minimum Number of Operations to Make X and Y Equal

Problem Statement

Given positive integers x and y, transform x into y using as few operations as possible. Each operation may divide x by 11 when it is divisible by 11, divide it by 5 when it is divisible by 5, increase it by 1, or decrease it by 1. Return the minimum operation count.

Source: Minimum Number of Operations to Make X and Y Equal on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
x = 26, y = 1
Output
3

# Example 2

Input
x = 54, y = 2
Output
4

# Example 3

Input
x = 25, y = 30
Output
5

Constraints

1 <= x, y <= 10^4

Related LeetCode Problems

Practice more problems similar to Minimum Number of Operations to Make X and Y Equal.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.