Skip to content

Commit b52d4a8

Browse files
ThanhNITThanhNIT
authored
Updated tags for tasks 240-437
1 parent 741f421 commit b52d4a8

File tree

12 files changed

+98
-89
lines changed

12 files changed

+98
-89
lines changed

‎README.md

Lines changed: 63 additions & 63 deletions
Large diffs are not rendered by default.

‎src/main/go/g0201_0300/s0240_search_a_2d_matrix_ii/solution.go

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ package s0240_search_a_2d_matrix_ii
22

33
// #Medium #Top_100_Liked_Questions #Array #Binary_Search #Matrix #Divide_and_Conquer
44
// #Data_Structure_II_Day_4_Array #Binary_Search_II_Day_8 #Big_O_Time_O(n+m)_Space_O(1)
5-
// #2024_03_18_Time_11_ms_(96.10%)_Space_6.6_MB_(39.51%)
5+
// #2025_05_10_Time_9_ms_(98.86%)_Space_8.76_MB_(12.12%)
66

77
func searchMatrix(matrix [][]int, target int) bool {
88
r := 0

‎src/main/go/g0201_0300/s0283_move_zeroes/solution.go

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
package s0283_move_zeroes
22

3-
// #Easy #Top_100_Liked_Questions #Array #Two_Pointers #Algorithm_I_Day_3_Two_Pointers
4-
// #Programming_Skills_I_Day_6_Array #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1)
5-
// #2024_03_18_Time_15_ms_(88.69%)_Space_8_MB_(5.38%)
3+
// #Easy #Top_100_Liked_Questions #Array #Two_Pointers #LeetCode_75_Two_Pointers
4+
// #Algorithm_I_Day_3_Two_Pointers #Programming_Skills_I_Day_6_Array #Udemy_Arrays
5+
// #Big_O_Time_O(n)_Space_O(1) #2025_05_10_Time_0_ms_(100.00%)_Space_9.28_MB_(18.25%)
66

77
func moveZeroes(nums []int) {
88
var j int

‎src/main/go/g0201_0300/s0287_find_the_duplicate_number/solution.go

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ package s0287_find_the_duplicate_number
22

33
// #Medium #Top_100_Liked_Questions #Array #Binary_Search #Two_Pointers #Bit_Manipulation
44
// #Binary_Search_II_Day_5 #Big_O_Time_O(n)_Space_O(n)
5-
// #2024_03_18_Time_68_ms_(98.63%)_Space_8.3_MB_(69.20%)
5+
// #2025_05_10_Time_1_ms_(90.38%)_Space_10.41_MB_(41.51%)
66

77
func findDuplicate(nums []int) int {
88
arr := make([]int, len(nums)+1)

‎src/main/go/g0201_0300/s0295_find_median_from_data_stream/medianfinder.go

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ package s0295_find_median_from_data_stream
22

33
// #Hard #Top_100_Liked_Questions #Sorting #Two_Pointers #Design #Heap_Priority_Queue #Data_Stream
44
// #Top_Interview_150_Heap #Big_O_Time_O(n*log_n)_Space_O(n)
5-
// #2024_03_18_Time_240_ms_(100.00%)_Space_22.5_MB_(23.89%)
5+
// #2025_05_10_Time_59_ms_(96.70%)_Space_25.46_MB_(10.38%)
66

77
func pushHeap(a *[]int, x int) {
88
*a = append(*a, x)

‎src/main/go/g0201_0300/s0300_longest_increasing_subsequence/solution.go

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ package s0300_longest_increasing_subsequence
33
// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Binary_Search
44
// #Algorithm_II_Day_16_Dynamic_Programming #Binary_Search_II_Day_3 #Dynamic_Programming_I_Day_18
55
// #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(n*log_n)_Space_O(n)
6-
// #2024_03_16_Time_5_ms_(91.77%)_Space_3.5_MB_(70.57%)
6+
// #2025_05_10_Time_0_ms_(100.00%)_Space_5.28_MB_(69.25%)
77

88
import "math"
99

‎src/main/go/g0301_0400/s0322_coin_change/solution.go

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ package s0322_coin_change
33
// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Breadth_First_Search
44
// #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_20
55
// #Level_2_Day_12_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(m*n)_Space_O(amount)
6-
// #2024_03_16_Time_10_ms_(73.33%)_Space_6.4_MB_(71.07%)
6+
// #2025_05_10_Time_10_ms_(79.59%)_Space_8.61_MB_(51.21%)
77

88
func coinChange(coins []int, amount int) int {
99
dp := make([]int, amount+1)

‎src/main/go/g0301_0400/s0338_counting_bits/solution.go

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,8 @@
11
package s0338_counting_bits
22

3-
// #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation
4-
// #Big_O_Time_O(num)_Space_O(num) #2024_03_16_Time_0_ms_(100.00%)_Space_4.7_MB_(25.18%)
3+
// #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation
4+
// #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num)
5+
// #2025_05_10_Time_0_ms_(100.00%)_Space_6.48_MB_(48.26%)
56

67
func countBits(num int) []int {
78
result := make([]int, num+1)

‎src/main/go/g0301_0400/s0347_top_k_frequent_elements/solution.go

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ package s0347_top_k_frequent_elements
22

33
// #Medium #Top_100_Liked_Questions #Array #Hash_Table #Sorting #Heap_Priority_Queue #Counting
44
// #Divide_and_Conquer #Quickselect #Bucket_Sort #Data_Structure_II_Day_20_Heap_Priority_Queue
5-
// #Big_O_Time_O(n*log(n))_Space_O(k) #2024_03_16_Time_8_ms_(88.72%)_Space_6.2_MB_(61.53%)
5+
// #Big_O_Time_O(n*log(n))_Space_O(k) #2025_05_10_Time_0_ms_(100.00%)_Space_7.96_MB_(62.32%)
66

77
import "sort"
88

‎src/main/go/g0301_0400/s0394_decode_string/solution.go

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,8 @@
11
package s0394_decode_string
22

3-
// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #Level_1_Day_14_Stack #Udemy_Strings
4-
// #Big_O_Time_O(n)_Space_O(n) #2024_03_16_Time_1_ms_(76.33%)_Space_2.2_MB_(26.06%)
3+
// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #LeetCode_75_Stack
4+
// #Level_1_Day_14_Stack #Udemy_Strings #Big_O_Time_O(n)_Space_O(n)
5+
// #2025_05_10_Time_0_ms_(100.00%)_Space_4.00_MB_(85.31%)
56

67
import (
78
"strings"

‎src/main/go/g0401_0500/s0416_partition_equal_subset_sum/solution.go

Lines changed: 18 additions & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -1,23 +1,30 @@
11
package s0416_partition_equal_subset_sum
22

33
// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Level_2_Day_13_Dynamic_Programming
4-
// #Big_O_Time_O(n*sums)_Space_O(n*sums) #2024_03_12_Time_13_ms_(91.83%)_Space_2.5_MB_(98.44%)
4+
// #Big_O_Time_O(n*sums)_Space_O(n*sums) #2025_05_10_Time_4_ms_(97.02%)_Space_4.42_MB_(72.07%)
55

66
func canPartition(nums []int) bool {
7-
sums := 0
8-
for _, num := range nums {
9-
sums += num
7+
sum := 0
8+
for _, v := range nums {
9+
sum += v
1010
}
11-
if sums%2 == 1 {
11+
if sum%2 == 1 {
1212
return false
1313
}
14-
sums /= 2
15-
dp := make([]bool, sums+1)
14+
sum = sum / 2
15+
dp := make([]bool, sum, sum)
1616
dp[0] = true
17-
for _, num := range nums {
18-
for sum := sums; sum >= num; sum-- {
19-
dp[sum] = dp[sum] || dp[sum-num]
17+
for _, n := range nums {
18+
if n <= sum {
19+
if dp[sum-n] == true {
20+
return true
21+
}
22+
for j := sum - n - 1; j >= 0; j-- {
23+
if dp[j] == true {
24+
dp[j+n] = true
25+
}
26+
}
2027
}
2128
}
22-
return dp[sums]
29+
return false
2330
}

‎src/main/go/g0401_0500/s0437_path_sum_iii/solution.go

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package s0437_path_sum_iii
22

3-
// #Medium #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree #Big_O_Time_O(n)_Space_O(n)
4-
// #2024_03_12_Time_7_ms_(74.18%)_Space_5.3_MB_(19.02%)
3+
// #Medium #Depth_First_Search #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Level_2_Day_7_Tree
4+
// #Big_O_Time_O(n)_Space_O(n) #2025_05_10_Time_0_ms_(100.00%)_Space_6.94_MB_(22.90%)
55

66
type TreeNode struct {
77
Val int

0 commit comments

Comments
 (0)