title: Find The Minimum Distance Between Two Numbers
signature: fun findTheMinimumDistanceBetweenTwoNumbers(arr: ArrayList<Int>, n: Int, x: Int, y: Int): Int {
test_code: package main
  
  import kotlin.text.*
  import kotlin.math.*
  
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  fun validateSolution(actual:Int, expected:Int):Boolean{
    return actual.equals(expected)
  }
  fun driver(arr: ArrayList<Int>, n: Int, x: Int, y: Int, expected:Int):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(arr, n, x, y), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver(arrayListOf(4, 7, 7, 8, 11, 14, 16, 25, 34, 35, 36, 36, 38, 40, 41, 43, 45, 47, 57, 60, 64, 72, 73, 74, 75, 82, 83, 83, 84, 84, 84, 92), 22, 7, 40, 99999999)
      println("TEST-0...${result}")
      
      result = driver(arrayListOf(96, 70, 88, -64, -42, 58, 92, 66, -14, 90, -66, 12, 88, -12, 48, -4, 90, 24, 98, 14, 32, 38, 98, 78, 2, 26, 12, -36, 90, 80, 40, 58, 88, 64, 16), 25, 58, 70, 99999999)
      println("TEST-1...${result}")
      
      result = driver(arrayListOf(0, 0, 1), 1, 1, 1, 99999999)
      println("TEST-2...${result}")
      
      result = driver(arrayListOf(46, 96, 82, 73, 30, 36, 56, 20, 5, 36, 4, 7, 89, 63, 54, 97, 80, 56, 93, 34, 90, 56, 25, 27, 75, 68, 14, 90), 26, 54, 82, 99999999)
      println("TEST-3...${result}")
      
      result = driver(arrayListOf(-96, -88, -82, -66, -62, -52, -52, -46, -46, -40, -40, -28, -24, -12, 0, 4, 10, 24, 42, 46, 48, 48, 50, 60, 62, 64, 64, 70, 92, 98), 24, 0, 4, 99999999)
      println("TEST-4...${result}")
      
      result = driver(arrayListOf(0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1), 10, 0, 1, 2)
      println("TEST-5...${result}")
      
      result = driver(arrayListOf(1, 2, 2, 6, 10, 14, 15, 18, 19, 22, 23, 29, 30, 37, 40, 40, 41, 41, 42, 42, 44, 46, 46, 54, 56, 72, 73, 81, 83, 83, 86, 88, 93), 27, 1, 42, 18)
      println("TEST-6...${result}")
      
      result = driver(arrayListOf(46, 86, -52, 18, -32, 86, 2, 38, 72, 72, -60, 70, -58, 66, -66, -72, -74, 58, 52, 58, 16, 64, 62, -62, 80, -70, -96, -44, -20, -74, -10, 14, -32, 48, 30, 76, -16, 80, 66, -46, -92, 26, -86, 28, -76, -24, -98, 54, 50), 30, 25, 45, 99999999)
      println("TEST-7...${result}")
      
      result = driver(arrayListOf(0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 1, 1, 1, 1, 1, 1, 1), 38, 0, 0, 1)
      println("TEST-8...${result}")
      
      result = driver(arrayListOf(32, 65, 10, 72, 17, 58, 79, 28, 67, 36, 18, 35), 7, 10, 7, 99999999)
      println("TEST-9...${result}")
      
          
  }
  
  main()
source_py: def find_the_minimum_distance_between_two_numbers(arr, n, x, y):
      min_dist = 99999999
      for i in range(n):
          for j in range((i + 1), n):
              if ((((x == arr[i]) and (y == arr[j])) or ((y == arr[i]) and (x == arr[j]))) and (min_dist > abs((i - j)))):
                  min_dist = abs((i - j))
          return min_dist
source_cpp: int find_the_minimum_distance_between_two_numbers(vector<int> arr, int n, int x, int y) {
    int i, j;
    int min_dist = INT_MAX;
    for ( i = 0;
    i < n;
    i ++ ) {
      for ( j = i + 1;
      j < n;
      j ++ ) {
        if ( ( x == arr [ i ] && y == arr [ j ] || y == arr [ i ] && x == arr [ j ] ) && min_dist > abs ( i - j ) ) {
          min_dist = abs ( i - j );
        }
      }
    }
    return min_dist;
  }