Two Python approaches to solving LeetCode's Remove Duplicates from Sorted Array

LeetCode's 'Remove Duplicates from Sorted Array' problem requires modifying a sorted integer array in-place so each unique element appears only once, returning the count of unique elements. Two Python solutions are demonstrated: a pop-based approach that removes duplicate elements directly, running in 57ms, and a faster head-pointer method that overwrites duplicates by shifting unique values to the front, running in just 7ms. Both solutions use approximately 13–13.7MB of memory. The head-pointer approach is more efficient because it avoids the overhead of repeatedly resizing the array. A key insight is that elements beyond index k-1 do not need to remain organized, as the problem explicitly states they will be ignored.