Learn AI Create the Future — with Pranay
Main site

LeetCode solutions

2288. Count Operations to Obtain Zero

My accepted Python solution to LeetCode problem 2288, Count Operations to Obtain Zero, running in 0ms.

  • Difficulty: Easy
  • Python
  • Runtime 0ms
  • Memory 17.2MB

Read the problem on LeetCode View on GitHub

The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.

Python

Accepted on LeetCode — runtime 0ms, memory 17.2MB, accepted 2025-12-29.

python
class Solution:
    def countOperations(self, num1: int, num2: int) -> int:
        # Similar to GCD algorithm - count steps
        # Time: O(log(min(a,b))), Space: O(1)
        ops = 0
        while num1 > 0 and num2 > 0:
            if num1 >= num2:
                ops += num1 // num2
                num1 = num1 % num2
            else:
                ops += num2 // num1
                num2 = num2 % num1
        return ops

Source