Slidding Window Problem- Find max number in each window of size K

SliddingWindow.java

public List<Integer> findMaxNumberInGivenSubArray(List<Intger> inputArray, int k){
  
  Deque<Integer> deque = new LinkedList<>();
  List<Integer> ouputArray = new ArrayList<>();
   int i =0;
     for(; i < k; i++){
       while(!deque.isEmpty() && inputArray.get(deque.peekLast()) < inputArray.get(i)){
           deque.removeLast();
       }
       dequeu.putLast(i);
     }
    for(; i < inputArray.size(); i++){
     
      outputArray.add(deque.peekFirst());
      
      while(!deque.isEmpty() && deque.peekFirst() <= i-k){
        deque.removeFirt();
      }
      
     while(!deque.isEmpty() && inputArray.get(deque.peekLast()) < inputArray.get(i)){
       deque.removeLast();
     }
      deque.addLast(i);
    }
  return ouputArray;
}