Updated tasks 104-215

javadev · web-flow · commit 2bc006b688f3 · 2025-07-25T10:31:20.000+03:00
diff --git a/README.md b/README.md
diff --git a/src/main/python/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.py b/src/main/python/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.py
@@ -2,7 +2,7 @@
 # #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)
-# #2024_06_09_Time_35_ms_(85.47%)_Space_17.6_MB_(77.94%)
+# #2025_07_25_Time_0_ms_(100.00%)_Space_19.23_MB_(7.43%)
 
 # Definition for a binary tree node.
 # class TreeNode:
diff --git a/src/main/python/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.py b/src/main/python/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.py
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Tree #Binary_Tree
 # #Divide_and_Conquer #Data_Structure_II_Day_15_Tree #Top_Interview_150_Binary_Tree_General
-# #Big_O_Time_O(N)_Space_O(N) #2024_06_09_Time_45_ms_(96.51%)_Space_18.1_MB_(90.27%)
+# #Big_O_Time_O(N)_Space_O(N) #2025_07_25_Time_4_ms_(73.84%)_Space_19.14_MB_(84.59%)
 
 # Definition for a binary tree node.
 # class TreeNode:
diff --git a/src/main/python/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.py b/src/main/python/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.py
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Stack #Linked_List
 # #Udemy_Linked_List #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(N)
-# #2024_06_09_Time_24_ms_(99.54%)_Space_16.7_MB_(86.32%)
+# #2025_07_25_Time_0_ms_(100.00%)_Space_17.94_MB_(73.46%)
 
 # Definition for a binary tree node.
 # class TreeNode:
diff --git a/src/main/python/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.py b/src/main/python/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.py
@@ -1,7 +1,7 @@
 # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
 # #Data_Structure_I_Day_3_Array #Dynamic_Programming_I_Day_7 #Level_1_Day_5_Greedy #Udemy_Arrays
 # #Top_Interview_150_Array/String #Big_O_Time_O(N)_Space_O(1)
-# #2024_06_09_Time_666_ms_(98.09%)_Space_27.5_MB_(28.45%)
+# #2025_07_25_Time_17_ms_(98.03%)_Space_26.89_MB_(77.51%)
 
 class Solution:
     def maxProfit(self, prices: List[int]) -> int:
diff --git a/src/main/python/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.py b/src/main/python/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.py
@@ -1,6 +1,6 @@
 # #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Depth_First_Search
 # #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General
-# #Big_O_Time_O(N)_Space_O(N) #2024_06_09_Time_57_ms_(86.71%)_Space_20.9_MB_(40.96%)
+# #Big_O_Time_O(N)_Space_O(N) #2025_07_25_Time_11_ms_(91.40%)_Space_22.92_MB_(80.36%)
 
 # Definition for a binary tree node.
 # class TreeNode:
diff --git a/src/main/python/g0101_0200/s0128_longest_consecutive_sequence/Solution.py b/src/main/python/g0101_0200/s0128_longest_consecutive_sequence/Solution.py
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Union_Find
 # #Top_Interview_150_Hashmap #Big_O_Time_O(N_log_N)_Space_O(1)
-# #2024_06_09_Time_338_ms_(82.56%)_Space_31.7_MB_(88.80%)
+# #2025_07_25_Time_47_ms_(76.47%)_Space_33.24_MB_(81.27%)
 
 class Solution:
     def longestConsecutive(self, nums: List[int]) -> int:
diff --git a/src/main/python/g0101_0200/s0131_palindrome_partitioning/Solution.py b/src/main/python/g0101_0200/s0131_palindrome_partitioning/Solution.py
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming
 # #Backtracking #Big_O_Time_O(N*2^N)_Space_O(2^N*N)
-# #2024_06_09_Time_444_ms_(93.43%)_Space_32.1_MB_(84.45%)
+# #2025_07_25_Time_50_ms_(56.82%)_Space_32.70_MB_(87.12%)
 
 class Solution:
     def partition(self, s: str) -> List[List[str]]:
diff --git a/src/main/python/g0101_0200/s0136_single_number/Solution.py b/src/main/python/g0101_0200/s0136_single_number/Solution.py
@@ -1,7 +1,7 @@
 # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Bit_Manipulation
 # #LeetCode_75_Bit_Manipulation #Data_Structure_II_Day_1_Array
 # #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers #Top_Interview_150_Bit_Manipulation
