← All problemsSign in

3782. Last Remaining Integer After Alternating Deletion Operations

LeetCodeMathRecursionOpen on judge ↗

You are given an integer n. We write the integers from 1 to n in a sequence from left to right. Then, alternately apply the following two operations until only one integer remains, starting with operation 1: - Operation 1: Starting from the left, delete every second number. - Operation 2: Starting from the right, delete every second number. Return the last remaining integer. Example 1: Inp

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