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

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

|2028|[Find Missing Observations](https://leetcode.com/problems/find-missing-observations/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2028.java)||Medium||

|2027|[Minimum Moves to Convert String](https://leetcode.com/problems/minimum-moves-to-convert-string/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2027.java)||Easy||

|2023|[Number of Pairs of Strings With Concatenation Equal to Target](https://leetcode.com/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2023.java)||Medium||

|2022|[Convert 1D Array Into 2D Array](https://leetcode.com/problems/convert-1d-array-into-2d-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2022.java)||Easy||

packagecom.fishercoder.solutions;

publicclass_2028 {

publicstaticclassSolution1 {

publicint[]missingRolls(int[]rolls,intmean,intn) {

longsum =0l;

for (intnum :rolls) {

sum +=num;

}

longtotalSum = (rolls.length +n) *mean;

longremainder =totalSum -sum;

if (remainder /n >6 || (remainder /n ==6 &&remainder %n !=0) ||remainder /n <0 ||remainder <n) {

returnnewint[]{};

}

intave = (int) (remainder /n);

intremain = (int) (remainder %n);

int[]ans =newint[n];

intk =0;

while (k <n) {

ans[k++] =ave +remain >0 ?1 :0;

remain--;

}

returnans;

}

}

}

packagecom.fishercoder;

importcom.fishercoder.solutions._2028;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticorg.junit.Assert.assertArrayEquals;

publicclass_2028Test {

privatestatic_2028.Solution1solution1;

publicstaticvoidsetup() {

solution1 =new_2028.Solution1();

}

publicvoidtest1() {

assertArrayEquals(newint[]{},solution1.missingRolls(newint[]{4,2,2,5,4,5,4,5,3,3,6,1,2,4,2,1,6,5,4,2,3,4,2,3,3,5,4,1,4,4,5,3,6,1,5,2,3,3,6,1,6,4,1,3},2,53));

}

}