JS solution for 0080 Remove Duplicates from Sorted Array II added

[majhar-nayem]

• File(s) Modified: 0080-remove-duplicates-from-sorted-array-ii
• Language(s) Used: JavaScript
• Submission URL: https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/submissions/968941008/

Important

Please make sure the file name is lowercase and a duplicate file does not already exist before merging.

[aakhtar3]

Suggestion: Add Time O() | Space O() complexity

[majhar-nayem]

Time O(n) || Space O(1)

added.

[aakhtar3]

The original code was following the common 2-pointer algorithm approach. This change has moved from that pattern and made it more difficult to retain the 2-pointer approach.

Here’s a modified version for the 2-pointer algorithm.

/**
 * 2-pointer
 * Time O(N) | Space O(1)
 * https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii
 * @param {number[]} nums
 * @return {number}
 */
var removeDuplicates = (nums) => {
    const isEdgeCase = (nums.length < 2)
    if (isEdgeCase) return nums.length;

    let [ left, right ] = [ 2, 2 ];

    while (right < nums.length) {
        const isEqual = (nums[left - 2] === nums[right]);
        if (!isEqual) {
            nums[left] = nums[right];
            left += 1;
        }

        right += 1;
    }

    return left;
};