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

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

| 2270|[Number of Ways to Split Array](https://leetcode.com/problems/number-of-ways-to-split-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2270.java)|| Medium||

| 2279|[Maximum Bags With Full Capacity of Rocks](https://leetcode.com/problems/maximum-bags-with-full-capacity-of-rocks/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2279.java)|| Medium||

| 2270|[Number of Ways to Split Array](https://leetcode.com/problems/number-of-ways-to-split-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2270.java)|| Medium||

| 2269|[Find the K-Beauty of a Number](https://leetcode.com/problems/find-the-k-beauty-of-a-number/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2269.java)|| Easy||

| 2264|[Largest 3-Same-Digit Number in String](https://leetcode.com/problems/largest-3-same-digit-number-in-string/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2264.java)|| Easy||

| 2260|[Minimum Consecutive Cards to Pick Up](https://leetcode.com/problems/minimum-consecutive-cards-to-pick-up/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2260.java)|| Medium||

packagecom.fishercoder.solutions;

importjava.util.Arrays;

publicclass_2279 {

publicstaticclassSolution1 {

publicintmaximumBags(int[]capacity,int[]rocks,intadditionalRocks) {

int[]delta =newint[capacity.length];

intans =0;

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

if (capacity[i] ==rocks[i]) {

ans++;

}else {

delta[i] =capacity[i] -rocks[i];

}

}

Arrays.sort(delta);

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

if (delta[i] !=0) {

if (additionalRocks >=delta[i]) {

ans++;

additionalRocks -=delta[i];

}

}

}

returnans;

}

}

}