Find duplicates in an array where an index K is provided such that each window size with indices I and J satisfy abs(J - I) <= K.

DS_ALGO_Arrays_001.kt

import kotlin.system.*

fun main() {

   val l = mutableListOf<Int>()
   
   for(i in 1..23){
       l.add(i)
   }
  
  fun findDupes(arr: List<Int>, k : Int) : Boolean {
      val s : MutableSet<Int> = mutableSetOf() 
   	  var x = 0
      var y = k
      
      if(arr.size < 1 || k < 0){
          return false
      }
      
      if(k == 0 || k >= arr.size -1){
          for(i in 0 until arr.size){
              if(s.contains(arr[i])){
                  return true
              }
              s.add(arr[i]) 
          }
      }else{
         while(y < arr.size -1 && x < y){
          for(i in x..y){
              if(s.contains(arr[i])){
                  return true
              }
              s.add(arr[i])
          }
             x = if(y + 1 < arr.size - 1) y + 1 else x + 1       
             y = if (y + k < arr.size - 1) y + k else arr.size -1 
         }   
      }
      
      return false
  } 
  
 print(" Time: ${measureTimeMillis(){ print(findDupes(l, 5))}} milliseconds")
}