more optimized remove dups

removeDups.go

//In O(n) time, and using O(1) space, remove duplicates from an array
func removeDups(arr []int) []int {
	nextUnduplicatedIdx := 1
	//O(n) time complexity
	for i := 1; i < len(arr); i++ {
		//if the adjacent elements are not equal, assign the element at i to our nextUnduplicatedIdx
		if arr[nextUnduplicatedIdx-1] != arr[i] {
			arr[nextUnduplicatedIdx] = arr[i]
			nextUnduplicatedIdx++
		}
	}
	return arr[:nextUnduplicatedIdx]
}