From 3f805b7697b49b2b456f6c64dc5d9a0b6bb38fde Mon Sep 17 00:00:00 2001
From: Danil M <max.cacz@yandex.ru>
Date: Wed, 17 Sep 2025 01:29:45 -0400
Subject: [PATCH 1/2] add 3516

---
 .../java/com/github/contest/math/MathLeetcode.kt  | 15 +++++++++++++++
 1 file changed, 15 insertions(+)

diff --git a/contest/src/main/java/com/github/contest/math/MathLeetcode.kt b/contest/src/main/java/com/github/contest/math/MathLeetcode.kt
index 3a08eb2..3f29f99 100644
--- a/contest/src/main/java/com/github/contest/math/MathLeetcode.kt
+++ b/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
+    }
+}

From de640c76f959bfb2b98afe2538c48916eb5dfffe Mon Sep 17 00:00:00 2001
From: Danil M <max.cacz@yandex.ru>
Date: Wed, 17 Sep 2025 01:48:14 -0400
Subject: [PATCH 2/2] add 2331

---
 .../contest/binaryTree/BinaryTreeLeetcode.kt  | 21 +++++++++++++++++++
 1 file changed, 21 insertions(+)

diff --git a/contest/src/main/java/com/github/contest/binaryTree/BinaryTreeLeetcode.kt b/contest/src/main/java/com/github/contest/binaryTree/BinaryTreeLeetcode.kt
index 99dcc51..5301251 100644
--- a/contest/src/main/java/com/github/contest/binaryTree/BinaryTreeLeetcode.kt
+++ b/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
+    }
+}