Leetcode Problem 80. Remove Duplicates from Sorted Array II

80. Remove Duplicates from Sorted Array II

Leetcode Solutions

Two-Pointer Approach for Removing Duplicates

  1. Initialize two pointers i and j to 1 and 0 respectively.
  2. Initialize a variable count to 1 to keep track of the count of each unique element.
  3. Iterate over the array starting from the second element.
  4. If the current element is the same as the previous element, increment count.
  5. If count is less than or equal to 2, copy the current element to the position at j and increment j.
  6. If the current element is different from the previous element, reset count to 1 and copy the element to the position at j and increment j.
  7. Continue this process until the end of the array is reached.
  8. Return j as the new length of the array.
UML Thumbnail

Popping Unwanted Duplicates

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...