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

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

|1992|[Find All Groups of Farmland](https://leetcode.com/problems/find-all-groups-of-farmland/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1992.java)||Medium||

|1991|[Find the Middle Index in Array](https://leetcode.com/problems/find-the-middle-index-in-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1991.java)||Easy||

|1985|[Find the Kth Largest Integer in the Array](https://leetcode.com/problems/find-the-kth-largest-integer-in-the-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1985.java)||Medium||

|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|

packagecom.fishercoder.solutions;

publicclass_1991 {

publicstaticclassSolution1 {

publicintfindMiddleIndex(int[]nums) {

intmiddleIndex = -1;

longsum =0;

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

sum +=nums[i];

}

longleftSum =0;

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

sum -=nums[i];

if (i >0) {

leftSum +=nums[i -1];

}

if (sum ==leftSum) {

returni;

}

}

returnmiddleIndex;

}

}

}

packagecom.fishercoder;

importcom.fishercoder.solutions._1991;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticorg.junit.Assert.assertEquals;

publicclass_1991Test {

privatestatic_1991.Solution1solution1;

publicstaticvoidsetup() {

solution1 =new_1991.Solution1();

}

publicvoidtest1() {

assertEquals(3,solution1.findMiddleIndex(newint[]{2,3, -1,8,4}));

}

}