title: Minimum Difference Max Min K Size Subsets
signature: func minimumDifferenceMaxMinKSizeSubsets(arr []int, n int, k int) int64 {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int64, expected int64) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(arr []int, n int, k int, expected int64) string {
      if validateSolution(PLACEHOLDER_FN_NAME(arr, 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{1, 1, 4, 18, 21, 35, 37, 39, 76, 81, 86, 92, 96}, 
  	7, 
  	6, 34)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver([]int{-94, -86, -48, -48, -38, -8, -6, 0, 2, 24, 34, 52, 62}, 
  	9, 
  	12, 2147483647)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver([]int{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}, 
  	16, 
  	26, 2147483647)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver([]int{3, 10, 13, 23, 30, 30, 34, 36, 37, 39, 43, 50, 57, 66, 71, 74, 81, 83, 89, 94, 94, 99}, 
  	17, 
  	20, 2147483647)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver([]int{-96, -94, -92, -84, -80, -72, -24, -22, -18, -14, 6, 8, 26, 28, 30, 36, 50, 58, 80, 84, 92, 92}, 
  	21, 
  	12, 82)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver([]int{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, 
  	21, 
  	22, 2147483647)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver([]int{6, 7, 9, 27, 30, 42, 54, 55, 57, 57, 59, 76, 84, 84, 84}, 
  	13, 
  	14, 2147483647)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver([]int{-96, -86, -80, -72, -70, -68, -64, -64, -56, -54, -38, -30, -24, -16, -16, -12, -12, -10, 0, 0, 4, 4, 24, 28, 38, 40, 44, 48, 50, 54, 54, 62, 62, 68, 80, 84, 88, 88, 92, 94}, 
  	31, 
  	26, 122)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver([]int{0, 1}, 
  	1, 
  	1, 0)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver([]int{1, 6, 7, 8, 10, 10, 18, 54, 55, 56, 59, 59, 61, 63, 67, 69, 75, 78, 88, 89, 93, 97, 98}, 
  	22, 
  	14, 39)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
source_py: def minimum_difference_max_min_k_size_subsets(arr, N, K):
      arr.sort()
      res = 2147483647
      for i in range(((N - K) + 1)):
          curSeqDiff = (arr[((i + K) - 1)] - arr[i])
          res = min(res, curSeqDiff)
      return res
source_cpp: int minimum_difference_max_min_k_size_subsets(vector<int> arr, int N, int K) {
    sort(arr.begin(), arr.end());
    int res = INT_MAX;
    for ( int i = 0;
    i <= ( N - K );
    i ++ ) {
      int curSeqDiff = arr [ i + K - 1 ] - arr [ i ];
      res = min ( res, curSeqDiff );
    }
    return res;
  }