Updated tasks 2-39

javadev · javadev · commit 7fb2d87fe232 · 2025-07-23T07:33:45.000+03:00
diff --git a/src/main/python/g0001_0100/s0002_add_two_numbers/Solution.py b/src/main/python/g0001_0100/s0002_add_two_numbers/Solution.py
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Math #Linked_List #Recursion
 # #Data_Structure_II_Day_10_Linked_List #Programming_Skills_II_Day_15
 # #Top_Interview_150_Linked_List #Big_O_Time_O(max(N,M))_Space_O(max(N,M))
-# #AI_can_be_used_to_solve_the_task #2024_06_06_Time_47_ms_(90.77%)_Space_16.6_MB_(83.79%)
+# #AI_can_be_used_to_solve_the_task #2025_07_22_Time_0_ms_(100.00%)_Space_17.84_MB_(56.69%)
 
 # Definition for singly-linked list.
 # class ListNode:
diff --git a/src/main/python/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.py b/src/main/python/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.py
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window
 # #Algorithm_I_Day_6_Sliding_Window #Level_2_Day_14_Sliding_Window/Two_Pointer #Udemy_Strings
 # #Top_Interview_150_Sliding_Window #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task
-# #2024_06_06_Time_45_ms_(93.32%)_Space_16.6_MB_(53.05%)
+# #2025_07_22_Time_9_ms_(97.01%)_Space_17.98_MB_(34.00%)
 
 class Solution:
     def lengthOfLongestSubstring(self, s: str) -> int:
diff --git a/src/main/python/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.py b/src/main/python/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.py
@@ -1,6 +1,6 @@
 # #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Divide_and_Conquer
 # #Top_Interview_150_Binary_Search #Big_O_Time_O(log(min(N,M)))_Space_O(1)
-# #AI_can_be_used_to_solve_the_task #2024_06_03_Time_63_ms_(99.35%)_Space_16.9_MB_(31.27%)
+# #AI_can_be_used_to_solve_the_task #2025_07_22_Time_3_ms_(51.31%)_Space_18.28_MB_(18.81%)
 
 class Solution:
     def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
diff --git a/src/main/python/g0001_0100/s0005_longest_palindromic_substring/Solution.py b/src/main/python/g0001_0100/s0005_longest_palindromic_substring/Solution.py
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming
 # #Data_Structure_II_Day_9_String #Algorithm_II_Day_14_Dynamic_Programming
 # #Dynamic_Programming_I_Day_17 #Udemy_Strings #Top_Interview_150_Multidimensional_DP
-# #Big_O_Time_O(n)_Space_O(n) #2024_06_03_Time_78_ms_(97.43%)_Space_16.7_MB_(47.93%)
+# #Big_O_Time_O(n)_Space_O(n) #2025_07_22_Time_47_ms_(97.38%)_Space_17.90_MB_(59.55%)
 
 class Solution:
     def longestPalindrome(self, s: str) -> str:
diff --git a/src/main/python/g0001_0100/s0006_zigzag_conversion/Solution.py b/src/main/python/g0001_0100/s0006_zigzag_conversion/Solution.py
@@ -1,5 +1,5 @@
-# #Medium #String #Top_Interview_150_Array/String
-# #2024_06_03_Time_41_ms_(94.82%)_Space_16.5_MB_(92.96%)
+# #Medium #String #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(n)
+# #2025_07_22_Time_5_ms_(93.09%)_Space_17.85_MB_(70.00%)
 
 class Solution:
     def convert(self, s: str, numRows: int) -> str:
diff --git a/src/main/python/g0001_0100/s0007_reverse_integer/Solution.py b/src/main/python/g0001_0100/s0007_reverse_integer/Solution.py
@@ -1,5 +1,5 @@
-# #Medium #Top_Interview_Questions #Math #Udemy_Integers
-# #2024_06_03_Time_28_ms_(94.06%)_Space_16.5_MB_(93.17%)
+# #Medium #Top_Interview_Questions #Math #Udemy_Integers #Big_O_Time_O(log10(x))_Space_O(1)
+# #2025_07_22_Time_37_ms_(69.51%)_Space_17.70_MB_(57.22%)
 
 class Solution:
     def reverse(self, x: int) -> int:
diff --git a/src/main/python/g0001_0100/s0008_string_to_integer_atoi/Solution.py b/src/main/python/g0001_0100/s0008_string_to_integer_atoi/Solution.py
@@ -1,4 +1,5 @@
-# #Medium #Top_Interview_Questions #String #2024_06_03_Time_29_ms_(95.47%)_Space_16.6_MB_(73.62%)
+# #Medium #Top_Interview_Questions #String #Big_O_Time_O(n)_Space_O(n)
+# #2025_07_22_Time_0_ms_(100.00%)_Space_17.71_MB_(77.35%)
 
 class Solution:
     def myAtoi(self, s: str) -> int:
diff --git a/src/main/python/g0001_0100/s0009_palindrome_number/Solution.py b/src/main/python/g0001_0100/s0009_palindrome_number/Solution.py
@@ -1,5 +1,5 @@
-# #Easy #Math #Udemy_Integers #Top_Interview_150_Math
-# #2024_06_03_Time_43_ms_(91.99%)_Space_16.5_MB_(58.90%)
+# #Easy #Math #Udemy_Integers #Top_Interview_150_Math #Big_O_Time_O(log10(x))_Space_O(1)
+# #2025_07_22_Time_4_ms_(80.28%)_Space_17.98_MB_(19.56%)
 
 class Solution:
     def isPalindrome(self, x: int) -> bool:
diff --git a/src/main/python/g0001_0100/s0010_regular_expression_matching/Solution.py b/src/main/python/g0001_0100/s0010_regular_expression_matching/Solution.py
@@ -1,5 +1,5 @@
 # #Hard #Top_Interview_Questions #String #Dynamic_Programming #Recursion #Udemy_Dynamic_Programming
-# #Big_O_Time_O(m*n)_Space_O(m*n) #2024_06_03_Time_23_ms_(99.97%)_Space_16.3_MB_(98.67%)
+# #Big_O_Time_O(m*n)_Space_O(m*n) #2025_07_22_Time_1_ms_(97.40%)_Space_17.83_MB_(64.20%)
 
 class Solution:
     def __init__(self):
diff --git a/src/main/python/g0001_0100/s0011_container_with_most_water/Solution.py b/src/main/python/g0001_0100/s0011_container_with_most_water/Solution.py
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Greedy #Two_Pointers
 # #LeetCode_75_Two_Pointers #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers
-# #Big_O_Time_O(n)_Space_O(1) #2024_06_04_Time_488_ms_(91.81%)_Space_29.5_MB_(60.76%)
+# #Big_O_Time_O(n)_Space_O(1) #2025_07_22_Time_68_ms_(91.16%)_Space_28.60_MB_(23.78%)
 
 class Solution:
     def maxArea(self, height: List[int]) -> int:
diff --git a/src/main/python/g0001_0100/s0015_3sum/Solution.py b/src/main/python/g0001_0100/s0015_3sum/Solution.py
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Two_Pointers
 # #Data_Structure_II_Day_1_Array #Algorithm_II_Day_3_Two_Pointers #Udemy_Two_Pointers
 # #Top_Interview_150_Two_Pointers #Big_O_Time_O(n*log(n))_Space_O(n^2)
-# #2024_06_04_Time_683_ms_(63.27%)_Space_20.8_MB_(49.61%)
+# #2025_07_22_Time_581_ms_(56.92%)_Space_20.72_MB_(36.56%)
 
 class Solution:
     def threeSum(self, nums: List[int]) -> List[List[int]]:
diff --git a/src/main/python/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.py b/src/main/python/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.py
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Backtracking
 # #LeetCode_75_Backtracking #Algorithm_II_Day_11_Recursion_Backtracking
 # #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n)
-# #2024_06_04_Time_28_ms_(91.85%)_Space_16.5_MB_(84.41%)
+# #2025_07_22_Time_0_ms_(100.00%)_Space_17.68_MB_(92.03%)
 
 class Solution:
     def letterCombinations(self, digits: str) -> List[str]:
