Remove duplicates from a sorted array.

Given a sorted array of integers, remove duplicates in-place.

Algorithm

1. Initialize a pointer for the last unique element.
2. Iterate through the array:
   • If the current element is greater than the last unique element, update the last unique element pointer.
   • If the current element is less than the last unique element but greater than the second last unique element, update the second last unique element pointer.
3. Return or print the values.

Time Complexity

The time complexity of this algorithm is O(n), where n is the number of elements in the array.