add two problems 17.09

contest/src/main/java/com/github/contest/binaryTree/BinaryTreeLeetcode.kt

@@ -135,3 +135,24 @@ fun isCousins(root: TreeNode?, x: Int, y: Int): Boolean {
 
     return false
 }
+
+/**
+ * 2331. Evaluate Boolean Binary Tree
+ */
+
+fun evaluateTree(root: TreeNode?): Boolean {
+    if (root?.left == null && root?.right == null) {
+        return when (root?.`val`) {
+            1 -> true
+            else -> false
+        }
+    }
+
+    val left = evaluateTree(root?.left)
+    val right = evaluateTree(root?.right)
+
+    return when (root.`val`) {
+        2 -> left || right
+        else -> left && right
+    }
+}

contest/src/main/java/com/github/contest/math/MathLeetcode.kt

@@ -276,3 +276,18 @@ fun lcm(first: Int, second: Int): Int {
     val product = (first.toLong() / gcd(first, second)) * second
     return abs(product).toInt()
 }
+
+/**
+ * 3516. Find Closest Person
+ */
+
+fun findClosest(x: Int, y: Int, z: Int): Int {
+    val diff1 = abs(x - z)
+    val diff2 = abs(y - z)
+
+    return when {
+        diff1 < diff2 -> 1
+        diff1 > diff2 -> 2
+        else -> 0
+    }
+}