https://leetcode.com/problems/longest-common-prefix/

remove_dupes.py

class Solution:
    def removeDuplicates(self, nums: List[int]) -> int:
        if len(nums) < 2: return len(nums)
        length = 1
        cur = 0
        future = 1
        while future < len(nums):
            if nums[cur] == nums[future]:
                nums[future] = 0
            else:
                cur = cur+1
                nums[cur] = nums[future]
                length += 1
            future +=1

        return length