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 ...

int traversalPtr = 0; // Pointer to traverse the entire array. int k = 0; // Pointer to keep track of indexes at correct positions while duplicate elements are pushed towards the rightmost end. // ...