|533|[Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_533.java) | O(m*n) |O(m) (m is number of rows) | Medium | HashMap

|532|[K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_532.java) | O(n) |O(n) | Easy | HashMap

|531|[Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_531.java)| O(m*n)|O(1)| Medium|

|530|[Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst/)|[Solution](../master/src/main/java/com/fishercoder/solutions/MinimumAbsoluteDifferenceinBST.java) | O(n) |O(n) | Easy| DFS

|530|[Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_530.java) | O(n) |O(n) | Easy| DFS

|529|[Minesweeper](https://leetcode.com/problems/minesweeper/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_529.java) | O(m*n) |O(k) | Medium | BFS

|526|[Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_526.java) | O(n) |O(h) | Medium | Backtracking

|525|[Contiguous Array](https://leetcode.com/problems/contiguous-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_525.java) | O(n) |O(n) | Medium | HashMap

publicclassMinimumAbsoluteDifferenceinBST {

publicclass_530 {

publicintgetMinimumDifference(TreeNoderoot) {

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

packagecom.fishercoder;

importcom.fishercoder.common.classes.TreeNode;

importcom.fishercoder.solutions.MinimumAbsoluteDifferenceinBST;

importcom.fishercoder.solutions._530;

importorg.junit.Before;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticjunit.framework.Assert.assertEquals;

publicclassMinimumAbsoluteDifferenceinBSTTest {

privatestaticMinimumAbsoluteDifferenceinBSTtest;

publicclass_530Test {

privatestatic_530test;

privatestaticintexpected;

privatestaticintactual;

privatestaticTreeNoderoot;

publicstaticvoidsetup(){

test =newMinimumAbsoluteDifferenceinBST();

test =new_530();

}