Coded a solution in 1 minute and it's no worse than any others
I coded this solution in literally 1 minute. And I checked the top voted solutions in the discuss section. Surprisingly none is better than mine!\n\nO(1) space 
I coded this solution in literally 1 minute. And I checked the top voted solutions in the discuss section. Surprisingly none is better than mine!\n\n**O(1) space and O(n) time**\n\n```py\ndef minDeletion(self, nums: List[int]) -> int:\n    res = i = 0\n    while i + 1 < len(nums):\n        if nums[i] != nums[i + 1]:\n            i += 2\n        else:\n            res += 1\n            i += 1\n    if (len(nums) - res) % 2 == 1:\n        res += 1\n    return res\n```\n\nYes there are shorter solutions, but readability counts!
[]