| # | 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|

|1619|[Mean of Array After Removing Some Elements](https://leetcode.com/problems/mean-of-array-after-removing-some-elements/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1620.java)||Array|Easy|

|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;

importjava.util.Arrays;

publicclass_1619 {

publicstaticclassSolution1 {

publicdoubletrimMean(int[]arr) {

Arrays.sort(arr);

intn =arr.length;

longsum =0;

for (inti = (int)Math.round(n *0.05);i < (n -n *0.05);i++) {

sum +=arr[i];

}

returnsum / (n -n *0.1);

}

}

}