MediumNo. 0080

Remove Duplicates from Sorted Array II — LeetCode 80 Python Solution

Topics
Array, Two Pointers
On a study list
Top Interview 150
Reading time
2 min

The problem

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.

Example

Example
int[] nums = [...]; // Input array
int[] expectedNums = [...]; // The expected answer with correct length

int k = removeDuplicates(nums); // Calls your implementation

assert k == expectedNums.length;
for (int i = 0; i < k; i++) {
    assert nums[i] == expectedNums[i];
}

Python solution

PythonSolution
class Solution:
    def removeDuplicates(self, nums: List[int]) -> int:
        k = 0
        for x in nums:
            if k < 2 or x != nums[k - 2]:
                nums[k] = x
                k += 1
        return k

Complexity

Time
O(n)
Space · auxiliary
O(1)

Pattern: Two Pointers

Use the order already in the input to discard half the search space at every step. LeetCode 80. Remove Duplicates from Sorted Array II is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Two Pointers.

The two pointers guide has the Python template for the pattern and the 201 LeetCode problems that use it.

Related problems

Related problems
No.ProblemDifficulty
0026Remove Duplicates from Sorted ArrayEasy
0075Sort ColorsMedium
0088Merge Sorted ArrayEasy
00153SumMedium
00163Sum ClosestMedium
00184SumMedium

Frequently asked questions

How hard is LeetCode 80. Remove Duplicates from Sorted Array II?

LeetCode 80. Remove Duplicates from Sorted Array II is rated Medium on LeetCode.

What is the time complexity of LeetCode 80. Remove Duplicates from Sorted Array II?

The Python solution on this page runs in O(n).

What is the space complexity of LeetCode 80. Remove Duplicates from Sorted Array II?

The Python solution on this page uses O(1) auxiliary space.

What topics does LeetCode 80. Remove Duplicates from Sorted Array II cover?

LeetCode 80. Remove Duplicates from Sorted Array II is tagged Array and Two Pointers on LeetCode.

Stuck on problems like this in a live interview?

Stealth Interview is a desktop app for macOS and Windows. It reads the problem off your screen and returns a working solution with a step-by-step explanation and its time and space complexity, invisible to screen sharing.

Free to download. Check it runs on your machine, then pick a plan.