Updated tags for tasks 114-142

ThanhNIT · web-flow · commit 335376e3e043 · 2025-05-07T20:23:42.000+03:00
diff --git a/README.md b/README.md
diff --git a/src/main/go/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.go b/src/main/go/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.go
@@ -2,7 +2,7 @@ package s0114_flatten_binary_tree_to_linked_list
 
 // #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Stack #Linked_List
 // #Udemy_Linked_List #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(N)
-// #2024_03_19_Time_0_ms_(100.00%)_Space_3.1_MB_(5.75%)
+// #2025_05_07_Time_0_ms_(100.00%)_Space_4.88_MB_(66.49%)
 
 type TreeNode struct {
 	Val   int
diff --git a/src/main/go/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.go b/src/main/go/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.go
@@ -3,7 +3,7 @@ package s0121_best_time_to_buy_and_sell_stock
 // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
 // #Data_Structure_I_Day_3_Array #Dynamic_Programming_I_Day_7 #Level_1_Day_5_Greedy #Udemy_Arrays
 // #Top_Interview_150_Array/String #Big_O_Time_O(N)_Space_O(1)
-// #2024_03_19_Time_76_ms_(99.34%)_Space_7.4_MB_(98.91%)
+// #2025_05_07_Time_0_ms_(100.00%)_Space_9.74_MB_(72.19%)
 
 func maxProfit(prices []int) int {
 	maxProfit := 0
diff --git a/src/main/go/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.go b/src/main/go/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.go
@@ -2,7 +2,7 @@ package s0124_binary_tree_maximum_path_sum
 
 // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Depth_First_Search
 // #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General
-// #Big_O_Time_O(N)_Space_O(N) #2024_03_19_Time_10_ms_(89.68%)_Space_7.8_MB_(94.84%)
+// #Big_O_Time_O(N)_Space_O(N) #2025_05_07_Time_0_ms_(100.00%)_Space_10.08_MB_(59.76%)
 
 type TreeNode struct {
 	Val   int
diff --git a/src/main/go/g0101_0200/s0128_longest_consecutive_sequence/solution.go b/src/main/go/g0101_0200/s0128_longest_consecutive_sequence/solution.go
@@ -2,7 +2,7 @@ package s0128_longest_consecutive_sequence
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Union_Find
 // #Top_Interview_150_Hashmap #Big_O_Time_O(N_log_N)_Space_O(1)
-// #2024_03_19_Time_54_ms_(99.84%)_Space_8.9_MB_(93.24%)
+// #2025_05_07_Time_4_ms_(99.84%)_Space_10.05_MB_(99.24%)
 
 import "sort"
 
diff --git a/src/main/go/g0101_0200/s0131_palindrome_partitioning/solution.go b/src/main/go/g0101_0200/s0131_palindrome_partitioning/solution.go
@@ -2,7 +2,7 @@ package s0131_palindrome_partitioning
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming
 // #Backtracking #Big_O_Time_O(N*2^N)_Space_O(2^N*N)
-// #2024_03_19_Time_221_ms_(97.16%)_Space_19.1_MB_(89.91%)
+// #2025_05_07_Time_18_ms_(92.42%)_Space_27.26_MB_(16.97%)
 
 func partition(s string) [][]string {
 	var res [][]string
diff --git a/src/main/go/g0101_0200/s0136_single_number/solution.go b/src/main/go/g0101_0200/s0136_single_number/solution.go
@@ -1,9 +1,9 @@
 package 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_03_19_Time_8_ms_(95.49%)_Space_6.1_MB_(77.03%)
+// #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) #2025_05_07_Time_0_ms_(100.00%)_Space_7.82_MB_(83.54%)
 
 func singleNumber(nums []int) int {
 	res := nums[0]
diff --git a/src/main/go/g0101_0200/s0138_copy_list_with_random_pointer/solution.go b/src/main/go/g0101_0200/s0138_copy_list_with_random_pointer/solution.go
@@ -2,7 +2,7 @@ package s0138_copy_list_with_random_pointer
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Linked_List
 // #Programming_Skills_II_Day_14 #Udemy_Linked_List #Top_Interview_150_Linked_List
-// #Big_O_Time_O(N)_Space_O(N) #2024_03_19_Time_2_ms_(70.11%)_Space_3.6_MB_(96.36%)
+// #Big_O_Time_O(N)_Space_O(N) #2025_05_07_Time_0_ms_(100.00%)_Space_5.44_MB_(28.63%)
 
 type Node struct {
 	Val    int
diff --git a/src/main/go/g0101_0200/s0139_word_break/solution.go b/src/main/go/g0101_0200/s0139_word_break/solution.go
@@ -3,7 +3,7 @@ package s0139_word_break
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table
 // #Dynamic_Programming #Trie #Memoization #Algorithm_II_Day_15_Dynamic_Programming
 // #Dynamic_Programming_I_Day_9 #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP
-// #Big_O_Time_O(M+max*N)_Space_O(M+N+max) #2024_03_20_Time_0_ms_(100.00%)_Space_2.4_MB_(16.32%)
+// #Big_O_Time_O(M+max*N)_Space_O(M+N+max) #2025_05_07_Time_0_ms_(100.00%)_Space_4.24_MB_(37.18%)
 
 func wordBreak(s string, wordDict []string) bool {
 	if len(wordDict) == 0 {
diff --git a/src/main/go/g0101_0200/s0141_linked_list_cycle/solution.go b/src/main/go/g0101_0200/s0141_linked_list_cycle/solution.go
@@ -2,7 +2,7 @@ package s0141_linked_list_cycle
 
 // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Two_Pointers #Linked_List
 // #Data_Structure_I_Day_7_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List
-// #Big_O_Time_O(N)_Space_O(1) #2024_03_20_Time_7_ms_(69.12%)_Space_4.6_MB_(82.42%)
+// #Big_O_Time_O(N)_Space_O(1) #2025_05_07_Time_4_ms_(76.55%)_Space_6.23_MB_(51.42%)
 
 type ListNode struct {
 	Val  int
diff --git a/src/main/go/g0101_0200/s0142_linked_list_cycle_ii/solution.go b/src/main/go/g0101_0200/s0142_linked_list_cycle_ii/solution.go
@@ -2,7 +2,7 @@ package s0142_linked_list_cycle_ii
 
 // #Medium #Top_100_Liked_Questions #Hash_Table #Two_Pointers #Linked_List
 // #Data_Structure_II_Day_10_Linked_List #Level_1_Day_4_Linked_List #Udemy_Linked_List
-// #Big_O_Time_O(N)_Space_O(1) #2024_03_20_Time_5_ms_(69.02%)_Space_3.8_MB_(98.54%)
+// #Big_O_Time_O(N)_Space_O(1) #2025_05_07_Time_0_ms_(100.00%)_Space_6.80_MB_(18.18%)
 
 type ListNode struct {
 	Val  int
@@ -17,26 +17,13 @@ type ListNode struct {
  * }
  */
 func detectCycle(head *ListNode) *ListNode {
-	if head == nil || head.Next == nil {
-		return nil
-	}
-	slow := head
-	fast := head
-	for fast != nil && fast.Next != nil {
-		fast = fast.Next.Next
-		slow = slow.Next
-		// intersected inside the loop.
-		if slow == fast {
-			break
+	m := map[*ListNode]bool{}
+	for head != nil {
+		if m[head] == true {
+			return head
 		}
+		m[head] = true
+		head = head.Next
 	}
-	if fast == nil || fast.Next == nil {
-		return nil
-	}
-	slow = head
-	for slow != fast {
-		slow = slow.Next
-		fast = fast.Next
-	}
-	return slow
+	return nil
 }
