func (s *Solution) printMax(arr []int, k int) []int {
    result := []int{}
    queue := []int{}

    for i := 0; i < len(arr); i++ {
        if len(queue) > 0 && queue[0] < i-k+1 {
            queue = queue[1:]
        }

        for len(queue) > 0 && arr[queue[len(queue)-1]] < arr[i] {
            queue = queue[:len(queue)-1]
        }

        queue = append(queue, i)

        if i >= k-1 {
            result = append(result, arr[queue[0]])
        }
    }
    return result
}