We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
def maxMin(k, arr):
# Write your code here
arr.sort()
minimum = 99999999999
n = k-1
for i in range(len(arr)-k+1):
if minimum> (arr[n+i]-arr[i]):
minimum = arr[n+i]-arr[i]
return minimum
def maxMin(k, arr):
def maxMin(k, arr): # Write your code here arr.sort() minimum = 99999999999 n = k-1 for i in range(len(arr)-k+1): if minimum> (arr[n+i]-arr[i]): minimum = arr[n+i]-arr[i] return minimum
Java, O(n log n)
Java
JS: