ANSWERED ALL QUES | SIMPLE | EXPLAINED ALL CONCEPTS
Intuition\n Describe your first thoughts on how to solve this problem. \nSNOWBALL METHOD:\nAs we go through the nums array if we got valid element to remove we 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nSNOWBALL METHOD:\nAs we go through the nums array if we got valid element to remove we are going to increase the size of eleSize;\n\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\nUsed SNOWBALL METHOD:\nif we got the element which needed to remove we will increase the eleSize by one and for next all position need to remove the nos of element which were previously removed as we go through this we get the removed element count;\n\nWHY i=i+2?\nif we needed to check if we needed to remove the element we needed to just jump by two as we are going to check only at even position\n\nWhy i--?\nWhenever we got the element we are going to increase the size of removed element and then our arr get shrink at that pos when this happens even position where we are going to check vaild or not element to remove also need to reduce by one;\n\nAfter all this if after removing all element size is not even we are going to increase the count 0f removed element as we needed to remove any element from any position\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\nO(n)\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\nO(1)\n# Code\n```\nclass Solution {\n    public int minDeletion(int[] nums) {\n        int eleSize = 0;\n        for(int i=0; i<nums.length-1; i = i+2){\n            if((i-eleSize)%2 == 0 && (nums[i] == nums[i+1])){\n                eleSize++;\n                i--;\n            }\n        }\n        if((nums.length - eleSize)%2 == 0)\n            return eleSize;\n        return eleSize +1;\n    }\n}\n```
['Array', 'Two Pointers', 'Greedy', 'Sliding Window', 'Java']