Day 4: Coding Challenge

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.

Since it is impossible to change the length of the array in some languages, you must instead have the result placed in the first part of the array numbers. 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.

Solutions -

Optimal Solutions -

We will use the two-pointer approach, which was used in the previous problem. In this problem, we will assign the arr[j] to arr[i] when it fulfils a certain condition.

Time Complexity - O(N)

Space Complexity - O(1)

#Codingchallenge #problemsolvingskills #problemsolving #codeforgood #60daysofchallenge #60dayscode #consistency #dsaforproblemsolving