Easy C++ solution
```   \nint minDeletion(vector& v)\n{   \n        int c = 0;\n        int n = v.size();\n        for (int i = 0; i <n-1 ; i++)\n            if (v[i] == v[i + 1]
```   \nint minDeletion(vector<int>& v)\n{   \n        int c = 0;\n        int n = v.size();\n        for (int i = 0; i <n-1 ; i++)\n            if (v[i] == v[i + 1] &&  i% 2 == c%2 ) c++;\n        \n        return c + (n- c) % 2;\n }\n\t
[]