O(nlogn) || Sliding Window || 4 Line Solution || Explanation
The logic is that after sorting the array in ascending order it will be divided into n windows of k sizes\n\nEg :- [9,4,1,7]\nSort :- [1,4,7,9]\n\nNow the quest
**The logic is that after sorting the array in ascending order it will be divided into n windows of k sizes**\n\nEg :- `[9,4,1,7]`\nSort :- `[1,4,7,9]`\n\nNow the question simply becomes find the minimum difference between lowest and highest element of window of size k  **Windows :- `[1,4]  [4,7]  [7,9]`**\nAnswer = `min((4-1),(7-4),(9-7))`\n\n\n<iframe src="https://leetcode.com/playground/fYW2RmZg/shared" frameBorder="0" width="800" height="300"></iframe>
[]