Updated readme and tags

javadev · web-flow · commit 32be484ebcc2 · 2025-05-26T22:48:30.000+03:00
diff --git a/LeetCodeNet/G0001_0100/S0011_container_with_most_water/Solution.cs b/LeetCodeNet/G0001_0100/S0011_container_with_most_water/Solution.cs
@@ -1,8 +1,8 @@
 namespace LeetCodeNet.G0001_0100.S0011_container_with_most_water {
 
 // #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_01_11_Time_251_ms_(30.70%)_Space_61.5_MB_(26.65%)
+// #LeetCode_75_Two_Pointers #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers
+// #Big_O_Time_O(n)_Space_O(1) #2024_01_11_Time_251_ms_(30.70%)_Space_61.5_MB_(26.65%)
 
 public class Solution {
     public int MaxArea(int[] height) {
diff --git a/LeetCodeNet/G0001_0100/S0017_letter_combinations_of_a_phone_number/Solution.cs b/LeetCodeNet/G0001_0100/S0017_letter_combinations_of_a_phone_number/Solution.cs
@@ -1,8 +1,8 @@
 namespace LeetCodeNet.G0001_0100.S0017_letter_combinations_of_a_phone_number {
 
 // #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)
 // #2023_12_26_Time_108_ms_(95.24%)_Space_46.3_MB_(5.39%)
 
 using System.Text;
diff --git a/LeetCodeNet/G0001_0100/S0062_unique_paths/Solution.cs b/LeetCodeNet/G0001_0100/S0062_unique_paths/Solution.cs
@@ -1,9 +1,9 @@
 namespace LeetCodeNet.G0001_0100.S0062_unique_paths {
 
 // #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_01_05_Time_16_ms_(93.42%)_Space_26.2_MB_(96.08%)
+// #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_01_05_Time_16_ms_(93.42%)_Space_26.2_MB_(96.08%)
 
 public class Solution {
     public int UniquePaths(int m, int n) {
diff --git a/LeetCodeNet/G0001_0100/S0072_edit_distance/Solution.cs b/LeetCodeNet/G0001_0100/S0072_edit_distance/Solution.cs
@@ -1,6 +1,6 @@
 namespace LeetCodeNet.G0001_0100.S0072_edit_distance {
 
-// #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_01_05_Time_51_ms_(95.38%)_Space_44.5_MB_(20.65%)
diff --git a/LeetCodeNet/G0101_0200/S0104_maximum_depth_of_binary_tree/Solution.cs b/LeetCodeNet/G0101_0200/S0104_maximum_depth_of_binary_tree/Solution.cs
@@ -1,7 +1,7 @@
 namespace LeetCodeNet.G0101_0200.S0104_maximum_depth_of_binary_tree {
 
 // #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_01_09_Time_65_ms_(93.31%)_Space_42.3_MB_(9.74%)
diff --git a/LeetCodeNet/G0101_0200/S0136_single_number/Solution.cs b/LeetCodeNet/G0101_0200/S0136_single_number/Solution.cs
@@ -1,9 +1,9 @@
 namespace LeetCodeNet.G0101_0200.S0136_single_number {
 
 // #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_01_09_Time_87_ms_(93.37%)_Space_45.1_MB_(38.04%)
+// #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_01_09_Time_87_ms_(93.37%)_Space_45.1_MB_(38.04%)
 
 public class Solution {
     public int SingleNumber(int[] nums) {
diff --git a/LeetCodeNet/G0101_0200/S0198_house_robber/Solution.cs b/LeetCodeNet/G0101_0200/S0198_house_robber/Solution.cs
@@ -1,7 +1,7 @@
 namespace LeetCodeNet.G0101_0200.S0198_house_robber {
 
 // #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_01_11_Time_44_ms_(99.89%)_Space_39.8_MB_(13.60%)
 
diff --git a/LeetCodeNet/G0201_0300/S0206_reverse_linked_list/Solution.cs b/LeetCodeNet/G0201_0300/S0206_reverse_linked_list/Solution.cs
@@ -1,9 +1,9 @@
 namespace LeetCodeNet.G0201_0300.S0206_reverse_linked_list {
 
 // #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_01_10_Time_57_ms_(95.02%)_Space_40.9_MB_(19.99%)
+// #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_01_10_Time_57_ms_(95.02%)_Space_40.9_MB_(19.99%)
 
 using LeetCodeNet.Com_github_leetcode;
 
diff --git a/LeetCodeNet/G0201_0300/S0208_implement_trie_prefix_tree/Trie.cs b/LeetCodeNet/G0201_0300/S0208_implement_trie_prefix_tree/Trie.cs
@@ -1,7 +1,7 @@
 namespace LeetCodeNet.G0201_0300.S0208_implement_trie_prefix_tree {
 
 // #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_01_10_Time_178_ms_(88.12%)_Space_133.5_MB_(9.47%)
 
diff --git a/LeetCodeNet/G0201_0300/S0215_kth_largest_element_in_an_array/Solution.cs b/LeetCodeNet/G0201_0300/S0215_kth_largest_element_in_an_array/Solution.cs
@@ -1,9 +1,9 @@
 namespace LeetCodeNet.G0201_0300.S0215_kth_largest_element_in_an_array {
 
 // #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_01_10_Time_252_ms_(46.14%)_Space_55_MB_(26.22%)
+// #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_01_10_Time_252_ms_(46.14%)_Space_55_MB_(26.22%)
 
 using System;
 
diff --git a/LeetCodeNet/G0201_0300/S0236_lowest_common_ancestor_of_a_binary_tree/Solution.cs b/LeetCodeNet/G0201_0300/S0236_lowest_common_ancestor_of_a_binary_tree/Solution.cs
@@ -1,8 +1,9 @@
 namespace LeetCodeNet.G0201_0300.S0236_lowest_common_ancestor_of_a_binary_tree {
 
 // #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_01_10_Time_76_ms_(98.04%)_Space_45.9_MB_(13.60%)
+// #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_01_10_Time_76_ms_(98.04%)_Space_45.9_MB_(13.60%)
 
 using LeetCodeNet.Com_github_leetcode;
 
diff --git a/LeetCodeNet/G0201_0300/S0238_product_of_array_except_self/Solution.cs b/LeetCodeNet/G0201_0300/S0238_product_of_array_except_self/Solution.cs
@@ -1,8 +1,8 @@
 namespace LeetCodeNet.G0201_0300.S0238_product_of_array_except_self {
 
-// #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_01_10_Time_141_ms_(94.24%)_Space_58.3_MB_(10.01%)
+// #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_01_10_Time_141_ms_(94.24%)_Space_58.3_MB_(10.01%)
 
 public class Solution {
     public int[] ProductExceptSelf(int[] nums) {
diff --git a/LeetCodeNet/G0201_0300/S0283_move_zeroes/Solution.cs b/LeetCodeNet/G0201_0300/S0283_move_zeroes/Solution.cs
@@ -1,8 +1,8 @@
 namespace LeetCodeNet.G0201_0300.S0283_move_zeroes {
 
-// #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_01_07_Time_133_ms_(96.30%)_Space_57_MB_(17.07%)
+// #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_01_07_Time_133_ms_(96.30%)_Space_57_MB_(17.07%)
 
 public class Solution {
     public void MoveZeroes(int[] nums) {
diff --git a/LeetCodeNet/G0301_0400/S0338_counting_bits/Solution.cs b/LeetCodeNet/G0301_0400/S0338_counting_bits/Solution.cs
@@ -1,7 +1,8 @@
 namespace LeetCodeNet.G0301_0400.S0338_counting_bits {
 
-// #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation
-// #Big_O_Time_O(num)_Space_O(num) #2024_01_07_Time_67_ms_(98.82%)_Space_42.1_MB_(22.68%)
+// #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation
+// #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num)
+// #2024_01_07_Time_67_ms_(98.82%)_Space_42.1_MB_(22.68%)
 
 public class Solution {
     public int[] CountBits(int num) {
diff --git a/LeetCodeNet/G0301_0400/S0394_decode_string/Solution.cs b/LeetCodeNet/G0301_0400/S0394_decode_string/Solution.cs
@@ -1,7 +1,8 @@
 namespace LeetCodeNet.G0301_0400.S0394_decode_string {
 
-// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #Level_1_Day_14_Stack #Udemy_Strings
-// #Big_O_Time_O(n)_Space_O(n) #2024_01_07_Time_44_ms_(99.55%)_Space_38.2_MB_(26.91%)
+// #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_01_07_Time_44_ms_(99.55%)_Space_38.2_MB_(26.91%)
 
 using System.Text;
 
diff --git a/LeetCodeNet/G0401_0500/S0437_path_sum_iii/Solution.cs b/LeetCodeNet/G0401_0500/S0437_path_sum_iii/Solution.cs
@@ -1,7 +1,7 @@
 namespace LeetCodeNet.G0401_0500.S0437_path_sum_iii {
 
-// #Medium #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree #Big_O_Time_O(n)_Space_O(n)
-// #2024_01_05_Time_76_ms_(97.16%)_Space_42.8_MB_(29.79%)
+// #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_01_05_Time_76_ms_(97.16%)_Space_42.8_MB_(29.79%)
 
 using LeetCodeNet.Com_github_leetcode;
 
diff --git a/LeetCodeNet/G0701_0800/S0739_daily_temperatures/Solution.cs b/LeetCodeNet/G0701_0800/S0739_daily_temperatures/Solution.cs
@@ -1,7 +1,8 @@
 namespace LeetCodeNet.G0701_0800.S0739_daily_temperatures {
 
-// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #Programming_Skills_II_Day_6
-// #Big_O_Time_O(n)_Space_O(n) #2024_01_07_Time_376_ms_(44.29%)_Space_71.9_MB_(21.96%)
+// #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_01_07_Time_376_ms_(44.29%)_Space_71.9_MB_(21.96%)
 
 public class Solution {
     public int[] DailyTemperatures(int[] temperatures) {
diff --git a/LeetCodeNet/G1101_1200/S1143_longest_common_subsequence/Solution.cs b/LeetCodeNet/G1101_1200/S1143_longest_common_subsequence/Solution.cs
@@ -1,6 +1,6 @@
 namespace LeetCodeNet.G1101_1200.S1143_longest_common_subsequence {
 
-// #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_01_07_Time_59_ms_(90.45%)_Space_41.3_MB_(54.32%)
diff --git a/README.md b/README.md
