|366|[Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_366.java)| O(n)|O(h) | Medium| DFS

|365|[Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_365.java)| O(n)|O(1) | Medium| Math

|364|[Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_364.java)| O(n)|O(h) | Medium| DFS

|363|[Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_363.java)| | | Hard| DP

|362|[Design Hit Counter](https://leetcode.com/problems/design-hit-counter/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_362.java)| O(1) amortized|O(k) | Medium| Design

|361|[Bomb Enemy](https://leetcode.com/problems/bomb-enemy/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_361.java)| O(?)|O(?)| Medium|

|360|[Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_360.java)| O(n)|O(1) | Medium| Two Pointers, Math

packagecom.fishercoder.solutions;

importjava.util.TreeSet;

publicclass_363 {

publicintmaxSumSubmatrix(int[][]matrix,intk) {

introw =matrix.length;

if (row ==0)return0;

intcol =matrix[0].length;

intm =Math.min(row,col);

intn =Math.max(row,col);

booleancolIsBig =col >row;

intres =Integer.MIN_VALUE;

for (inti =0;i <m;i++) {

int[]array =newint[n];

for (intj =i;j >=0;j--) {

intval =0;

TreeSet<Integer>set =newTreeSet<>();

set.add(0);

for (intp =0;p <n;p++) {

array[p] =array[p] + (colIsBig ?matrix[j][p] :matrix[p][j]);

val =val +array[p];

Integersubres =set.ceiling(val -k);

if (null !=subres) {

res =Math.max(res,val -subres);

}

set.add(val);

}

}

}

returnres;

}

}