remove elements from slice

The problem is that when you remove an element from the original list, all subsequent elements are shifted . But the rangeloop doesn't know that you changed the underlying slice, and will increment the index as usual, which shouldn't be done even in this case, because then you're skipping an element.

And since the removelist contains 2 elements that were next to each other in the original list, the second element ( in this case) will not be checked and will not be removed."abc"

A possible solution is to not rangeuse in the outer loop, and when removing an element, you can manually decrease the index, since it will be automatically incremented by proceeding to the next iteration:i--

urlList := []string{"test", "abc", "def", "ghi"}
remove := []string{"abc", "test"}

loop:
for i := 0; i < len(urlList); i++ {
    url := urlList[i]
    for _, rem := range remove {
        if url == rem {
            urlList = append(urlList[:i], urlList[i+1:]...)
            i-- // Important: decrease index
            continue loop
        }
    }
}

fmt.Println(urlList)

output:

[def ghi]

Notice:

Since the outer loop contains nothing after the inner loop, you can replace label+continue with the simple break:

urlList := []string{"test", "abc", "def", "ghi"}
remove := []string{"abc", "test"}

for i := 0; i < len(urlList); i++ {
    url := urlList[i]
    for _, rem := range remove {
        if url == rem {
            urlList = append(urlList[:i], urlList[i+1:]...)
            i-- // Important: decrease index
            break
        }
    }
}

fmt.Println(urlList)

Try it out on the Go Playground .

Alternative

The alternative is to make the outer loop downward, so there is no need to manually decrease (or increase) the index variable, as the shifted elements are not affected (since the downward direction is already handled).