solved linkedlist + binary tree

Author: Ataba29

Easy/101.py

@@ -0,0 +1,27 @@
+# Definition for a binary tree node.
+from typing import Optional
+
+
+class TreeNode:
+    def __init__(self, val=0, left=None, right=None):
+        self.val = val
+        self.left = left
+        self.right = right
+
+
+class Solution:
+    def isSymmetric(self, root: Optional[TreeNode]) -> bool:
+
+        def is_mirror(n1, n2):
+            if not n1 and not n2:
+                return True
+            if not n1 or not n2:
+                return False
+
+            return (
+                n1.val == n2.val
+                and is_mirror(n1.right, n2.left)
+                and is_mirror(n1.left, n2.right)
+            )
+
+        return is_mirror(root.left, root.right)

Medium/86.py

@@ -0,0 +1,29 @@
+# Definition for singly-linked list.
+from typing import Optional
+
+
+class ListNode:
+    def __init__(self, val=0, next=None):
+        self.val = val
+        self.next = next
+
+
+class Solution:
+    def partition(self, head: Optional[ListNode], x: int) -> Optional[ListNode]:
+        dummy = ListNode(0, head)
+        big = ListNode(0, None)
+        bigcurr = big
+        prev = dummy
+        curr = dummy.next
+        while curr:
+            if curr.val >= x:
+                prev.next = curr.next
+                curr.next = None
+                bigcurr.next = curr
+                bigcurr = bigcurr.next
+                curr = prev.next
+            else:
+                prev = curr
+                curr = curr.next
+        prev.next = big.next
+        return dummy.next

README.md

@@ -17,11 +17,11 @@ This repository contains my solutions to various LeetCode problems. Each solutio
 
 ### Easy Problems
 
-- **Total Solved:** [47]
+- **Total Solved:** [48]
 
 ### Medium Problems
 
-- **Total Solved:** [121]
+- **Total Solved:** [122]
 
 ### Hard Problems