JavaScript: Remove Duplicates From Sorted Array in Place

Challenge Picked From LeetCode’s Top Interview Questions List

Photo by Jørgen Håland on Unsplash

Today, we will work on Remove Duplicates from Sorted Array algorithm from LeetCode’s Top Interview Questions List:

Given a sorted array nums, remove the duplicates in-place such that each element appears only once and returns the new length.

Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.

Example 1:
Given nums = [1,1,2],
Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively.
It doesn't matter what you leave beyond the returned length.
Example 2:
Given nums = [0,0,1,1,1,2,2,3,3,4],
Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively.
It doesn't matter what values are set beyond the returned length.

In JavaScript, there are multiple ways to remove duplicates from an array. Using built-in methods might be an easy option, but we will choose a more efficient approach that helps…