From 3ef492565c3137a47c5668f94fe99faeac8ba5b4 Mon Sep 17 00:00:00 2001
From: Shakthi Nandana <sgovind4@ncsu.edu>
Date: Wed, 29 Apr 2026 20:29:13 -0400
Subject: [PATCH 1/3] soluiton to problem 1

---
 problem1.py | 35 +++++++++++++++++++++++++++++++++++
 1 file changed, 35 insertions(+)
 create mode 100644 problem1.py

diff --git a/problem1.py b/problem1.py
new file mode 100644
index 00000000..bf89dc8f
--- /dev/null
+++ b/problem1.py
@@ -0,0 +1,35 @@
+# Time Complexity: O(n^2) as we are deepcopying the path whenever we reach the target sum.
+# Space Complexity: O(n)
+# Did this code successfully run on Leetcode : Yes
+
+# Definition for a binary tree node.
+# class TreeNode(object):
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution(object):
+    def pathSum(self, root, targetSum):
+        """
+        :type root: Optional[TreeNode]
+        :type targetSum: int
+        :rtype: List[List[int]]
+        """
+        res=[]
+        cpath=[]
+        def helper(root,csum):
+            if root==None:
+                return
+            cpath.append(root.val)
+            csum+=root.val
+            if root.left==None and root.right==None:
+                if csum==targetSum:
+                    res.append(cpath[:])
+            
+            helper(root.left,csum)
+            helper(root.right,csum)
+
+            cpath.pop(-1)
+        
+        helper(root,0)
+        return res
\ No newline at end of file

From 3aba3c2aa0aee53779f6a9e9b93e7a67bb3996f7 Mon Sep 17 00:00:00 2001
From: Shakthi Nandana <sgovind4@ncsu.edu>
Date: Fri, 1 May 2026 22:37:28 -0400
Subject: [PATCH 2/3] solution to problem 2

---
 problem2.py | 31 +++++++++++++++++++++++++++++++
 1 file changed, 31 insertions(+)
 create mode 100644 problem2.py

diff --git a/problem2.py b/problem2.py
new file mode 100644
index 00000000..f65c8b35
--- /dev/null
+++ b/problem2.py
@@ -0,0 +1,31 @@
+# Time Complexity: O(n).
+# Space Complexity: O(n) for recursion stack
+# Did this code successfully run on Leetcode : Yes
+
+# Definition for a binary tree node.
+# class TreeNode(object):
+#     def __init__(self, val=0, l=None, r=None):
+#         self.val = val
+#         self.l = l
+#         self.r = r
+class Solution(object):
+    def isSymmetric(self, root):
+        """
+        :type root: Optional[TreeNode]
+        :rtype: bool
+        """
+
+        def helper(l,r):
+            if l==None and r==None:
+                return True
+            if l==None or r ==None:
+                return False
+            
+            if l.val!=r.val:
+                return False
+            else:
+                lres=helper(l.left,r.right)
+                rres=helper(l.right,r.left)
+                return lres and rres
+
+        return helper(root,root)
\ No newline at end of file

From 2806a0391bba1962ab0f3841ebdbdd1d208885fb Mon Sep 17 00:00:00 2001
From: Shakthi Nandana <sgovind4@ncsu.edu>
Date: Fri, 1 May 2026 22:42:29 -0400
Subject: [PATCH 3/3] renamed files

---
 problem1.py => path-sum-2.py     | 0
 problem2.py => symmetric-tree.py | 0
 2 files changed, 0 insertions(+), 0 deletions(-)
 rename problem1.py => path-sum-2.py (100%)
 rename problem2.py => symmetric-tree.py (100%)

diff --git a/problem1.py b/path-sum-2.py
similarity index 100%
rename from problem1.py
rename to path-sum-2.py
diff --git a/problem2.py b/symmetric-tree.py
similarity index 100%
rename from problem2.py
rename to symmetric-tree.py