|1680|[Concatenation of Consecutive Binary Numbers](https://leetcode.com/problems/concatenation-of-consecutive-binary-numbers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1680.java)||Medium|Math|

|1679|[Max Number of K-Sum Pairs](https://leetcode.com/problems/max-number-of-k-sum-pairs/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1679.java)||Medium|HashTable|

|1678|[Goal Parser Interpretation](https://leetcode.com/problems/goal-parser-interpretation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1678.java)||Easy|String|

|1676|[Lowest Common Ancestor of a Binary Tree IV](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iv/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1676.java)||Medium|Tree, DFS, Binary Tree|

|1675|[Minimize Deviation in Array](https://leetcode.com/problems/minimize-deviation-in-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1675.java)||Hard|Heap, Ordered Map|

|1673|[Find the Most Competitive Subsequence](https://leetcode.com/problems/find-the-most-competitive-subsequence/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1673.java)|[:tv:](https://youtu.be/GBJFxSD3B_s)|Medium|Stack, Greedy|

|1672|[Richest Customer Wealth](https://leetcode.com/problems/richest-customer-wealth/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1672.java)||Easy|Array|

packagecom.fishercoder.solutions;

importcom.fishercoder.common.classes.TreeNode;

importjava.util.HashSet;

importjava.util.Set;

publicclass_1676 {

publicstaticclassSolution1 {

TreeNodelca;

publicTreeNodelowestCommonAncestor(TreeNoderoot,TreeNode[]nodes) {

Set<Integer>target =newHashSet<>();

for (TreeNodenode :nodes) {

target.add(node.val);

}

dfs(root,target);

returnlca;

}

privateintdfs(TreeNoderoot,Set<Integer>target) {

if (root ==null) {

return0;

}

intleftCount =dfs(root.left,target);

intrightCount =dfs(root.right,target);

intfoundCount =leftCount +rightCount;

if (target.contains(root.val)) {

foundCount++;

}

if (foundCount ==target.size() &&lca ==null) {

lca =root;

}

returnfoundCount;

}

}

}

packagecom.fishercoder;

importcom.fishercoder.common.classes.TreeNode;

importcom.fishercoder.common.utils.TreeUtils;

importcom.fishercoder.solutions._1676;

importorg.junit.Test;

importjava.util.Arrays;

importstaticorg.junit.Assert.assertEquals;

publicclass_1676Test {

privatestatic_1676.Solution1solution1;

publicvoidtest1() {

solution1 =new_1676.Solution1();

TreeNoderoot =TreeUtils.constructBinaryTree(Arrays.asList(3,5,1,6,2,0,8,null,null,7,4));

TreeNodenode1 =TreeUtils.constructBinaryTree(Arrays.asList(4));

TreeNodenode2 =TreeUtils.constructBinaryTree(Arrays.asList(7));

TreeNode[]nodes =newTreeNode[]{node1,node2};

TreeNodelca =TreeUtils.constructBinaryTree(Arrays.asList(2,7,4));

assertEquals(lca,solution1.lowestCommonAncestor(root,nodes));

}

}