Added tasks-86-100

Author: ThanhNIT

README.md

@@ -332,6 +332,7 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0100 |[Same Tree](src/main/python/g0001_0100/s0100_same_tree/Solution0100.py)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 0 | 100.00
 | 0101 |[Symmetric Tree](src/main/python/g0101_0200/s0101_symmetric_tree/Solution0101.py)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 0 | 100.00
 
 #### Day 16 Design
@@ -464,6 +465,7 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
 | 0094 |[Binary Tree Inorder Traversal](src/main/python/g0001_0100/s0094_binary_tree_inorder_traversal/Solution0094.py)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
 | 0102 |[Binary Tree Level Order Traversal](src/main/python/g0101_0200/s0102_binary_tree_level_order_traversal/Solution0102.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00
 | 0543 |[Diameter of Binary Tree](src/main/python/g0501_0600/s0543_diameter_of_binary_tree/Solution0543.py)| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 3 | 94.30
+| 0100 |[Same Tree](src/main/python/g0001_0100/s0100_same_tree/Solution0100.py)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 0 | 100.00
 | 0226 |[Invert Binary Tree](src/main/python/g0201_0300/s0226_invert_binary_tree/Solution0226.py)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
 | 0104 |[Maximum Depth of Binary Tree](src/main/python/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution0104.py)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(N)_Space_O(H) | 0 | 100.00
 | 0124 |[Binary Tree Maximum Path Sum](src/main/python/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution0124.py)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 11 | 91.40
@@ -524,6 +526,7 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0088 |[Merge Sorted Array](src/main/python/g0001_0100/s0088_merge_sorted_array/Solution0088.py)| Easy | Top_Interview_Questions, Array, Sorting, Two_Pointers | 0 | 100.00
 | 0027 |[Remove Element](src/main/python/g0001_0100/s0027_remove_element/Solution0027.py)| Easy | Array, Two_Pointers | 0 | 100.00
 | 0026 |[Remove Duplicates from Sorted Array](src/main/python/g0001_0100/s0026_remove_duplicates_from_sorted_array/Solution0026.py)| Easy | Top_Interview_Questions, Array, Two_Pointers | 0 | 100.00
 | 0080 |[Remove Duplicates from Sorted Array II](src/main/python/g0001_0100/s0080_remove_duplicates_from_sorted_array_ii/Solution0080.py)| Medium | Array, Two_Pointers | 73 | 96.40
@@ -597,17 +600,20 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
 | 0002 |[Add Two Numbers](src/main/python/g0001_0100/s0002_add_two_numbers/Solution0002.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_Space_O(max(N,M)), AI_can_be_used_to_solve_the_task | 0 | 100.00
 | 0021 |[Merge Two Sorted Lists](src/main/python/g0001_0100/s0021_merge_two_sorted_lists/Solution0021.py)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 0 | 100.00
 | 0138 |[Copy List with Random Pointer](src/main/python/g0101_0200/s0138_copy_list_with_random_pointer/Solution0138.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List, Big_O_Time_O(N)_Space_O(N) | 38 | 77.31
+| 0092 |[Reverse Linked List II](src/main/python/g0001_0100/s0092_reverse_linked_list_ii/Solution0092.py)| Medium | Linked_List | 0 | 100.00
 | 0025 |[Reverse Nodes in k-Group](src/main/python/g0001_0100/s0025_reverse_nodes_in_k_group/Solution0025.py)| Hard | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(k) | 0 | 100.00
 | 0019 |[Remove Nth Node From End of List](src/main/python/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution0019.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Big_O_Time_O(L)_Space_O(L) | 0 | 100.00
 | 0082 |[Remove Duplicates from Sorted List II](src/main/python/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii/Solution0082.py)| Medium | Two_Pointers, Linked_List | 0 | 100.00
 | 0061 |[Rotate List](src/main/python/g0001_0100/s0061_rotate_list/Solution0061.py)| Medium | Two_Pointers, Linked_List | 0 | 100.00
+| 0086 |[Partition List](src/main/python/g0001_0100/s0086_partition_list/Solution0086.py)| Medium | Two_Pointers, Linked_List | 0 | 100.00
 | 0146 |[LRU Cache](src/main/python/g0101_0200/s0146_lru_cache/LRUCache.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List, Big_O_Time_O(1)_Space_O(capacity) | 113 | 84.08
 
 #### Top Interview 150 Binary Tree General
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 0104 |[Maximum Depth of Binary Tree](src/main/python/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution0104.py)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(N)_Space_O(H) | 0 | 100.00
+| 0100 |[Same Tree](src/main/python/g0001_0100/s0100_same_tree/Solution0100.py)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 0 | 100.00
 | 0226 |[Invert Binary Tree](src/main/python/g0201_0300/s0226_invert_binary_tree/Solution0226.py)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
 | 0101 |[Symmetric Tree](src/main/python/g0101_0200/s0101_symmetric_tree/Solution0101.py)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 0 | 100.00
 | 0105 |[Construct Binary Tree from Preorder and Inorder Traversal](src/main/python/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution0105.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer, Big_O_Time_O(N)_Space_O(N) | 4 | 73.84
@@ -719,6 +725,7 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
 | 0064 |[Minimum Path Sum](src/main/python/g0001_0100/s0064_minimum_path_sum/Solution0064.py)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 15 | 60.38
 | 0063 |[Unique Paths II](src/main/python/g0001_0100/s0063_unique_paths_ii/Solution0063.py)| Medium | Array, Dynamic_Programming, Matrix | 0 | 100.00
 | 0005 |[Longest Palindromic Substring](src/main/python/g0001_0100/s0005_longest_palindromic_substring/Solution0005.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 47 | 97.38
+| 0097 |[Interleaving String](src/main/python/g0001_0100/s0097_interleaving_string/Solution0097.py)| Medium | String, Dynamic_Programming | 37 | 90.93
 | 0072 |[Edit Distance](src/main/python/g0001_0100/s0072_edit_distance/Solution0072.py)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n^2)_Space_O(n2) | 23 | 98.84
 | 0221 |[Maximal Square](src/main/python/g0201_0300/s0221_maximal_square/Solution0221.py)| Medium | Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 129 | 64.49
 
@@ -735,6 +742,7 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 0001 |[Two Sum](src/main/python/g0001_0100/s0001_two_sum/Solution0001.py)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n), AI_can_be_used_to_solve_the_task | 0 | 100.00
+| 0088 |[Merge Sorted Array](src/main/python/g0001_0100/s0088_merge_sorted_array/Solution0088.py)| Easy | Top_Interview_Questions, Array, Sorting, Two_Pointers | 0 | 100.00
 
 #### Day 3 Array
 
@@ -1689,9 +1697,14 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
 | 0104 |[Maximum Depth of Binary Tree](src/main/python/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution0104.py)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Data_Structure_I_Day_11_Tree, Programming_Skills_I_Day_10_Linked_List_and_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(H) | 0 | 100.00
 | 0102 |[Binary Tree Level Order Traversal](src/main/python/g0101_0200/s0102_binary_tree_level_order_traversal/Solution0102.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_11_Tree, Level_1_Day_6_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_BFS, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00
 | 0101 |[Symmetric Tree](src/main/python/g0101_0200/s0101_symmetric_tree/Solution0101.py)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_11_Tree, Level_2_Day_15_Tree, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(log(N)) | 0 | 100.00
+| 0100 |[Same Tree](src/main/python/g0001_0100/s0100_same_tree/Solution0100.py)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Level_2_Day_15_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_General | 0 | 100.00
 | 0098 |[Validate Binary Search Tree](src/main/python/g0001_0100/s0098_validate_binary_search_tree/Solution0098.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Data_Structure_I_Day_14_Tree, Level_1_Day_8_Binary_Search_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 0 | 100.00
+| 0097 |[Interleaving String](src/main/python/g0001_0100/s0097_interleaving_string/Solution0097.py)| Medium | String, Dynamic_Programming, Top_Interview_150_Multidimensional_DP | 37 | 90.93
 | 0096 |[Unique Binary Search Trees](src/main/python/g0001_0100/s0096_unique_binary_search_trees/Solution0096.py)| Medium | Dynamic_Programming, Math, Tree, Binary_Tree, Binary_Search_Tree, Dynamic_Programming_I_Day_11, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00
 | 0094 |[Binary Tree Inorder Traversal](src/main/python/g0001_0100/s0094_binary_tree_inorder_traversal/Solution0094.py)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Data_Structure_I_Day_10_Tree, Udemy_Tree_Stack_Queue, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
+| 0092 |[Reverse Linked List II](src/main/python/g0001_0100/s0092_reverse_linked_list_ii/Solution0092.py)| Medium | Linked_List, Top_Interview_150_Linked_List | 0 | 100.00
+| 0088 |[Merge Sorted Array](src/main/python/g0001_0100/s0088_merge_sorted_array/Solution0088.py)| Easy | Top_Interview_Questions, Array, Sorting, Two_Pointers, Data_Structure_I_Day_2_Array, Top_Interview_150_Array/String | 0 | 100.00
+| 0086 |[Partition List](src/main/python/g0001_0100/s0086_partition_list/Solution0086.py)| Medium | Two_Pointers, Linked_List, Top_Interview_150_Linked_List | 0 | 100.00
 | 0084 |[Largest Rectangle in Histogram](src/main/python/g0001_0100/s0084_largest_rectangle_in_histogram/Solution0084.py)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Stack, Monotonic_Stack, Big_O_Time_O(n_log_n)_Space_O(log_n) | 63 | 99.53
 | 0082 |[Remove Duplicates from Sorted List II](src/main/python/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii/Solution0082.py)| Medium | Two_Pointers, Linked_List, Data_Structure_II_Day_11_Linked_List, Algorithm_II_Day_3_Two_Pointers, Top_Interview_150_Linked_List | 0 | 100.00
 | 0080 |[Remove Duplicates from Sorted Array II](src/main/python/g0001_0100/s0080_remove_duplicates_from_sorted_array_ii/Solution0080.py)| Medium | Array, Two_Pointers, Udemy_Arrays, Top_Interview_150_Array/String | 73 | 96.40

src/main/python/g0001_0100/s0086_partition_list/Solution0086.py

@@ -0,0 +1,28 @@
+# #Medium #Two_Pointers #Linked_List #Top_Interview_150_Linked_List
+# #2025_09_13_Time_0_ms_(100.00%)_Space_17.98_MB_(21.24%)
+
+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]:
+        n_head = ListNode(0)
+        n_tail = ListNode(0)
+        ptr = n_tail
+        temp = n_head
+        while head is not None:
+            n_next = head.next
+            if head.val < x:
+                n_head.next = head
+                n_head = n_head.next
+            else:
+                n_tail.next = head
+                n_tail = n_tail.next
+            head = n_next
+        n_tail.next = None
+        n_head.next = ptr.next
+        return temp.next

src/main/python/g0001_0100/s0086_partition_list/Solution0086_test.py

@@ -0,0 +1,31 @@
+import unittest
+from Solution0086 import Solution, ListNode
+
+class SolutionTest(unittest.TestCase):
+    def test_partition(self):
+        head = ListNode(1)
+        head.next = ListNode(4)
+        head.next.next = ListNode(3)
+        head.next.next.next = ListNode(2)
+        head.next.next.next.next = ListNode(5)
+        head.next.next.next.next.next = ListNode(2)
+        result = Solution().partition(head, 3)
+        # Convert to list for comparison
+        result_list = []
+        current = result
+        while current:
+            result_list.append(current.val)
+            current = current.next
+        self.assertEqual(result_list, [1, 2, 2, 4, 3, 5])
+
+    def test_partition2(self):
+        head = ListNode(2)
+        head.next = ListNode(1)
+        result = Solution().partition(head, 2)
+        # Convert to list for comparison
+        result_list = []
+        current = result
+        while current:
+            result_list.append(current.val)
+            current = current.next
+        self.assertEqual(result_list, [1, 2])

src/main/python/g0001_0100/s0086_partition_list/readme.md

@@ -0,0 +1,27 @@
+86\. Partition List
+
+Medium
+
+Given the `head` of a linked list and a value `x`, partition it such that all nodes **less than** `x` come before nodes **greater than or equal** to `x`.
+
+You should **preserve** the original relative order of the nodes in each of the two partitions.
+
+**Example 1:**
+
+![](https://assets.leetcode.com/uploads/2021/01/04/partition.jpg)
+
+**Input:** head = [1,4,3,2,5,2], x = 3
+
+**Output:** [1,2,2,4,3,5] 
+
+**Example 2:**
+
+**Input:** head = [2,1], x = 2
+
+**Output:** [1,2] 
+
+**Constraints:**
+
+*   The number of nodes in the list is in the range `[0, 200]`.
+*   `-100 <= Node.val <= 100`
+*   `-200 <= x <= 200`

src/main/python/g0001_0100/s0088_merge_sorted_array/Solution0088.py

@@ -0,0 +1,19 @@
+# #Easy #Top_Interview_Questions #Array #Sorting #Two_Pointers #Data_Structure_I_Day_2_Array
+# #Top_Interview_150_Array/String #2025_09_13_Time_0_ms_(100.00%)_Space_17.78_MB_(71.73%)
+
+from typing import List
+
+class Solution:
+    def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None:
+        i = m - 1
+        j = len(nums1) - 1
+        p2 = n - 1
+        while p2 >= 0:
+            if i >= 0 and nums1[i] > nums2[p2]:
+                nums1[j] = nums1[i]
+                j -= 1
+                i -= 1
+            else:
+                nums1[j] = nums2[p2]
+                j -= 1
+                p2 -= 1

src/main/python/g0001_0100/s0088_merge_sorted_array/Solution0088_test.py

@@ -0,0 +1,13 @@
+import unittest
+from Solution0088 import Solution
+
+class SolutionTest(unittest.TestCase):
+    def test_merge(self):
+        array = [1, 2, 3, 0, 0, 0]
+        Solution().merge(array, 3, [2, 5, 6], 3)
+        self.assertEqual(array, [1, 2, 2, 3, 5, 6])
+
+    def test_merge2(self):
+        array = [1]
+        Solution().merge(array, 1, [], 0)
+        self.assertEqual(array, [1])

src/main/python/g0001_0100/s0088_merge_sorted_array/readme.md

@@ -0,0 +1,43 @@
+88\. Merge Sorted Array
+
+Easy
+
+You are given two integer arrays `nums1` and `nums2`, sorted in **non-decreasing order**, and two integers `m` and `n`, representing the number of elements in `nums1` and `nums2` respectively.
+
+**Merge** `nums1` and `nums2` into a single array sorted in **non-decreasing order**.
+
+The final sorted array should not be returned by the function, but instead be _stored inside the array_ `nums1`. To accommodate this, `nums1` has a length of `m + n`, where the first `m` elements denote the elements that should be merged, and the last `n` elements are set to `0` and should be ignored. `nums2` has a length of `n`.
+
+**Example 1:**
+
+**Input:** nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3
+
+**Output:** [1,2,2,3,5,6]
+
+**Explanation:** The arrays we are merging are [1,2,3] and [2,5,6]. The result of the merge is [1,2,2,3,5,6] with the underlined elements coming from nums1. 
+
+**Example 2:**
+
+**Input:** nums1 = [1], m = 1, nums2 = [], n = 0
+
+**Output:** [1]
+
+**Explanation:** The arrays we are merging are [1] and []. The result of the merge is [1]. 
+
+**Example 3:**
+
+**Input:** nums1 = [0], m = 0, nums2 = [1], n = 1
+
+**Output:** [1]
+
+**Explanation:** The arrays we are merging are [] and [1]. The result of the merge is [1]. Note that because m = 0, there are no elements in nums1. The 0 is only there to ensure the merge result can fit in nums1. 
+
+**Constraints:**
+
+*   `nums1.length == m + n`
+*   `nums2.length == n`
+*   `0 <= m, n <= 200`
+*   `1 <= m + n <= 200`
+*   <code>-10<sup>9</sup> <= nums1[i], nums2[j] <= 10<sup>9</sup></code>
+
+**Follow up:** Can you come up with an algorithm that runs in `O(m + n)` time?

src/main/python/g0001_0100/s0092_reverse_linked_list_ii/Solution0092.py

@@ -0,0 +1,51 @@
+# #Medium #Linked_List #Top_Interview_150_Linked_List
+# #2025_09_13_Time_0_ms_(100.00%)_Space_18.11_MB_(14.44%)
+
+from typing import Optional
+
+class ListNode:
+    def __init__(self, val=0, next=None):
+        self.val = val
+        self.next = next
+
+class Solution:
+    def reverseBetween(self, head: Optional[ListNode], left: int, right: int) -> Optional[ListNode]:
+        if left == right:
+            return head
+        prev = None
+        temp = head
+        start = None
+        k = left
+        while temp is not None and k > 1:
+            prev = temp
+            temp = temp.next
+            k -= 1
+        if left > 1 and prev is not None:
+            prev.next = None
+        prev1 = None
+        start = temp
+        while temp is not None and right - left >= 0:
+            prev1 = temp
+            temp = temp.next
+            right -= 1
+        if prev1 is not None:
+            prev1.next = None
+        if left > 1 and prev is not None:
+            prev.next = self._reverse(start)
+        else:
+            head = self._reverse(start)
+            prev = head
+        while prev.next is not None:
+            prev = prev.next
+        prev.next = temp
+        return head
+
+    def _reverse(self, head: Optional[ListNode]) -> Optional[ListNode]:
+        p = head
+        r = None
+        while p is not None:
+            q = p.next
+            p.next = r
+            r = p
+            p = q
+        return r