input: from typing import List
  
  def find_champion_player(skills: List[int], k: int) -> int:
      """
      In a competition consisting of n participants numbered from 0 to n - 1, 
  
      you are provided with an integer array skills of size n and a positive integer k. Here, skills[i] represents the skill level of player i and all integers in the array skills are distinct.
  
      Initially, all players stand in a queue ordered from player 0 to player n - 1.
  
      The competition follows these rules:
  
      The first two players in the queue compete, and the one with the higher skill level wins.
      The winner remains at the front of the queue while the loser goes to the end.
      The champion is the first participant who achieves k consecutive victories.
  
      Return the starting index of this champion.
  
      Examples:
      >>> skills = [4,2,6,3,9], k = 2
      2
      >>> skills = [2,5,4], k = 3
      1
  
      Constraints:
      n == len(skills)
      2 <= n <= 10^5
      1 <= k <= 10^9
      1 <= skills[i] <= 10^6
      All numbers in skills are distinct.
      """
output:     
      from collections import deque
      
      queue = deque(skills)
      current_champion = queue.popleft()
      consecutive_wins = 0
      
      while consecutive_wins < k:
          opponent = queue.popleft()
          if current_champion > opponent:
              consecutive_wins += 1
              queue.append(opponent)
          else:
              consecutive_wins = 1
              queue.append(current_champion)
              current_champion = opponent
  
      return skills.index(current_champion)
  