Tap here to switch tabs
Problem
Submissions

Problem: Remove Duplicates from Sorted Array

Remove Duplicates from Sorted Array asks you to modify a sorted integer array in place, keeping one copy of each value, and return the count of unique elements.

Statement

You are given an integer array nums that is already sorted in non-decreasing order. Your task is to remove the duplicate values in-place so that each element in the array appears only once, while preserving the original relative order of the elements.

After removing the duplicates, let k be the number of unique elements remaining in the array. The first k positions of nums should contain these unique elements in sorted order. Any values beyond index k - 1 are irrelevant and can be ignored.

Your goal is to modify the array in-place and return the value k, representing the count of unique elements.

Constraints:

  • 1≤1 \leq nums.length ≤3∗104\leq 3 * 10^4

  • −100≤-100 \leq nums[i] ≤100\leq 100

  • nums is sorted in non-decreasing order.

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Remove Duplicates from Sorted Array

Remove Duplicates from Sorted Array asks you to modify a sorted integer array in place, keeping one copy of each value, and return the count of unique elements.

Statement

You are given an integer array nums that is already sorted in non-decreasing order. Your task is to remove the duplicate values in-place so that each element in the array appears only once, while preserving the original relative order of the elements.

After removing the duplicates, let k be the number of unique elements remaining in the array. The first k positions of nums should contain these unique elements in sorted order. Any values beyond index k - 1 are irrelevant and can be ignored.

Your goal is to modify the array in-place and return the value k, representing the count of unique elements.

Constraints:

  • 1≤1 \leq nums.length ≤3∗104\leq 3 * 10^4

  • −100≤-100 \leq nums[i] ≤100\leq 100

  • nums is sorted in non-decreasing order.