← All problemsSign in

2749. Minimum Operations to Make the Integer Zero

LeetCodeBit ManipulationBrainteaserEnumerationOpen on judge ↗

You are given two integers num1 and num2. In one operation, you can choose integer i in the range [0, 60] and subtract 2i + num2 from num1. Return the integer denoting the minimum number of operations needed to make num1 equal to 0. If it is impossible to make num1 equal to 0, return -1. Example 1: Input: num1 = 3, num2 = -2 Output: 3 Explanation: We can make 3 equal to 0 with the following

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start