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

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

|1710|[Maximum Units on a Truck](https://leetcode.com/problems/largest-subarray-length-k/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1708.java)||Easy|Array, Greedy|

|1708|[Largest Subarray Length K](https://leetcode.com/problems/largest-subarray-length-k/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1708.java)||Easy|Array, Greedy|

|1704|[Determine if String Halves Are Alike](https://leetcode.com/problems/determine-if-string-halves-are-alike/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1704.java)||Easy|String|

|1700|[Number of Students Unable to Eat Lunch](https://leetcode.com/problems/number-of-students-unable-to-eat-lunch/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1700.java)||Easy|Array|

packagecom.fishercoder.solutions;

importjava.util.Arrays;

publicclass_1710 {

publicstaticclassSolution1 {

publicintmaximumUnits(int[][]boxTypes,inttruckSize) {

Arrays.sort(boxTypes, (a,b) ->b[1] -a[1]);

inttotalUnits =0;

intloadedBoxes =0;

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

intnumber =boxTypes[i][0];

while (loadedBoxes <truckSize &&number >0) {

totalUnits +=boxTypes[i][1];

number--;

loadedBoxes++;

}

}

returntotalUnits;

}

}

}