Official algorithmic problem description and constraints.
You are given an array 𝐴 of length 𝑁, and an integer 𝐾.
You can perform the following operation:
Find the minimum possible value of max(𝐴)−min(𝐴) attainable, if you can perform this operation as many times as you like (possibly, zero times).
Detailed video explanations, mathematical intuition, and clean C++ implementation code.