diff --git a/src/main/python/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.py b/src/main/python/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.py
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Two_Pointers #Linked_List
 # #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Top_Interview_150_Linked_List
-# #Big_O_Time_O(L)_Space_O(L) #2024_06_04_Time_21_ms_(99.70%)_Space_16.4_MB_(86.23%)
+# #Big_O_Time_O(L)_Space_O(L) #2025_07_22_Time_0_ms_(100.00%)_Space_17.70_MB_(84.76%)
 
 # Definition for singly-linked list.
 # class ListNode:
diff --git a/src/main/python/g0001_0100/s0020_valid_parentheses/Solution.py b/src/main/python/g0001_0100/s0020_valid_parentheses/Solution.py
@@ -1,9 +1,9 @@
 # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Stack
 # #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Top_Interview_150_Stack
-# #Big_O_Time_O(n)_Space_O(n) #2024_06_04_Time_24_ms_(98.16%)_Space_16.5_MB_(67.83%)
+# #Big_O_Time_O(n)_Space_O(n) #2025_07_22_Time_0_ms_(100.00%)_Space_17.79_MB_(80.81%)
 
 class Solution:
-    def isValid(self, s):
+    def isValid(self, s: str) -> bool:
         stack = []
         for char in s:
             if char in "({[":
diff --git a/src/main/python/g0001_0100/s0021_merge_two_sorted_lists/Solution.py b/src/main/python/g0001_0100/s0021_merge_two_sorted_lists/Solution.py
@@ -1,7 +1,7 @@
 # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion
 # #Data_Structure_I_Day_7_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking
 # #Level_1_Day_3_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List
-# #Big_O_Time_O(m+n)_Space_O(m+n) #2024_06_04_Time_31_ms_(92.02%)_Space_16.5_MB_(51.91%)
+# #Big_O_Time_O(m+n)_Space_O(m+n) #2025_07_22_Time_0_ms_(100.00%)_Space_17.70_MB_(61.28%)
 
 # Definition for singly-linked list.
 # class ListNode:
diff --git a/src/main/python/g0001_0100/s0022_generate_parentheses/Solution.py b/src/main/python/g0001_0100/s0022_generate_parentheses/Solution.py
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming
 # #Backtracking #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion
 # #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n)
-# #2024_06_04_Time_32_ms_(86.75%)_Space_16.8_MB_(83.99%)
+# #2025_07_22_Time_0_ms_(100.00%)_Space_18.17_MB_(25.52%)
 
 class Solution:
     def generateParenthesis(self, n: int) -> List[str]:
diff --git a/src/main/python/g0001_0100/s0023_merge_k_sorted_lists/Solution.py b/src/main/python/g0001_0100/s0023_merge_k_sorted_lists/Solution.py
@@ -1,6 +1,6 @@
 # #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Heap_Priority_Queue #Linked_List
 # #Divide_and_Conquer #Merge_Sort #Top_Interview_150_Divide_and_Conquer
-# #Big_O_Time_O(k*n*log(k))_Space_O(log(k)) #2024_06_04_Time_61_ms_(98.91%)_Space_19.9_MB_(34.38%)
+# #Big_O_Time_O(k*n*log(k))_Space_O(log(k)) #2025_07_22_Time_5_ms_(93.52%)_Space_20.28_MB_(55.14%)
 
 # Definition for singly-linked list.
 # class ListNode:
diff --git a/src/main/python/g0001_0100/s0024_swap_nodes_in_pairs/Solution.py b/src/main/python/g0001_0100/s0024_swap_nodes_in_pairs/Solution.py
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Linked_List #Recursion #Data_Structure_II_Day_12_Linked_List
 # #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(1)
-# #2024_06_04_Time_27_ms_(93.88%)_Space_16.4_MB_(83.92%)
+# #2025_07_22_Time_0_ms_(100.00%)_Space_17.66_MB_(83.09%)
 
 # Definition for singly-linked list.
 # class ListNode:
