Skip to main content

4. Remove Duplicates from Sorted Array

easyAsked at Chime

Remove duplicates in-place from a sorted array, returning the new length.

By Alex Chen, Founder, InterviewChamp.AI · Last verified

Problem

Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. Return the new length k.

Constraints

  • 1 <= nums.length <= 3 * 10^4
  • -100 <= nums[i] <= 100
  • nums is sorted in non-decreasing order.

Examples

Example 1

Input
nums = [1,1,2]
Output
2, nums = [1,2,_]

Example 2

Input
nums = [0,0,1,1,1,2,2,3,3,4]
Output
5, nums = [0,1,2,3,4,_,_,_,_,_]

Approaches

1. Brute force with extra array

Use a Set to track seen, then copy back.

Time
O(n)
Space
O(n)
const seen = new Set();
let k = 0;
for (const x of nums) if (!seen.has(x)) { seen.add(x); nums[k++] = x; }
return k;

Tradeoff:

2. Two-pointer in-place

Slow pointer holds write index; fast iterates and writes on change.

Time
O(n)
Space
O(1)
function removeDuplicates(nums) {
  if (nums.length === 0) return 0;
  let k = 1;
  for (let i = 1; i < nums.length; i++) {
    if (nums[i] !== nums[i-1]) nums[k++] = nums[i];
  }
  return k;
}

Tradeoff:

Chime-specific tips

Chime engineers handle in-place dedup of transaction logs and webhook events daily; show fluency with two-pointer in-place updates without extra memory.

Solve it now

Free. No sign-up. Python and JavaScript run instantly in your browser.

Output

Press Run or Cmd+Enter to execute

Practice these live with InterviewChamp.AI

Drill Remove Duplicates from Sorted Array and other Chime interview questions under real-loop conditions with instant feedback on your reasoning, complexity claims, and code.

Practice these live with InterviewChamp.AI →