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

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

|1620|[Coordinate With Maximum Network Quality](https://leetcode.com/problems/coordinate-with-maximum-network-quality/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1620.java)||Greedy|Medium|

|1614|[Maximum Nesting Depth of the Parentheses](https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1614.java)||Easy|String|

|1609|[Even Odd Tree](https://leetcode.com/problems/even-odd-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1609.java)||Medium|Tree|

|1608|[Special Array With X Elements Greater Than or Equal X](https://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1608.java)||Easy|Array|

packagecom.fishercoder.solutions;

publicclass_1620 {

publicstaticclassSolution1 {

publicstaticint[]bestCoordinate(int[][]towers,intradius) {

intmaxSignal =0;

int[]best =newint[2];

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

intthisQuality =0;

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

doubledistance =Math.sqrt((towers[i][0] -towers[j][0]) * (towers[i][0] -towers[j][0]) + (towers[i][1] -towers[j][1]) * (towers[i][1] -towers[j][1]));

if (distance <=radius) {

thisQuality +=Math.floor(towers[j][2] / (1 +distance));

}

}

if (thisQuality >maxSignal) {

maxSignal =thisQuality;

best[0] =towers[i][0];

best[1] =towers[i][1];

}elseif (thisQuality ==maxSignal) {

if (towers[i][0] <best[0]) {

best[0] =towers[i][0];

best[1] =towers[i][1];

}elseif (towers[i][0] ==best[0] &&towers[i][1] <best[1]) {

best[0] =towers[i][0];

best[1] =towers[i][1];

}

}

}

returnbest;

}

}

}