title: Array Element Moved K Using Single Moves
signature: func arrayElementMovedKUsingSingleMoves(a []int, n int, k int) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(a []int, n int, k int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(a, n, k),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver([]int{2, 5, 5, 9, 10, 10, 11, 14, 23, 27, 31, 32, 33, 33, 33, 37, 39, 41, 41, 42, 42, 43, 47, 60, 61, 68, 73, 73, 73, 78, 80, 80, 82, 83, 86, 87, 89, 92, 94, 98}, 
  	33, 
  	37, 33)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver([]int{80, -58, 64, 48, -16, 60, -50, -52, 62, -86, -96, 52, 26, -30, 14}, 
  	14, 
  	13, 14)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver([]int{0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1}, 
  	7, 
  	6, 7)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver([]int{90, 23, 43, 42, 7, 71, 79}, 
  	4, 
  	4, 4)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver([]int{-96, -96, -90, -84, -68, -64, -56, -56, -50, -50, -48, -46, -28, -18, 0, 0, 6, 32, 32, 34, 42, 42, 46, 50, 50, 52, 64, 64, 70, 76, 84, 88}, 
  	28, 
  	21, 64)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver([]int{1, 1, 1}, 
  	1, 
  	2, 1)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver([]int{2, 9, 15, 19, 26, 29, 42, 45, 46, 47, 55, 60, 60, 61, 62, 64, 68, 69, 74, 79, 96}, 
  	14, 
  	17, 14)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver([]int{-32, 12, 80, 42, 80, 8, 58, -76, -42, -98, 22, -90, -16, -4, -62, -32, 28, 12, 78, -52, -84, 78, 88, -76, -52, 68, -34, -16, -4, 2, -78, -94, -22, 34, 6, -62, 72}, 
  	26, 
  	31, 26)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver([]int{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, 
  	26, 
  	14, 1)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver([]int{52, 19}, 
  	1, 
  	1, 1)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
source_py: def array_element_moved_k_using_single_moves(a, n, k):
      if (k >= (n - 1)):
          return n
      best = 0
      times = 0
      for i in range(n):
          if (a[i] > best):
              best = a[i]
              if (i == True):
                  times = 1
          else:
              times += 1
          if (times >= k):
              return best
      return best
source_cpp: int array_element_moved_k_using_single_moves(vector<int> a, int n, int k) {
    if ( k >= n - 1 ) return n;
    int best = 0, times = 0;
    for ( int i = 0;
    i < n;
    i ++ ) {
      if ( a [ i ] > best ) {
        best = a [ i ];
        if ( i ) times = 1;
      }
      else times += 1;
      if ( times >= k ) return best;
    }
    return best;
  }