Easy to understand two pointer solution in Golalng
go\nfunc minDeletion(nums []int) int {\n  left, right := 0, 1\n  var deletions int\n  for right < len(nums) {\n    // Move the right pointer as much as needed s
```go\nfunc minDeletion(nums []int) int {\n  left, right := 0, 1\n  var deletions int\n  for right < len(nums) {\n    // Move the right pointer as much as needed so that the elements at\n\t// left and right are different\n    for right < len(nums) && nums[right] == nums[left] {\n      right++\n      deletions++\n    }\n\t// Make right and left adjacent\n    right += 2\n    left = right - 1\n  }\n  if (len(nums)-deletions)%2 == 1 { // length of the array after deletions is odd\n    deletions++\n  }\n  return deletions\n}\n```
['Two Pointers', 'Go']