Updated tags and readme

javadev · web-flow · commit 7e4a3baa8689 · 2025-06-17T12:41:36.000+03:00
diff --git a/README.md b/README.md
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
-# #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%)
+# #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%)
 
 class Solution:
     def maxArea(self, height: List[int]) -> 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,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Backtracking
-# #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion
-# #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n)
+# #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%)
 
 class Solution:
diff --git a/src/main/python/g0001_0100/s0062_unique_paths/Solution.py b/src/main/python/g0001_0100/s0062_unique_paths/Solution.py
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Math
-# #Combinatorics #Algorithm_II_Day_13_Dynamic_Programming #Dynamic_Programming_I_Day_15
-# #Level_1_Day_11_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(m*n)
-# #2024_06_08_Time_24_ms_(98.19%)_Space_16.4_MB_(78.68%)
+# #Combinatorics #LeetCode_75_DP/Multidimensional #Algorithm_II_Day_13_Dynamic_Programming
+# #Dynamic_Programming_I_Day_15 #Level_1_Day_11_Dynamic_Programming
+# #Big_O_Time_O(m*n)_Space_O(m*n) #2024_06_08_Time_24_ms_(98.19%)_Space_16.4_MB_(78.68%)
 
 class Solution:
     def uniquePaths(self, m: int, n: int) -> int:
diff --git a/src/main/python/g0001_0100/s0072_edit_distance/Solution.py b/src/main/python/g0001_0100/s0072_edit_distance/Solution.py
@@ -1,4 +1,4 @@
-# #Medium #Top_100_Liked_Questions #String #Dynamic_Programming
+# #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional
 # #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_19
 # #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(n^2)_Space_O(n2)
 # #2024_06_08_Time_60_ms_(98.17%)_Space_18.5_MB_(81.62%)
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
@@ -1,5 +1,5 @@
 # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search
-# #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree
+# #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%)
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
-# #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%)
+# #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%)
 
 class Solution:
     def singleNumber(self, nums: List[int]) -> int:
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,5 +1,5 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
-# #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3
+# #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%)
 
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
-# #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%)
+# #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%)
 
 # Definition for singly-linked list.
 # class ListNode:
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,5 +1,5 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Design #Trie
-# #Level_2_Day_16_Design #Udemy_Trie_and_Heap #Top_Interview_150_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%)
 
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 #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%)
+# #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%)
 
 class Solution:
     def findKthLargest(self, nums: List[int], k: int) -> int:
diff --git a/src/main/python/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.py b/src/main/python/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.py
@@ -1,6 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree
-# #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General
-# #Big_O_Time_O(n)_Space_O(n) #2024_06_09_Time_43_ms_(89.34%)_Space_21_MB_(44.04%)
+# #LeetCode_75_Binary_Tree/DFS #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue
+# #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n)
+# #2024_06_09_Time_43_ms_(89.34%)_Space_21_MB_(44.04%)
 
 # Definition for a binary tree node.
 # class TreeNode:
diff --git a/src/main/python/g0201_0300/s0238_product_of_array_except_self/Solution.py b/src/main/python/g0201_0300/s0238_product_of_array_except_self/Solution.py
@@ -1,6 +1,6 @@
-# #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #Data_Structure_II_Day_5_Array #Udemy_Arrays
-# #Top_Interview_150_Array/String #Big_O_Time_O(n^2)_Space_O(n)
-# #2024_06_09_Time_241_ms_(99.65%)_Space_25.5_MB_(94.18%)
+# #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #LeetCode_75_Array/String
+# #Data_Structure_II_Day_5_Array #Udemy_Arrays #Top_Interview_150_Array/String
+# #Big_O_Time_O(n^2)_Space_O(n) #2024_06_09_Time_241_ms_(99.65%)_Space_25.5_MB_(94.18%)
 
 class Solution:
     def productExceptSelf(self, nums: List[int]) -> List[int]:
diff --git a/src/main/python/g0201_0300/s0283_move_zeroes/Solution.py b/src/main/python/g0201_0300/s0283_move_zeroes/Solution.py
@@ -1,6 +1,6 @@
-# #Easy #Top_100_Liked_Questions #Array #Two_Pointers #Algorithm_I_Day_3_Two_Pointers
-# #Programming_Skills_I_Day_6_Array #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1)
-# #2024_06_08_Time_113_ms_(97.70%)_Space_17.8_MB_(99.81%)
+# #Easy #Top_100_Liked_Questions #Array #Two_Pointers #LeetCode_75_Two_Pointers
+# #Algorithm_I_Day_3_Two_Pointers #Programming_Skills_I_Day_6_Array #Udemy_Arrays
+# #Big_O_Time_O(n)_Space_O(1) #2024_06_08_Time_113_ms_(97.70%)_Space_17.8_MB_(99.81%)
 
 class Solution:
     def moveZeroes(self, nums: List[int]) -> None:
