Skip to content

Practice Remove Duplicates from Sorted Array II

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#80
LeetCode Problem

Remove Duplicates from Sorted Array II

Problem Statement

Given an integer array nums sorted in non-decreasing order, remove some duplicates in-place such that each unique element appears at most twice. The relative order of the elements should be kept the same. Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the array nums. More formally, if there are k elements after removing the duplicates, then the first k elements of nums should hold the final result. It does not matter what you leave beyond the first k elements. Return k after placing the final result in the first k slots of nums. Do not allocate extra space for another array. You must do this by modifying the input array in-place with O(1) extra memory. Custom Judge: The judge will test your solution with the following code: If all assertions pass, then your solution will be accepted.

Source: Remove Duplicates from Sorted Array II on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

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

# Example 2

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

Constraints

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

Related LeetCode Problems

Practice more problems similar to Remove Duplicates from Sorted Array II.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.