Leetcode 1984. Minimum Difference Between Highest and Lowest of K Scores

Given an array of student scores and an integer k, choose k scores so the difference between the highest and lowest selected score is minimized. This is typically solved by sorting the array and scanning all length-k contiguous windows to find the smallest max−min range.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1984. Minimum Difference Between Highest and Lowest of K Scores

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact