Skip to content

Commit f17cc7d

Browse files
ThanhNITThanhNIT
authored
Updated tags for tasks 75-105
1 parent d6bd45e commit f17cc7d

File tree

13 files changed

+81
-81
lines changed

13 files changed

+81
-81
lines changed

‎README.md

+68-68
Large diffs are not rendered by default.

‎src/main/go/g0001_0100/s0075_sort_colors/solution.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ package s0075_sort_colors
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Two_Pointers
44
// #Data_Structure_II_Day_2_Array #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1)
5-
// #2024_03_15_Time_1_ms_(76.26%)_Space_2.1_MB_(8.79%)
5+
// #2025_05_06_Time_0_ms_(100.00%)_Space_4.17_MB_(11.59%)
66

77
func sortColors(nums []int) {
88
zeroes := 0

‎src/main/go/g0001_0100/s0076_minimum_window_substring/solution.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ package s0076_minimum_window_substring
22

33
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window
44
// #Level_2_Day_14_Sliding_Window/Two_Pointer #Top_Interview_150_Sliding_Window
5-
// #Big_O_Time_O(s.length())_Space_O(1) #2024_03_15_Time_0_ms_(100.00%)_Space_3_MB_(66.67%)
5+
// #Big_O_Time_O(s.length())_Space_O(1) #2025_05_06_Time_0_ms_(100.00%)_Space_5.22_MB_(52.57%)
66

77
import "math"
88

‎src/main/go/g0001_0100/s0078_subsets/solution.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ package s0078_subsets
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Bit_Manipulation #Backtracking
44
// #Algorithm_II_Day_9_Recursion_Backtracking #Udemy_Backtracking/Recursion
5-
// #Big_O_Time_O(2^n)_Space_O(n*2^n) #2024_03_15_Time_1_ms_(80.53%)_Space_2.4_MB_(60.25%)
5+
// #Big_O_Time_O(2^n)_Space_O(n*2^n) #2025_05_06_Time_0_ms_(100.00%)_Space_4.31_MB_(21.64%)
66

77
func subsets(nums []int) [][]int {
88
var res [][]int

‎src/main/go/g0001_0100/s0079_word_search/solution.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ package s0079_word_search
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Matrix #Backtracking
44
// #Algorithm_II_Day_11_Recursion_Backtracking #Top_Interview_150_Backtracking
5-
// #Big_O_Time_O(4^(m*n))_Space_O(m*n) #2024_03_15_Time_103_ms_(79.70%)_Space_2_MB_(58.16%)
5+
// #Big_O_Time_O(4^(m*n))_Space_O(m*n) #2025_05_06_Time_99_ms_(79.91%)_Space_4.02_MB_(88.63%)
66

77
func exist(board [][]byte, word string) bool {
88
var run func(i, j, k int) bool

‎src/main/go/g0001_0100/s0084_largest_rectangle_in_histogram/solution.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package s0084_largest_rectangle_in_histogram
22

33
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Stack #Monotonic_Stack
4-
// #Big_O_Time_O(n_log_n)_Space_O(log_n) #2024_03_15_Time_95_ms_(77.81%)_Space_7.8_MB_(91.91%)
4+
// #Big_O_Time_O(n_log_n)_Space_O(log_n) #2025_05_06_Time_2_ms_(94.16%)_Space_10.14_MB_(81.09%)
55

66
import "math"
77

‎src/main/go/g0001_0100/s0094_binary_tree_inorder_traversal/solution.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ package s0094_binary_tree_inorder_traversal
22

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree
44
// #Stack #Data_Structure_I_Day_10_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n)
5-
// #2024_03_15_Time_0_ms_(100.00%)_Space_2.3_MB_(82.78%)
5+
// #2025_05_06_Time_0_ms_(100.00%)_Space_4.12_MB_(29.86%)
66

77
type TreeNode struct {
88
Val int

‎src/main/go/g0001_0100/s0096_unique_binary_search_trees/solution.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ package s0096_unique_binary_search_trees
22

33
// #Medium #Dynamic_Programming #Math #Tree #Binary_Tree #Binary_Search_Tree
44
// #Dynamic_Programming_I_Day_11 #Big_O_Time_O(n)_Space_O(1)
5-
// #2024_03_15_Time_0_ms_(100.00%)_Space_2.1_MB_(46.95%)
5+
// #2025_05_06_Time_0_ms_(100.00%)_Space_3.85_MB_(79.74%)
66

77
func numTrees(n int) int {
88
result := 1

‎src/main/go/g0001_0100/s0098_validate_binary_search_tree/solution.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ package s0098_validate_binary_search_tree
33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree
44
// #Binary_Search_Tree #Data_Structure_I_Day_14_Tree #Level_1_Day_8_Binary_Search_Tree
55
// #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(N)_Space_O(log(N))
6-
// #2024_03_15_Time_6_ms_(55.36%)_Space_5.4_MB_(59.64%)
6+
// #2025_05_06_Time_0_ms_(100.00%)_Space_7.21_MB_(46.50%)
77

88
type TreeNode struct {
99
Val int

‎src/main/go/g0101_0200/s0101_symmetric_tree/solution.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ package s0101_symmetric_tree
33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search
44
// #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree #Level_2_Day_15_Tree
55
// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(log(N))
6-
// #2024_03_15_Time_0_ms_(100.00%)_Space_3_MB_(8.89%)
6+
// #2025_05_06_Time_0_ms_(100.00%)_Space_4.79_MB_(79.66%)
77

88
type TreeNode struct {
99
Val int

‎src/main/go/g0101_0200/s0102_binary_tree_level_order_traversal/solution.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ package s0102_binary_tree_level_order_traversal
33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Breadth_First_Search #Tree
44
// #Binary_Tree #Data_Structure_I_Day_11_Tree #Level_1_Day_6_Tree #Udemy_Tree_Stack_Queue
55
// #Top_Interview_150_Binary_Tree_BFS #Big_O_Time_O(N)_Space_O(N)
6-
// #2024_03_19_Time_3_ms_(70.81%)_Space_3.8_MB_(31.96%)
6+
// #2025_05_06_Time_0_ms_(100.00%)_Space_5.45_MB_(96.04%)
77

88
type TreeNode struct {
99
Val int

‎src/main/go/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.go

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,10 +1,10 @@
11
package s0104_maximum_depth_of_binary_tree
22

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search
4-
// #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree
4+
// #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Data_Structure_I_Day_11_Tree
55
// #Programming_Skills_I_Day_10_Linked_List_and_Tree #Udemy_Tree_Stack_Queue
66
// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(H)
7-
// #2024_03_19_Time_0_ms_(100.00%)_Space_4.6_MB_(19.81%)
7+
// #2025_05_06_Time_0_ms_(100.00%)_Space_6.36_MB_(51.89%)
88

99
type TreeNode struct {
1010
Val int

‎src/main/go/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ package s0105_construct_binary_tree_from_preorder_and_inorder_traversal
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Tree #Binary_Tree
44
// #Divide_and_Conquer #Data_Structure_II_Day_15_Tree #Top_Interview_150_Binary_Tree_General
5-
// #Big_O_Time_O(N)_Space_O(N) #2024_03_19_Time_0_ms_(100.00%)_Space_4.4_MB_(16.83%)
5+
// #Big_O_Time_O(N)_Space_O(N) #2025_05_06_Time_0_ms_(100.00%)_Space_6.11_MB_(20.43%)
66

77
type TreeNode struct {
88
Val int

0 commit comments

Comments
 (0)