Skip to content

Commit d6bd45e

Browse files
ThanhNITThanhNIT
authored
Updated tags for tasks 49-74
1 parent 0ee1e7c commit d6bd45e

File tree

11 files changed

+14
-14
lines changed

11 files changed

+14
-14
lines changed

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ package s0049_group_anagrams
33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #String #Hash_Table #Sorting
44
// #Data_Structure_II_Day_8_String #Programming_Skills_II_Day_11 #Udemy_Strings
55
// #Top_Interview_150_Hashmap #Big_O_Time_O(n*k_log_k)_Space_O(n)
6-
// #2024_03_13_Time_16_ms_(85.07%)_Space_7.2_MB_(85.47%)
6+
// #2025_05_05_Time_4_ms_(96.55%)_Space_10.20_MB_(30.85%)
77

88
func groupAnagrams(strings []string) [][]string {
99
stringsByPattern := make(map[[26]byte][]string)

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

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

33
// #Hard #Top_100_Liked_Questions #Array #Backtracking #Big_O_Time_O(N!)_Space_O(N)
4-
// #2024_03_13_Time_0_ms_(100.00%)_Space_3.3_MB_(61.83%)
4+
// #2025_05_05_Time_0_ms_(100.00%)_Space_5.23_MB_(62.71%)
55

66
func solveNQueens(n int) [][]string {
77
pos := make([]bool, n+2*n-1+2*n-1)

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ package s0053_maximum_subarray
33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
44
// #Divide_and_Conquer #Data_Structure_I_Day_1_Array #Dynamic_Programming_I_Day_5
55
// #Udemy_Famous_Algorithm #Top_Interview_150_Kadane's_Algorithm #Big_O_Time_O(n)_Space_O(1)
6-
// #2024_03_13_Time_79_ms_(87.63%)_Space_7.8_MB_(92.56%)
6+
// #2025_05_05_Time_0_ms_(100.00%)_Space_10.37_MB_(42.73%)
77

88
func maxSubArray(nums []int) int {
99
sum, max := nums[0], nums[0]

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ package s0055_jump_game
33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming #Greedy
44
// #Algorithm_II_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_4 #Udemy_Arrays
55
// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
6-
// #2024_03_13_Time_48_ms_(71.95%)_Space_6.7_MB_(99.94%)
6+
// #2025_05_05_Time_0_ms_(100.00%)_Space_8.96_MB_(66.09%)
77

88
func canJump(nums []int) bool {
99
if len(nums) == 1 {

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ package s0056_merge_intervals
33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting
44
// #Data_Structure_II_Day_2_Array #Level_2_Day_17_Interval #Udemy_2D_Arrays/Matrix
55
// #Top_Interview_150_Intervals #Big_O_Time_O(n_log_n)_Space_O(n)
6-
// #2024_03_13_Time_12_ms_(90.65%)_Space_6.3_MB_(74.98%)
6+
// #2025_05_05_Time_0_ms_(100.00%)_Space_8.61_MB_(25.59%)
77

88
import "sort"
99

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

+3-3
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,9 @@
11
package s0062_unique_paths
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Math
4-
// #Combinatorics #Algorithm_II_Day_13_Dynamic_Programming #Dynamic_Programming_I_Day_15
5-
// #Level_1_Day_11_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(m*n)
6-
// #2024_03_14_Time_0_ms_(100.00%)_Space_2.2_MB_(26.53%)
4+
// #Combinatorics #LeetCode_75_DP/Multidimensional #Algorithm_II_Day_13_Dynamic_Programming
5+
// #Dynamic_Programming_I_Day_15 #Level_1_Day_11_Dynamic_Programming
6+
// #Big_O_Time_O(m*n)_Space_O(m*n) #2025_05_05_Time_0_ms_(100.00%)_Space_4.06_MB_(55.42%)
77

88
func uniquePaths(m int, n int) int {
99
dp := make([][]int, m)

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

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

33
// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Matrix
44
// #Dynamic_Programming_I_Day_16 #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP
5-
// #Big_O_Time_O(m*n)_Space_O(m*n) #2024_03_14_Time_0_ms_(100.00%)_Space_4.1_MB_(24.44%)
5+
// #Big_O_Time_O(m*n)_Space_O(m*n) #2025_05_05_Time_0_ms_(100.00%)_Space_7.68_MB_(48.53%)
66

77
func minPathSum(grid [][]int) int {
88
if len(grid) == 1 && len(grid[0]) == 1 {

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ package s0070_climbing_stairs
33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Math #Memoization
44
// #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_2
55
// #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP
6-
// #Big_O_Time_O(n)_Space_O(n) #2024_03_14_Time_0_ms_(100.00%)_Space_2_MB_(50.58%)
6+
// #Big_O_Time_O(n)_Space_O(n) #2025_05_05_Time_0_ms_(100.00%)_Space_3.88_MB_(81.88%)
77

88
func climbStairs(n int) int {
99
f := make([]int, n+1)

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

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,9 @@
11
package s0072_edit_distance
22

3-
// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming
3+
// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional
44
// #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_19
55
// #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(n^2)_Space_O(n2)
6-
// #2024_03_14_Time_0_ms_(100.00%)_Space_2.6_MB_(97.61%)
6+
// #2025_05_05_Time_0_ms_(100.00%)_Space_4.46_MB_(99.07%)
77

88
func minDistance(word1 string, word2 string) int {
99
n1 := len(word1)

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

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Matrix
44
// #Udemy_2D_Arrays/Matrix #Top_Interview_150_Matrix #Big_O_Time_O(m*n)_Space_O(1)
5-
// #2024_03_14_Time_8_ms_(83.64%)_Space_5.9_MB_(75.58%)
5+
// #2025_05_05_Time_0_ms_(100.00%)_Space_7.88_MB_(57.66%)
66

77
func setZeroes(matrix [][]int) {
88
m := len(matrix)

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ package s0074_search_a_2d_matrix
33
// #Medium #Top_100_Liked_Questions #Array #Binary_Search #Matrix #Data_Structure_I_Day_5_Array
44
// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_8 #Level_2_Day_8_Binary_Search
55
// #Udemy_2D_Arrays/Matrix #Top_Interview_150_Binary_Search #Big_O_Time_O(endRow+endCol)_Space_O(1)
6-
// #2024_03_15_Time_0_ms_(100.00%)_Space_2.6_MB_(75.18%)
6+
// #2025_05_05_Time_0_ms_(100.00%)_Space_4.45_MB_(46.12%)
77

88
func searchMatrix(matrix [][]int, target int) bool {
99
endRow := len(matrix)

0 commit comments

Comments
 (0)