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

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

|1792|[Maximum Average Pass Ratio](https://leetcode.com/problems/maximum-average-pass-ratio/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1792.java)||Medium|Heap|

|1791|[Find Center of Star Graph](https://leetcode.com/problems/find-center-of-star-graph/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1791.java)||Medium|Graph|

|1790|[Check if One String Swap Can Make Strings Equal](https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1790.java)||Easy|String|

|1785|[Minimum Elements to Add to Form a Given Sum](https://leetcode.com/problems/minimum-elements-to-add-to-form-a-given-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1785.java)||Medium|Greedy|

packagecom.fishercoder.solutions;

importjava.util.PriorityQueue;

publicclass_1792 {

publicstaticclassSolution1 {

publicdoublemaxAverageRatio(int[][]classes,intextraStudents) {

PriorityQueue<double[]>maxHeap =newPriorityQueue<>((a,b) -> -Double.compare(a[0],b[0]));

for (int[]c :classes) {

maxHeap.offer(newdouble[]{(double) (c[0] +1) / (c[1] +1) - (double)c[0] /c[1],c[0],c[1]});

}

while (extraStudents-- >0) {

double[]curr =maxHeap.poll();

curr[1]++;

curr[2]++;

curr[0] = (curr[1] +1) / (curr[2] +1) -curr[1] /curr[2];

maxHeap.offer(curr);

}

doubleresult =0.0;

intsize =maxHeap.size();

while (!maxHeap.isEmpty()) {

double[]curr =maxHeap.poll();

result +=curr[1] /curr[2];

}

returnresult /size;

}

}

}

packagecom.fishercoder;

importcom.fishercoder.common.utils.CommonUtils;

importcom.fishercoder.solutions._1792;

importcom.fishercoder.solutions._3;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticorg.junit.Assert.assertEquals;

publicclass_1792Test {

privatestatic_1792.Solution1solution1;

publicstaticvoidsetup() {

solution1 =new_1792.Solution1();

}

publicvoidtest1() {

assertEquals(0.78333,solution1.maxAverageRatio(CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[1,2],[3,5],[2,2]"),2),0.00001);

}

}