-# #Big_O_Time_O(N)_Space_O(1) #2024_06_09_Time_98_ms_(96.80%)_Space_19_MB_(89.40%)
+# #Big_O_Time_O(N)_Space_O(1) #2025_07_25_Time_0_ms_(100.00%)_Space_19.69_MB_(43.28%)
 
 class Solution:
     def singleNumber(self, nums: List[int]) -> int:
diff --git a/src/main/python/g0101_0200/s0138_copy_list_with_random_pointer/Solution.py b/src/main/python/g0101_0200/s0138_copy_list_with_random_pointer/Solution.py
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Linked_List
 # #Programming_Skills_II_Day_14 #Udemy_Linked_List #Top_Interview_150_Linked_List
-# #Big_O_Time_O(N)_Space_O(N) #2024_06_09_Time_36_ms_(72.10%)_Space_17.3_MB_(95.85%)
+# #Big_O_Time_O(N)_Space_O(N) #2025_07_25_Time_38_ms_(77.31%)_Space_18.72_MB_(18.76%)
 
 """
 # Definition for a Node.
diff --git a/src/main/python/g0101_0200/s0139_word_break/Solution.py b/src/main/python/g0101_0200/s0139_word_break/Solution.py
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table
 # #Dynamic_Programming #Trie #Memoization #Algorithm_II_Day_15_Dynamic_Programming
 # #Dynamic_Programming_I_Day_9 #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP
-# #Big_O_Time_O(M+max*N)_Space_O(M+N+max) #2024_06_09_Time_41_ms_(50.55%)_Space_16.6_MB_(88.23%)
+# #Big_O_Time_O(M+max*N)_Space_O(M+N+max) #2025_07_25_Time_3_ms_(70.59%)_Space_17.90_MB_(63.78%)
 
 class Solution:
     def wordBreak(self, s: str, wordDict: List[str]) -> bool:
diff --git a/src/main/python/g0101_0200/s0141_linked_list_cycle/Solution.py b/src/main/python/g0101_0200/s0141_linked_list_cycle/Solution.py
@@ -1,6 +1,6 @@
 # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Two_Pointers #Linked_List
 # #Data_Structure_I_Day_7_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List
-# #Big_O_Time_O(N)_Space_O(1) #2024_06_09_Time_49_ms_(30.79%)_Space_19.1_MB_(64.48%)
+# #Big_O_Time_O(N)_Space_O(1) #2025_07_25_Time_44_ms_(80.06%)_Space_19.98_MB_(29.66%)
 
 # Definition for singly-linked list.
 # class ListNode:
diff --git a/src/main/python/g0101_0200/s0142_linked_list_cycle_ii/Solution.py b/src/main/python/g0101_0200/s0142_linked_list_cycle_ii/Solution.py
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Hash_Table #Two_Pointers #Linked_List
 # #Data_Structure_II_Day_10_Linked_List #Level_1_Day_4_Linked_List #Udemy_Linked_List
-# #Big_O_Time_O(N)_Space_O(1) #2024_06_09_Time_30_ms_(99.28%)_Space_19.1_MB_(38.61%)
+# #Big_O_Time_O(N)_Space_O(1) #2025_07_25_Time_38_ms_(94.15%)_Space_19.60_MB_(79.86%)
 
 # Definition for singly-linked list.
 # class ListNode:
diff --git a/src/main/python/g0101_0200/s0146_lru_cache/LRUCache.py b/src/main/python/g0101_0200/s0146_lru_cache/LRUCache.py
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Design #Linked_List
 # #Doubly_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List
-# #Big_O_Time_O(1)_Space_O(capacity) #2024_06_09_Time_539_ms_(82.07%)_Space_77.8_MB_(60.68%)
+# #Big_O_Time_O(1)_Space_O(capacity) #2025_07_25_Time_113_ms_(84.08%)_Space_77.93_MB_(87.77%)
 
 class LRUCacheNode:
     def __init__(self, key, value):
diff --git a/src/main/python/g0101_0200/s0148_sort_list/Solution.py b/src/main/python/g0101_0200/s0148_sort_list/Solution.py
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Sorting #Two_Pointers #Linked_List
 # #Divide_and_Conquer #Merge_Sort #Level_2_Day_4_Linked_List #Top_Interview_150_Divide_and_Conquer
-# #Big_O_Time_O(log(N))_Space_O(log(N)) #2024_06_09_Time_285_ms_(57.68%)_Space_32.2_MB_(98.97%)
+# #Big_O_Time_O(log(N))_Space_O(log(N)) #2025_07_25_Time_186_ms_(43.67%)_Space_32.96_MB_(41.09%)
 
 # Definition for singly-linked list.
 # class ListNode:
diff --git a/src/main/python/g0101_0200/s0152_maximum_product_subarray/Solution.py b/src/main/python/g0101_0200/s0152_maximum_product_subarray/Solution.py
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
 # #Dynamic_Programming_I_Day_6 #Level_2_Day_13_Dynamic_Programming #Udemy_Dynamic_Programming
-# #Big_O_Time_O(N)_Space_O(1) #2024_06_09_Time_71_ms_(61.48%)_Space_17_MB_(43.09%)
+# #Big_O_Time_O(N)_Space_O(1) #2025_07_25_Time_3_ms_(98.51%)_Space_18.56_MB_(15.01%)
 
 class Solution:
     def maxProduct(self, nums: List[int]) -> int:
diff --git a/src/main/python/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.py b/src/main/python/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.py
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_II_Day_2_Binary_Search
 # #Binary_Search_I_Day_12 #Udemy_Binary_Search #Top_Interview_150_Binary_Search
-# #Big_O_Time_O(log_N)_Space_O(log_N) #2024_06_09_Time_44_ms_(47.26%)_Space_16.7_MB_(93.20%)
+# #Big_O_Time_O(log_N)_Space_O(log_N) #2025_07_25_Time_0_ms_(100.00%)_Space_18.07_MB_(50.37%)
 
 class Solution:
     def findMinUtil(self, nums: List[int], l: int, r: int) -> int:
@@ -24,5 +24,5 @@ def findMinUtil(self, nums: List[int], l: int, r: int) -> int:
 
     def findMin(self, nums: List[int]) -> int:
         l = 0
-        r = nums.length - 1
+        r = len(nums) - 1
         return self.findMinUtil(nums, l, r)
diff --git a/src/main/python/g0101_0200/s0155_min_stack/MinStack.py b/src/main/python/g0101_0200/s0155_min_stack/MinStack.py
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Stack #Design
 # #Data_Structure_II_Day_14_Stack_Queue #Programming_Skills_II_Day_18 #Level_2_Day_16_Design
 # #Udemy_Design #Top_Interview_150_Stack #Big_O_Time_O(1)_Space_O(N)
-# #2024_06_09_Time_58_ms_(38.23%)_Space_21_MB_(7.40%)
+# #2025_07_25_Time_3_ms_(83.83%)_Space_22.26_MB_(6.08%)
 
 class MinStack:
     class Node:
diff --git a/src/main/python/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.py b/src/main/python/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.py
@@ -1,6 +1,6 @@
 # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Two_Pointers #Linked_List
 # #Data_Structure_II_Day_11_Linked_List #Udemy_Linked_List #Big_O_Time_O(M+N)_Space_O(1)
-# #2024_06_09_Time_79_ms_(66.59%)_Space_27_MB_(66.94%)
+# #2025_07_25_Time_83_ms_(67.29%)_Space_27.89_MB_(40.40%)
 
 # Definition for singly-linked list.
 # class ListNode:
diff --git a/src/main/python/g0101_0200/s0169_majority_element/Solution.py b/src/main/python/g0101_0200/s0169_majority_element/Solution.py
@@ -1,30 +1,30 @@
 # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Sorting #Counting
 # #Divide_and_Conquer #Data_Structure_II_Day_1_Array #Udemy_Famous_Algorithm
 # #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
-# #2024_06_09_Time_170_ms_(59.75%)_Space_18_MB_(27.19%)
+# #2025_07_25_Time_7_ms_(56.72%)_Space_19.50_MB_(19.10%)
 
 class Solution:
     def majorityElement(self, nums: List[int]) -> int:
         count = 1
-        majority = arr[0]
+        majority = nums[0]
 
         # For Potential Majority Element
-        for i in range(1, len(arr)):
-            if arr[i] == majority:
+        for i in range(1, len(nums)):
+            if nums[i] == majority:
                 count += 1
             else:
                 if count > 1:
                     count -= 1
                 else:
-                    majority = arr[i]
+                    majority = nums[i]
 
         # For Confirmation
         count = 0
-        for j in arr:
+        for j in nums:
             if j == majority:
                 count += 1
 
-        if count >= (len(arr) // 2) + 1:
+        if count >= (len(nums) // 2) + 1:
             return majority
         else:
             return -1
diff --git a/src/main/python/g0101_0200/s0189_rotate_array/Solution.py b/src/main/python/g0101_0200/s0189_rotate_array/Solution.py
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Math #Two_Pointers
 # #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Top_Interview_150_Array/String
-# #Big_O_Time_O(n)_Space_O(1) #2024_06_09_Time_150_ms_(86.92%)_Space_28_MB_(28.67%)
+# #Big_O_Time_O(n)_Space_O(1) #2025_07_25_Time_3_ms_(74.65%)_Space_25.70_MB_(46.80%)
 
 class Solution:
     def rotate(self, nums: List[int], k: int) -> None:
diff --git a/src/main/python/g0101_0200/s0198_house_robber/Solution.py b/src/main/python/g0101_0200/s0198_house_robber/Solution.py
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
 # #LeetCode_75_DP/1D #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3
 # #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP
-# #Big_O_Time_O(n)_Space_O(n) #2024_06_09_Time_34_ms_(72.11%)_Space_16.5_MB_(81.74%)
+# #Big_O_Time_O(n)_Space_O(n) #2025_07_25_Time_0_ms_(100.00%)_Space_17.77_MB_(54.18%)
 
 class Solution:
     def rob(self, nums: List[int]) -> int:
diff --git a/src/main/python/g0101_0200/s0200_number_of_islands/Solution.py b/src/main/python/g0101_0200/s0200_number_of_islands/Solution.py
@@ -3,7 +3,7 @@
 # #Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search
 # #Graph_Theory_I_Day_1_Matrix_Related_Problems #Level_1_Day_9_Graph/BFS/DFS #Udemy_Graph
 # #Top_Interview_150_Graph_General #Big_O_Time_O(M*N)_Space_O(M*N)
-# #2024_06_09_Time_224_ms_(88.18%)_Space_18.7_MB_(96.10%)
+# #2025_07_25_Time_234_ms_(82.73%)_Space_19.96_MB_(95.69%)
 
 class Solution:
     def numIslands(self, grid: List[List[str]]) -> int:
diff --git a/src/main/python/g0201_0300/s0206_reverse_linked_list/Solution.py b/src/main/python/g0201_0300/s0206_reverse_linked_list/Solution.py
@@ -1,7 +1,7 @@
 # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion
 # #LeetCode_75_LinkedList #Data_Structure_I_Day_8_Linked_List
 # #Algorithm_I_Day_10_Recursion_Backtracking #Level_1_Day_3_Linked_List #Udemy_Linked_List
-# #Big_O_Time_O(N)_Space_O(1) #2024_06_09_Time_35_ms_(72.56%)_Space_17.6_MB_(68.68%)
+# #Big_O_Time_O(N)_Space_O(1) #2025_07_25_Time_0_ms_(100.00%)_Space_18.75_MB_(37.87%)
 
 # Definition for singly-linked list.
 # class ListNode:
diff --git a/src/main/python/g0201_0300/s0207_course_schedule/Solution.py b/src/main/python/g0201_0300/s0207_course_schedule/Solution.py
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search
 # #Breadth_First_Search #Graph #Topological_Sort #Top_Interview_150_Graph_General
-# #Big_O_Time_O(N)_Space_O(N) #2024_06_09_Time_86_ms_(76.64%)_Space_18.4_MB_(48.61%)
+# #Big_O_Time_O(N)_Space_O(N) #2025_07_25_Time_3_ms_(88.23%)_Space_19.05_MB_(73.39%)
 
 class Solution:
     WHITE = 0
diff --git a/src/main/python/g0201_0300/s0208_implement_trie_prefix_tree/Trie.py b/src/main/python/g0201_0300/s0208_implement_trie_prefix_tree/Trie.py
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Design #Trie
 # #LeetCode_75_Trie #Level_2_Day_16_Design #Udemy_Trie_and_Heap #Top_Interview_150_Trie
 # #Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N)
-# #2024_06_09_Time_140_ms_(28.87%)_Space_33.8_MB_(16.61%)
+# #2025_07_25_Time_59_ms_(32.46%)_Space_35.26_MB_(14.23%)
 
 class TrieNode:
     # Initialize your data structure here.
diff --git a/src/main/python/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.py b/src/main/python/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.py
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Heap_Priority_Queue
 # #Divide_and_Conquer #Quickselect #LeetCode_75_Heap/Priority_Queue
 # #Data_Structure_II_Day_20_Heap_Priority_Queue #Top_Interview_150_Heap
-# #Big_O_Time_O(n*log(n))_Space_O(log(n)) #2024_06_09_Time_446_ms_(79.92%)_Space_29.9_MB_(52.14%)
+# #Big_O_Time_O(n*log(n))_Space_O(log(n)) #2025_07_25_Time_45_ms_(90.46%)_Space_28.73_MB_(45.18%)
 
 class Solution:
     def findKthLargest(self, nums: List[int], k: int) -> int:
