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

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

|1769|[Minimum Number of Operations to Move All Balls to Each Box](https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1769.java)||Medium|Array, Greedy|

|1768|[Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1768.java)||Easy|String|

|1765|[Map of Highest Peak](https://leetcode.com/problems/map-of-highest-peak/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1765.java)||Medium|BFS, Graph|

|1764|[Form Array by Concatenating Subarrays of Another Array](https://leetcode.com/problems/form-array-by-concatenating-subarrays-of-another-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1764.java)||Medium|Array, Greedy|

packagecom.fishercoder.solutions;

publicclass_1769 {

publicstaticclassSolution1 {

publicint[]minOperations(Stringboxes) {

int[]box =newint[boxes.length()];

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

box[i] =boxes.charAt(i) -'0';

}

int[]result =newint[boxes.length()];

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

intops =0;

for (intj =0;j <boxes.length();j++) {

if (i !=j &&box[j] ==1) {

ops +=Math.abs(j -i);

}

}

result[i] =ops;

}

returnresult;

}

}

}