diff --git a/src/main/python/g0301_0400/s0338_counting_bits/Solution.py b/src/main/python/g0301_0400/s0338_counting_bits/Solution.py
@@ -1,5 +1,6 @@
-# #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation
-# #Big_O_Time_O(num)_Space_O(num) #2024_06_08_Time_55_ms_(88.80%)_Space_23_MB_(95.35%)
+# #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation
+# #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num)
+# #2024_06_08_Time_55_ms_(88.80%)_Space_23_MB_(95.35%)
 
 class Solution:
     def countBits(self, num: int) -> List[int]:
diff --git a/src/main/python/g0301_0400/s0394_decode_string/Solution.py b/src/main/python/g0301_0400/s0394_decode_string/Solution.py
@@ -1,5 +1,6 @@
-# #Medium #Top_100_Liked_Questions #String #Stack #Recursion #Level_1_Day_14_Stack #Udemy_Strings
-# #Big_O_Time_O(n)_Space_O(n) #2024_06_08_Time_28_ms_(91.14%)_Space_16.5_MB_(41.29%)
+# #Medium #Top_100_Liked_Questions #String #Stack #Recursion #LeetCode_75_Stack
+# #Level_1_Day_14_Stack #Udemy_Strings #Big_O_Time_O(n)_Space_O(n)
+# #2024_06_08_Time_28_ms_(91.14%)_Space_16.5_MB_(41.29%)
 
 class Solution:
     def __init__(self):
diff --git a/src/main/python/g0401_0500/s0437_path_sum_iii/Solution.py b/src/main/python/g0401_0500/s0437_path_sum_iii/Solution.py
@@ -1,5 +1,5 @@
-# #Medium #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree #Big_O_Time_O(n)_Space_O(n)
-# #2024_06_07_Time_264_ms_(30.25%)_Space_16.8_MB_(98.67%)
+# #Medium #Depth_First_Search #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Level_2_Day_7_Tree
+# #Big_O_Time_O(n)_Space_O(n) #2024_06_07_Time_264_ms_(30.25%)_Space_16.8_MB_(98.67%)
 
 # Definition for a binary tree node.
 # class TreeNode:
diff --git a/src/main/python/g0701_0800/s0739_daily_temperatures/Solution.py b/src/main/python/g0701_0800/s0739_daily_temperatures/Solution.py
@@ -1,5 +1,6 @@
-# #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #Programming_Skills_II_Day_6
-# #Big_O_Time_O(n)_Space_O(n) #2024_06_07_Time_864_ms_(87.84%)_Space_30.8_MB_(64.29%)
+# #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #LeetCode_75_Monotonic_Stack
+# #Programming_Skills_II_Day_6 #Big_O_Time_O(n)_Space_O(n)
+# #2024_06_07_Time_864_ms_(87.84%)_Space_30.8_MB_(64.29%)
 
 class Solution:
     def dailyTemperatures(self, temperatures: List[int]) -> List[int]:
diff --git a/src/main/python/g1101_1200/s1143_longest_common_subsequence/Solution.py b/src/main/python/g1101_1200/s1143_longest_common_subsequence/Solution.py
@@ -1,4 +1,4 @@
-# #Medium #Top_100_Liked_Questions #String #Dynamic_Programming
+# #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional
 # #Algorithm_II_Day_17_Dynamic_Programming #Dynamic_Programming_I_Day_19
 # #Udemy_Dynamic_Programming #Big_O_Time_O(n*m)_Space_O(n*m)
 # #2024_06_07_Time_452_ms_(81.00%)_Space_41.6_MB_(77.76%)

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-# #Medium #Top_100_Liked_Questions #String #Dynamic_Programming`
	`1`	`+# #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional`
`2`	`2`	`# #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_19`
`3`	`3`	`# #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(n^2)_Space_O(n2)`
`4`	`4`	`# #2024_06_08_Time_60_ms_(98.17%)_Space_18.5_MB_(81.62%)`