Go Cyclic Rotation
func cyclicRotation(a []int, k int) []int {
size := len(a)
if size == 0 || k <= 0 {
return a
}
k %= size
result := make([]int, size)
for i, v := range a {
result[(i+k)%size] = v
}
return result
}
This rotates the array to the right by K steps and keeps the wrap-around values in the correct order.