Question: 
Write a function to find the minimum number of elements that should be removed such that amax-amin<=k.


Model's Code:
def removals(arr, n, k):
    arr.sort()
    left = 0
    min_removals = float('inf')
    
    for right in range(n):
        while arr[right] - arr[left] > k:
            left += 1
        min_removals = min(min_removals, left + n - right - 1)
    
    return min_removals



Sample Correct Code:
def find_ind(key, i, n, 
			k, arr):
	ind = -1
	start = i + 1
	end = n - 1;
	while (start < end):
		mid = int(start +
				(end - start) / 2)
		if (arr[mid] - key <= k):
			ind = mid
			start = mid + 1
		else:
			end = mid
	return ind
def removals(arr, n, k):
	ans = n - 1
	arr.sort()
	for i in range(0, n):
		j = find_ind(arr[i], i, 
					n, k, arr)
		if (j != -1):
			ans = min(ans, n -
						(j - i + 1))
	return ans


Asserts:
assert removals([1, 3, 4, 9, 10,11, 12, 17, 20], 9, 4) == 5
assert removals([1, 5, 6, 2, 8], 5, 2) == 3
assert removals([1, 2, 3 ,4, 5, 6], 6, 3) == 2


Tests:
Test 1 of 3: PASS
Test 2 of 3: PASS
Test 3 of 3: PASS

Test 702 of 974: 530/702 (75.49857549857549%): success