MergeSliceWithStep merge l2 to l1 with step For every step l1 elements one l2 element is inserted and the rest is appended directly tofunc MergeSliceWithStepT anyl1 T l2 T step int T

func MergeSliceWithStep[T any](l1 []T, l2 []T, step int) []T { merged := make([]T, len(l1)+len(l2)) i, j := 0, 0

for i < len(l1) && j < len(l2) {
    for k := 0; k < step && i < len(l1); k++ {
        merged[i+j] = l1[i]
        i++
    }
    merged[i+j] = l2[j]
    j++
}

for i < len(l1) {
    merged[i+j] = l1[i]
    i++
}

for j < len(l2) {
    merged[i+j] = l2[j]
    j++
}

return merged

}