Simple Java Solution ||  faster than 71.91% of Java online submissions
\n\nclass Solution {\n    public int minDeletion(int[] nums) {\n        int delete=0;\n        for(int i =0; i < nums.length -1;i++){\n            int ind = i-d
```\n\nclass Solution {\n    public int minDeletion(int[] nums) {\n        int delete=0;\n        for(int i =0; i < nums.length -1;i++){\n            int ind = i-delete;\n            if(ind%2 == 0 && nums[i] == nums[i+1]){\n                delete++;\n                \n            }\n           \n        }\n        \n        return ((nums.length-delete)%2 == 0)? delete : delete+1;\n        \n    }\n}\n```
['Greedy', 'Java']