From 4b4df325f388d37766da52184bef0f69e8b5ad53 Mon Sep 17 00:00:00 2001
From: Rich Vigorito <rich vigorito>
Date: Sat, 13 Sep 2025 18:17:14 -0700
Subject: [PATCH 1/3] feat: add LeetCode problem 100

Check for tree equivalence
---
 leetcode/src/100.c | 17 +++++++++++++++++
 1 file changed, 17 insertions(+)
 create mode 100644 leetcode/src/100.c

diff --git a/leetcode/src/100.c b/leetcode/src/100.c
new file mode 100644
index 0000000000..a1357ac4a8
--- /dev/null
+++ b/leetcode/src/100.c
@@ -0,0 +1,17 @@
+/**
+ * 100. Same Tree
+ * https://leetcode.com/problems/same-tree/
+ *
+ * Given the roots of two binary trees p and q, write a function to check if they are the same or not.
+ * Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.
+ *
+ */
+
+bool isSameTree(struct TreeNode* p, struct TreeNode* q) {
+    if (p == NULL && q == NULL) return true;
+    if (p == NULL || q == NULL) return false;
+    if (p->val != q->val)       return false;
+
+    return isSameTree(p->left, q->left) 
+        && isSameTree(p->right, q->right);
+}

From aad943284f6f5066f441b2b5bc2dc3776b4380dd Mon Sep 17 00:00:00 2001
From: Rich Vigorito <rich vigorito>
Date: Sat, 13 Sep 2025 23:11:53 -0700
Subject: [PATCH 2/3] add solution to leetcode 88

---
 leetcode/src/88.c | 24 ++++++++++++++++++++++++
 1 file changed, 24 insertions(+)
 create mode 100644 leetcode/src/88.c

diff --git a/leetcode/src/88.c b/leetcode/src/88.c
new file mode 100644
index 0000000000..d8def94e91
--- /dev/null
+++ b/leetcode/src/88.c
@@ -0,0 +1,24 @@
+#include <stdio.h>
+
+
+
+void merge(int* nums1, int nums1Size, int m, int* nums2, int nums2Size, int n) {
+    int i = m - 1; 
+    int j = n - 1;
+    int k = m + n - 1;
+
+    while (i >= 0 && j >= 0) {
+        if (nums1[i] > nums2[j]) {
+            nums1[k--] = nums1[i--];
+        } else {
+            nums1[k--] = nums2[j--];
+        }
+    }
+
+    while (j >= 0) {
+        nums1[k--] = nums2[j--];
+    }
+}    
+
+
+

From 78858e17494907c29c5e4ef0eec22587389122d2 Mon Sep 17 00:00:00 2001
From: richvigorito <vigoritor@gmail.com>
Date: Sat, 13 Sep 2025 23:20:30 -0700
Subject: [PATCH 3/3] Delete leetcode/src/100.c

in a different PR
---
 leetcode/src/100.c | 17 -----------------
 1 file changed, 17 deletions(-)
 delete mode 100644 leetcode/src/100.c

diff --git a/leetcode/src/100.c b/leetcode/src/100.c
deleted file mode 100644
index a1357ac4a8..0000000000
--- a/leetcode/src/100.c
+++ /dev/null
@@ -1,17 +0,0 @@
-/**
- * 100. Same Tree
- * https://leetcode.com/problems/same-tree/
- *
- * Given the roots of two binary trees p and q, write a function to check if they are the same or not.
- * Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.
- *
- */
-
-bool isSameTree(struct TreeNode* p, struct TreeNode* q) {
-    if (p == NULL && q == NULL) return true;
-    if (p == NULL || q == NULL) return false;
-    if (p->val != q->val)       return false;
-
-    return isSameTree(p->left, q->left) 
-        && isSameTree(p->right, q->right);
-}