Skip to main content
LeetCode 2460, Easy. Topics: Array, Two Pointers, Simulation. View on LeetCode. Generate this problem as a practice environment: tested reference solution, 18 parametrized pytest cases, and a playground notebook:

Problem

You are given a 0-indexed array nums of size n consisting of non-negative integers. You need to apply n - 1 operations to this array where, in the i<sup>th</sup> operation (0-indexed), you will apply the following on the i<sup>th</sup> element of nums:
  • If nums[i] == nums[i + 1], then multiply nums[i] by 2 and set nums[i + 1] to 0. Otherwise, you skip this operation.
After performing all the operations, shift all the 0’s to the end of the array.
  • For example, the array [1,0,2,0,0,1] after shifting all its 0’s to the end, is [1,2,1,0,0,0].
Return the resulting array. Note that the operations are applied sequentially, not all at once.

Examples

Constraints

  • 2 <= nums.length <= 2000
  • 0 <= nums[i] <= 1000

Solution

Reference implementation from solution.py on GitHub, full suite in test_solution.py:

Complexity

Tags

NeetCode All.
Last modified on September 7, 2026