diff --git a/src/main/python/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.py b/src/main/python/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.py
@@ -1,6 +1,6 @@
 # #Hard #Top_100_Liked_Questions #Linked_List #Recursion #Data_Structure_II_Day_13_Linked_List
 # #Udemy_Linked_List #Top_Interview_150_Linked_List #Big_O_Time_O(n)_Space_O(k)
-# #2024_06_04_Time_36_ms_(90.51%)_Space_17.3_MB_(94.94%)
+# #2025_07_22_Time_0_ms_(100.00%)_Space_18.73_MB_(19.01%)
 
 # Definition for singly-linked list.
 # class ListNode:
diff --git a/src/main/python/g0001_0100/s0031_next_permutation/Solution.py b/src/main/python/g0001_0100/s0031_next_permutation/Solution.py
@@ -1,5 +1,5 @@
 # #Medium #Top_100_Liked_Questions #Array #Two_Pointers #Big_O_Time_O(n)_Space_O(1)
-# #2024_06_08_Time_35_ms_(93.06%)_Space_16.5_MB_(44.75%)
+# #2025_07_22_Time_0_ms_(100.00%)_Space_17.71_MB_(56.73%)
 
 class Solution:
     def nextPermutation(self, nums: List[int]) -> None:
diff --git a/src/main/python/g0001_0100/s0032_longest_valid_parentheses/Solution.py b/src/main/python/g0001_0100/s0032_longest_valid_parentheses/Solution.py
@@ -1,5 +1,5 @@
 # #Hard #Top_100_Liked_Questions #String #Dynamic_Programming #Stack #Big_O_Time_O(n)_Space_O(1)
-# #2024_06_08_Time_36_ms_(89.25%)_Space_16.7_MB_(89.20%)
+# #2025_07_22_Time_6_ms_(66.50%)_Space_17.80_MB_(97.72%)
 
 class Solution:
     def longestValidParentheses(self, s: str) -> int:
diff --git a/src/main/python/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.py b/src/main/python/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.py
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search
 # #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_11 #Level_2_Day_8_Binary_Search
 # #Udemy_Binary_Search #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1)
-# #2024_06_08_Time_36_ms_(91.71%)_Space_16.8_MB_(98.65%)
+# #2025_07_22_Time_0_ms_(100.00%)_Space_18.28_MB_(22.25%)
 
 class Solution:
     def search(self, nums: List[int], target: int) -> int:
diff --git a/src/main/python/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.py b/src/main/python/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.py
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search
 # #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Top_Interview_150_Binary_Search
-# #Big_O_Time_O(log_n)_Space_O(1) #2024_06_08_Time_64_ms_(97.49%)_Space_17.8_MB_(39.66%)
+# #Big_O_Time_O(log_n)_Space_O(1) #2025_07_22_Time_0_ms_(100.00%)_Space_18.99_MB_(75.63%)
 
 class Solution:
     def searchRange(self, nums: List[int], target: int) -> List[int]:
diff --git a/src/main/python/g0001_0100/s0035_search_insert_position/Solution.py b/src/main/python/g0001_0100/s0035_search_insert_position/Solution.py
@@ -1,6 +1,6 @@
 # #Easy #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_I_Day_1_Binary_Search
 # #Binary_Search_I_Day_2 #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1)
-# #2024_06_08_Time_41_ms_(94.38%)_Space_17.4_MB_(43.81%)
+# #2025_07_22_Time_0_ms_(100.00%)_Space_18.46_MB_(43.50%)
 
 class Solution:
     def searchInsert(self, nums: List[int], target: int) -> int:
diff --git a/src/main/python/g0001_0100/s0039_combination_sum/Solution.py b/src/main/python/g0001_0100/s0039_combination_sum/Solution.py
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Array #Backtracking #Algorithm_II_Day_10_Recursion_Backtracking
 # #Level_2_Day_20_Brute_Force/Backtracking #Udemy_Backtracking/Recursion
 # #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n+2^n)
-# #2024_06_08_Time_42_ms_(94.56%)_Space_16.5_MB_(78.21%)
+# #2025_07_22_Time_4_ms_(90.51%)_Space_17.64_MB_(98.10%)
 
 class Solution:
     def combinationSum(self, candidates: List[int], target: int) -> List[List[int]]:
