Removing duplicates from a sorted array using two pointers
Step 0
Initialization
We start with a sorted array and initialize two pointers: slow at index 0 and fast at index 1. The slow pointer keeps track of the position where the next unique element should be placed.