Updated tags for tasks 240-437

ThanhNIT · web-flow · commit b52d4a83eca5 · 2025-05-10T09:34:52.000+03:00
diff --git a/README.md b/README.md
diff --git a/src/main/go/g0201_0300/s0240_search_a_2d_matrix_ii/solution.go b/src/main/go/g0201_0300/s0240_search_a_2d_matrix_ii/solution.go
@@ -2,7 +2,7 @@ package s0240_search_a_2d_matrix_ii
 
 // #Medium #Top_100_Liked_Questions #Array #Binary_Search #Matrix #Divide_and_Conquer
 // #Data_Structure_II_Day_4_Array #Binary_Search_II_Day_8 #Big_O_Time_O(n+m)_Space_O(1)
-// #2024_03_18_Time_11_ms_(96.10%)_Space_6.6_MB_(39.51%)
+// #2025_05_10_Time_9_ms_(98.86%)_Space_8.76_MB_(12.12%)
 
 func searchMatrix(matrix [][]int, target int) bool {
 	r := 0
diff --git a/src/main/go/g0201_0300/s0283_move_zeroes/solution.go b/src/main/go/g0201_0300/s0283_move_zeroes/solution.go
@@ -1,8 +1,8 @@
 package 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_03_18_Time_15_ms_(88.69%)_Space_8_MB_(5.38%)
+// #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) #2025_05_10_Time_0_ms_(100.00%)_Space_9.28_MB_(18.25%)
 
 func moveZeroes(nums []int) {
 	var j int
diff --git a/src/main/go/g0201_0300/s0287_find_the_duplicate_number/solution.go b/src/main/go/g0201_0300/s0287_find_the_duplicate_number/solution.go
@@ -2,7 +2,7 @@ package s0287_find_the_duplicate_number
 
 // #Medium #Top_100_Liked_Questions #Array #Binary_Search #Two_Pointers #Bit_Manipulation
 // #Binary_Search_II_Day_5 #Big_O_Time_O(n)_Space_O(n)
-// #2024_03_18_Time_68_ms_(98.63%)_Space_8.3_MB_(69.20%)
+// #2025_05_10_Time_1_ms_(90.38%)_Space_10.41_MB_(41.51%)
 
 func findDuplicate(nums []int) int {
 	arr := make([]int, len(nums)+1)
diff --git a/src/main/go/g0201_0300/s0295_find_median_from_data_stream/medianfinder.go b/src/main/go/g0201_0300/s0295_find_median_from_data_stream/medianfinder.go
@@ -2,7 +2,7 @@ package s0295_find_median_from_data_stream
 
 // #Hard #Top_100_Liked_Questions #Sorting #Two_Pointers #Design #Heap_Priority_Queue #Data_Stream
 // #Top_Interview_150_Heap #Big_O_Time_O(n*log_n)_Space_O(n)
-// #2024_03_18_Time_240_ms_(100.00%)_Space_22.5_MB_(23.89%)
+// #2025_05_10_Time_59_ms_(96.70%)_Space_25.46_MB_(10.38%)
 
 func pushHeap(a *[]int, x int) {
 	*a = append(*a, x)
diff --git a/src/main/go/g0201_0300/s0300_longest_increasing_subsequence/solution.go b/src/main/go/g0201_0300/s0300_longest_increasing_subsequence/solution.go
@@ -3,7 +3,7 @@ package s0300_longest_increasing_subsequence
 // #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Binary_Search
 // #Algorithm_II_Day_16_Dynamic_Programming #Binary_Search_II_Day_3 #Dynamic_Programming_I_Day_18
 // #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(n*log_n)_Space_O(n)
-// #2024_03_16_Time_5_ms_(91.77%)_Space_3.5_MB_(70.57%)
+// #2025_05_10_Time_0_ms_(100.00%)_Space_5.28_MB_(69.25%)
 
 import "math"
 
diff --git a/src/main/go/g0301_0400/s0322_coin_change/solution.go b/src/main/go/g0301_0400/s0322_coin_change/solution.go
@@ -3,7 +3,7 @@ package s0322_coin_change
 // #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Breadth_First_Search
 // #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_20
 // #Level_2_Day_12_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(m*n)_Space_O(amount)
-// #2024_03_16_Time_10_ms_(73.33%)_Space_6.4_MB_(71.07%)
+// #2025_05_10_Time_10_ms_(79.59%)_Space_8.61_MB_(51.21%)
 
 func coinChange(coins []int, amount int) int {
 	dp := make([]int, amount+1)
diff --git a/src/main/go/g0301_0400/s0338_counting_bits/solution.go b/src/main/go/g0301_0400/s0338_counting_bits/solution.go
@@ -1,7 +1,8 @@
 package s0338_counting_bits
 
-// #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation
-// #Big_O_Time_O(num)_Space_O(num) #2024_03_16_Time_0_ms_(100.00%)_Space_4.7_MB_(25.18%)
+// #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation
+// #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num)
+// #2025_05_10_Time_0_ms_(100.00%)_Space_6.48_MB_(48.26%)
 
 func countBits(num int) []int {
 	result := make([]int, num+1)
diff --git a/src/main/go/g0301_0400/s0347_top_k_frequent_elements/solution.go b/src/main/go/g0301_0400/s0347_top_k_frequent_elements/solution.go
@@ -2,7 +2,7 @@ package s0347_top_k_frequent_elements
 
 // #Medium #Top_100_Liked_Questions #Array #Hash_Table #Sorting #Heap_Priority_Queue #Counting
 // #Divide_and_Conquer #Quickselect #Bucket_Sort #Data_Structure_II_Day_20_Heap_Priority_Queue
-// #Big_O_Time_O(n*log(n))_Space_O(k) #2024_03_16_Time_8_ms_(88.72%)_Space_6.2_MB_(61.53%)
+// #Big_O_Time_O(n*log(n))_Space_O(k) #2025_05_10_Time_0_ms_(100.00%)_Space_7.96_MB_(62.32%)
 
 import "sort"
 
diff --git a/src/main/go/g0301_0400/s0394_decode_string/solution.go b/src/main/go/g0301_0400/s0394_decode_string/solution.go
@@ -1,7 +1,8 @@
 package 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_03_16_Time_1_ms_(76.33%)_Space_2.2_MB_(26.06%)
+// #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)
+// #2025_05_10_Time_0_ms_(100.00%)_Space_4.00_MB_(85.31%)
 
 import (
 	"strings"
diff --git a/src/main/go/g0401_0500/s0416_partition_equal_subset_sum/solution.go b/src/main/go/g0401_0500/s0416_partition_equal_subset_sum/solution.go
@@ -1,23 +1,30 @@
 package s0416_partition_equal_subset_sum
 
 // #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Level_2_Day_13_Dynamic_Programming
-// #Big_O_Time_O(n*sums)_Space_O(n*sums) #2024_03_12_Time_13_ms_(91.83%)_Space_2.5_MB_(98.44%)
+// #Big_O_Time_O(n*sums)_Space_O(n*sums) #2025_05_10_Time_4_ms_(97.02%)_Space_4.42_MB_(72.07%)
 
 func canPartition(nums []int) bool {
-	sums := 0
-	for _, num := range nums {
-		sums += num
+	sum := 0
+	for _, v := range nums {
+		sum += v
 	}
-	if sums%2 == 1 {
+	if sum%2 == 1 {
 		return false
 	}
-	sums /= 2
-	dp := make([]bool, sums+1)
+	sum = sum / 2
+	dp := make([]bool, sum, sum)
 	dp[0] = true
-	for _, num := range nums {
-		for sum := sums; sum >= num; sum-- {
-			dp[sum] = dp[sum] || dp[sum-num]
+	for _, n := range nums {
+		if n <= sum {
+			if dp[sum-n] == true {
+				return true
+			}
+			for j := sum - n - 1; j >= 0; j-- {
+				if dp[j] == true {
+					dp[j+n] = true
+				}
+			}
 		}
 	}
-	return dp[sums]
+	return false
 }
diff --git a/src/main/go/g0401_0500/s0437_path_sum_iii/solution.go b/src/main/go/g0401_0500/s0437_path_sum_iii/solution.go
@@ -1,7 +1,7 @@
 package 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_03_12_Time_7_ms_(74.18%)_Space_5.3_MB_(19.02%)
+// #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) #2025_05_10_Time_0_ms_(100.00%)_Space_6.94_MB_(22.90%)
 
 type TreeNode struct {
 	Val   int
