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

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

| 2255|[Count Prefixes of a Given String](https://leetcode.com/problems/count-prefixes-of-a-given-string/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2255.java)|| Easy||

| 2256|[Minimum Average Difference](https://leetcode.com/problems/minimum-average-difference/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2256.java)|| Medium||

| 2255|[Count Prefixes of a Given String](https://leetcode.com/problems/count-prefixes-of-a-given-string/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2255.java)|| Easy||

| 2248|[Intersection of Multiple Arrays](https://leetcode.com/problems/intersection-of-multiple-arrays/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2248.java)|| Easy||

| 2244|[Minimum Rounds to Complete All Tasks](https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2244.java)|| Medium||

| 2243|[Calculate Digit Sum of a String](https://leetcode.com/problems/calculate-digit-sum-of-a-string/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2243.java)|| Easy||

packagecom.fishercoder.solutions;

publicclass_2256 {

publicstaticclassSolution1 {

publicintminimumAverageDifference(int[]nums) {

if (nums.length ==1) {

return0;

}

longsecondHalfSum =0;

intminAveDiff =Integer.MAX_VALUE;

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

secondHalfSum +=nums[i];

}

longfirstHalfSum =nums[0];

intcount =1;

intminDiffIndex =0;

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

intfirstHalfAve = (int) (firstHalfSum /count);

intsecondHalfAve =0;

if ((nums.length -count) !=0) {

secondHalfAve = (int) (secondHalfSum / (nums.length -count));

}

if (minAveDiff >Math.abs(firstHalfAve -secondHalfAve)) {

minAveDiff =Math.abs(firstHalfAve -secondHalfAve);

minDiffIndex =i;

if (minAveDiff ==0) {

returnminDiffIndex;

}

}

count++;

i++;

if (i <nums.length) {

firstHalfSum +=nums[i];

secondHalfSum -=nums[i];

}

}

returnminDiffIndex;

}

}

}