| # | Title | Solutions | Video | Difficulty | Tag

|-----|----------------|---------------|--------|-------------|-------------

|1984|[Minimum Difference Between Highest and Lowest of K Scores](https://leetcode.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1984.java)||Easy||

|1981|[Minimize the Difference Between Target and Chosen Elements](https://leetcode.com/problems/minimize-the-difference-between-target-and-chosen-elements/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1981.java)||Medium|DP|

|1980|[Find Unique Binary String](https://leetcode.com/problems/find-unique-binary-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1980.java)||Medium||

|1979|[Find Greatest Common Divisor of Array](https://leetcode.com/problems/find-greatest-common-divisor-of-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1979.java)||Easy||

packagecom.fishercoder.solutions;

importjava.util.Arrays;

publicclass_1984 {

publicstaticclassSolution1 {

publicintminimumDifference(int[]nums,intk) {

Arrays.sort(nums);

intminDiff =nums[nums.length -1];

for (inti =0;i <=nums.length -k;i++) {

minDiff =Math.min(minDiff,nums[i +k -1] -nums[i]);

}

returnminDiff;

}

}

}

packagecom.fishercoder;

importcom.fishercoder.solutions._1984;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticorg.junit.Assert.assertEquals;

publicclass_1984Test {

privatestatic_1984.Solution1solution1;

publicstaticvoidsetup() {

solution1 =new_1984.Solution1();

}

publicvoidtest1() {

assertEquals(0,solution1.minimumDifference(newint[]{90},1));

}

publicvoidtest2() {

assertEquals(2,solution1.minimumDifference(newint[]{9,4,1,7},2));

}

}