Skip to content

Commit a203336

Browse files
javadevjavadev
authored
Updated readme and tags
1 parent 5a658cf commit a203336

File tree

83 files changed

+888
-678
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

83 files changed

+888
-678
lines changed

‎.github/workflows/build.yml

+2-2
Original file line numberDiff line numberDiff line change
@@ -14,7 +14,7 @@ jobs:
1414
- name: setup
1515
uses: actions/setup-go@v4
1616
with:
17-
go-version: ^1.21
17+
go-version: ^1.24
1818

1919
- name: checkout
2020
uses: actions/checkout@v4
@@ -26,4 +26,4 @@ jobs:
2626
run: go vet ./...
2727

2828
- name: test
29-
run: go test -v -race -coverprofile=coverage.txt -covermode=atomic ./...
29+
run: go test -race -coverprofile=coverage.txt -covermode=atomic ./...

‎README.md

+717-532
Large diffs are not rendered by default.

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

+2-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,8 @@
11
package s0001_two_sum
22

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table
4-
// #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Big_O_Time_O(n)_Space_O(n)
4+
// #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Top_Interview_150_Hashmap
5+
// #Big_O_Time_O(n)_Space_O(n) #AI_can_be_used_to_solve_the_task
56
// #2024_01_28_Time_3_ms_(93.85%)_Space_4.2_MB_(58.64%)
67

78
func twoSum(nums []int, target int) []int {

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

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Math #Linked_List #Recursion
44
// #Data_Structure_II_Day_10_Linked_List #Programming_Skills_II_Day_15
5-
// #Big_O_Time_O(max(N,M))_Space_O(max(N,M)) #2024_03_05_Time_4_ms_(84.60%)_Space_4.4_MB_(47.97%)
5+
// #Top_Interview_150_Linked_List #Big_O_Time_O(max(N,M))_Space_O(max(N,M))
6+
// #AI_can_be_used_to_solve_the_task #2024_03_05_Time_4_ms_(84.60%)_Space_4.4_MB_(47.97%)
67

78
type ListNode struct {
89
Val int

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

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window
44
// #Algorithm_I_Day_6_Sliding_Window #Level_2_Day_14_Sliding_Window/Two_Pointer #Udemy_Strings
5-
// #Big_O_Time_O(n)_Space_O(1) #2024_03_05_Time_0_ms_(100.00%)_Space_2.5_MB_(98.66%)
5+
// #Top_Interview_150_Sliding_Window #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task
6+
// #2024_03_05_Time_0_ms_(100.00%)_Space_2.5_MB_(98.66%)
67

78
func lengthOfLongestSubstring(s string) int {
89
lastIndices := make([]int, 256)

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

+2-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,8 @@
11
package s0004_median_of_two_sorted_arrays
22

33
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Divide_and_Conquer
4-
// #Big_O_Time_O(log(min(N,M)))_Space_O(1) #2024_03_05_Time_9_ms_(72.04%)_Space_4.8_MB_(67.69%)
4+
// #Top_Interview_150_Binary_Search #Big_O_Time_O(log(min(N,M)))_Space_O(1)
5+
// #AI_can_be_used_to_solve_the_task #2024_03_05_Time_9_ms_(72.04%)_Space_4.8_MB_(67.69%)
56

67
func findMedianSortedArrays(nums1 []int, nums2 []int) float64 {
78
if len(nums1) > len(nums2) {

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

+2-2
Original file line numberDiff line numberDiff line change
@@ -2,8 +2,8 @@ package s0005_longest_palindromic_substring
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming
44
// #Data_Structure_II_Day_9_String #Algorithm_II_Day_14_Dynamic_Programming
5-
// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Big_O_Time_O(n)_Space_O(n)
6-
// #2024_03_05_Time_0_ms_(100.00%)_Space_3.8_MB_(32.56%)
5+
// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Top_Interview_150_Multidimensional_DP
6+
// #Big_O_Time_O(n)_Space_O(n) #2024_03_05_Time_0_ms_(100.00%)_Space_3.8_MB_(32.56%)
77

88
func longestPalindrome(s string) string {
99
newStr := make([]byte, len(s)*2+1)

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

+2-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package s0006_zigzag_conversion
22

3-
// #Medium #String #2024_03_05_Time_0_ms_(100.00%)_Space_4_MB_(86.83%)
3+
// #Medium #String #Top_Interview_150_Array/String
4+
// #2024_03_05_Time_0_ms_(100.00%)_Space_4_MB_(86.83%)
45

56
func convert(s string, numRows int) string {
67
topJump := (numRows-2)*2 + 2

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

+2-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package s0009_palindrome_number
22

3-
// #Easy #Math #Udemy_Integers #2024_03_07_Time_0_ms_(100.00%)_Space_4.3_MB_(99.46%)
3+
// #Easy #Math #Udemy_Integers #Top_Interview_150_Math
4+
// #2024_03_07_Time_0_ms_(100.00%)_Space_4.3_MB_(99.46%)
45

56
func isPalindrome(x int) bool {
67
if x < 10 {

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

+2-3
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,7 @@
11
package s0010_regular_expression_matching
22

3-
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming #Recursion
4-
// #Udemy_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(m*n)
5-
// #2024_03_07_Time_0_ms_(100.00%)_Space_2.3_MB_(36.02%)
3+
// #Hard #Top_Interview_Questions #String #Dynamic_Programming #Recursion #Udemy_Dynamic_Programming
4+
// #Big_O_Time_O(m*n)_Space_O(m*n) #2024_03_07_Time_0_ms_(100.00%)_Space_2.3_MB_(36.02%)
65

76
func isMatch(s string, p string) bool {
87
m, n := len(s), len(p)

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

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Greedy #Two_Pointers
4-
// #Algorithm_II_Day_4_Two_Pointers #Big_O_Time_O(n)_Space_O(1)
4+
// #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers #Big_O_Time_O(n)_Space_O(1)
55
// #2024_03_07_Time_60_ms_(94.99%)_Space_8.3_MB_(24.10%)
66

77
func maxArea(height []int) int {

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

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Two_Pointers
44
// #Data_Structure_II_Day_1_Array #Algorithm_II_Day_3_Two_Pointers #Udemy_Two_Pointers
5-
// #Big_O_Time_O(n*log(n))_Space_O(n^2) #2024_03_07_Time_37_ms_(90.03%)_Space_7.9_MB_(46.68%)
5+
// #Top_Interview_150_Two_Pointers #Big_O_Time_O(n*log(n))_Space_O(n^2)
6+
// #2024_03_07_Time_37_ms_(90.03%)_Space_7.9_MB_(46.68%)
67

78
import "sort"
89

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

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Backtracking
44
// #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion
5-
// #Big_O_Time_O(4^n)_Space_O(n) #2024_03_07_Time_0_ms_(100.00%)_Space_2.1_MB_(87.39%)
5+
// #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n)
6+
// #2024_03_07_Time_0_ms_(100.00%)_Space_2.1_MB_(87.39%)
67

78
func letterCombinations(digits string) []string {
89
if len(digits) == 0 {

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

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
package s0019_remove_nth_node_from_end_of_list
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Two_Pointers #Linked_List
4-
// #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Big_O_Time_O(L)_Space_O(L)
5-
// #2024_03_07_Time_0_ms_(100.00%)_Space_2.2_MB_(19.66%)
4+
// #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Top_Interview_150_Linked_List
5+
// #Big_O_Time_O(L)_Space_O(L) #2024_03_07_Time_0_ms_(100.00%)_Space_2.2_MB_(19.66%)
66

77
type ListNode struct {
88
Val int

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

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
package s0020_valid_parentheses
22

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Stack
4-
// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Big_O_Time_O(n)_Space_O(n)
5-
// #2024_03_07_Time_1_ms_(74.95%)_Space_2_MB_(68.19%)
4+
// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Top_Interview_150_Stack
5+
// #Big_O_Time_O(n)_Space_O(n) #2024_03_07_Time_1_ms_(74.95%)_Space_2_MB_(68.19%)
66

77
func isValid(s string) bool {
88
stack := make([]rune, 0)

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

+2-2
Original file line numberDiff line numberDiff line change
@@ -2,8 +2,8 @@ package s0021_merge_two_sorted_lists
22

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion
44
// #Data_Structure_I_Day_7_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking
5-
// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(m+n)_Space_O(m+n)
6-
// #2024_03_07_Time_0_ms_(100.00%)_Space_2.5_MB_(95.02%)
5+
// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List
6+
// #Big_O_Time_O(m+n)_Space_O(m+n) #2024_03_07_Time_0_ms_(100.00%)_Space_2.5_MB_(95.02%)
77

88
type ListNode struct {
99
Val int

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

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming
44
// #Backtracking #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion
5-
// #Big_O_Time_O(2^n)_Space_O(n) #2024_03_08_Time_2_ms_(75.02%)_Space_2.8_MB_(72.29%)
5+
// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n)
6+
// #2024_03_08_Time_2_ms_(75.02%)_Space_2.8_MB_(72.29%)
67

78
func generateParenthesis(n int) []string {
89
result := []string{}

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

+4-4
Original file line numberDiff line numberDiff line change
@@ -1,10 +1,10 @@
11
package s0023_merge_k_sorted_lists
22

3-
import "container/heap"
4-
53
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Heap_Priority_Queue #Linked_List
6-
// #Divide_and_Conquer #Merge_Sort #Big_O_Time_O(k*n*log(k))_Space_O(log(k))
7-
// #2024_03_08_Time_3_ms_(96.74%)_Space_5.5_MB_(25.28%)
4+
// #Divide_and_Conquer #Merge_Sort #Top_Interview_150_Divide_and_Conquer
5+
// #Big_O_Time_O(k*n*log(k))_Space_O(log(k)) #2024_03_08_Time_3_ms_(96.74%)_Space_5.5_MB_(25.28%)
6+
7+
import "container/heap"
88

99
type ListNode struct {
1010
Val int

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

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

33
// #Hard #Top_100_Liked_Questions #Linked_List #Recursion #Data_Structure_II_Day_13_Linked_List
4-
// #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(k)
4+
// #Udemy_Linked_List #Top_Interview_150_Linked_List #Big_O_Time_O(n)_Space_O(k)
55
// #2024_03_08_Time_0_ms_(100.00%)_Space_3.6_MB_(72.87%)
66

77
type ListNode struct {

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

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search
44
// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_11 #Level_2_Day_8_Binary_Search
5-
// #Udemy_Binary_Search #Big_O_Time_O(log_n)_Space_O(1)
5+
// #Udemy_Binary_Search #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1)
66
// #2024_03_11_Time_0_ms_(100.00%)_Space_2.6_MB_(41.41%)
77

88
func search(nums []int, target int) int {

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

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
package s0034_find_first_and_last_position_of_element_in_sorted_array
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search
4-
// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Big_O_Time_O(log_n)_Space_O(1)
5-
// #2024_03_11_Time_3_ms_(93.06%)_Space_4.5_MB_(100.00%)
4+
// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Top_Interview_150_Binary_Search
5+
// #Big_O_Time_O(log_n)_Space_O(1) #2024_03_11_Time_3_ms_(93.06%)_Space_4.5_MB_(100.00%)
66

77
func searchRange(nums []int, target int) []int {
88
ans := make([]int, 2)

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

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

33
// #Easy #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_I_Day_1_Binary_Search
4-
// #Binary_Search_I_Day_2 #Big_O_Time_O(log_n)_Space_O(1)
4+
// #Binary_Search_I_Day_2 #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1)
55
// #2024_03_11_Time_0_ms_(100.00%)_Space_2.9_MB_(91.84%)
66

77
func searchInsert(nums []int, target int) int {

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

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

33
// #Medium #Top_100_Liked_Questions #Array #Backtracking #Algorithm_II_Day_10_Recursion_Backtracking
44
// #Level_2_Day_20_Brute_Force/Backtracking #Udemy_Backtracking/Recursion
5-
// #Big_O_Time_O(2^n)_Space_O(n+2^n) #2024_03_11_Time_0_ms_(100.00%)_Space_3_MB_(71.24%)
5+
// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n+2^n)
6+
// #2024_03_11_Time_0_ms_(100.00%)_Space_3_MB_(71.24%)
67

78
func combinationSum(coins []int, amount int) [][]int {
89
var ans [][]int

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

+8-7
Original file line numberDiff line numberDiff line change
@@ -2,24 +2,25 @@ package s0042_trapping_rain_water
22

33
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming #Two_Pointers
44
// #Stack #Monotonic_Stack #Dynamic_Programming_I_Day_9 #Udemy_Two_Pointers
5-
// #Big_O_Time_O(n)_Space_O(1) #2024_03_12_Time_3_ms_(99.42%)_Space_5.4_MB_(97.01%)
5+
// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
6+
// #2024_03_12_Time_3_ms_(99.42%)_Space_5.4_MB_(97.01%)
67

78
func trap(height []int) int {
89
if height == nil {
910
return 0
1011
}
1112
l, r := 0, len(height)-1
12-
max_left, max_right := height[l], height[r]
13+
maxLeft, maxRight := height[l], height[r]
1314
res := 0
1415
for l < r {
15-
if max_left < max_right {
16+
if maxLeft < maxRight {
1617
l++
17-
max_left = max(max_left, height[l])
18-
res += max_left - height[l]
18+
maxLeft = max(maxLeft, height[l])
19+
res += maxLeft - height[l]
1920
} else {
2021
r--
21-
max_right = max(max_right, height[r])
22-
res += max_right - height[r]
22+
maxRight = max(maxRight, height[r])
23+
res += maxRight - height[r]
2324
}
2425
}
2526
return res

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

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

33
// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Greedy
44
// #Algorithm_II_Day_13_Dynamic_Programming #Dynamic_Programming_I_Day_4
5-
// #Big_O_Time_O(n)_Space_O(1) #2024_03_12_Time_6_ms_(96.98%)_Space_6.3_MB_(34.53%)
5+
// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
6+
// #2024_03_12_Time_6_ms_(96.98%)_Space_6.3_MB_(34.53%)
67

78
func jump(nums []int) int {
89
length := 0

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

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Backtracking
44
// #Algorithm_I_Day_11_Recursion_Backtracking #Level_2_Day_20_Brute_Force/Backtracking
5-
// #Udemy_Backtracking/Recursion #Big_O_Time_O(n*n!)_Space_O(n+n!)
5+
// #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(n*n!)_Space_O(n+n!)
66
// #2024_03_12_Time_0_ms_(100.00%)_Space_2.7_MB_(51.79%)
77

88
func permute(nums []int) [][]int {

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

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Math #Matrix
44
// #Data_Structure_II_Day_3_Array #Programming_Skills_II_Day_7 #Udemy_2D_Arrays/Matrix
5-
// #Big_O_Time_O(n^2)_Space_O(1) #2024_03_12_Time_0_ms_(100.00%)_Space_2.3_MB_(75.46%)
5+
// #Top_Interview_150_Matrix #Big_O_Time_O(n^2)_Space_O(1)
6+
// #2024_03_12_Time_0_ms_(100.00%)_Space_2.3_MB_(75.46%)
67

78
func rotate(matrix [][]int) {
89
n := len(matrix)

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

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

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
5-
// #Big_O_Time_O(n*k_log_k)_Space_O(n) #2024_03_13_Time_16_ms_(85.07%)_Space_7.2_MB_(85.47%)
5+
// #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%)
67

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

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

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
package s0053_maximum_subarray
22

3-
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
3+
// #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
5-
// #Udemy_Famous_Algorithm #Big_O_Time_O(n)_Space_O(1)
5+
// #Udemy_Famous_Algorithm #Top_Interview_150_Kadane's_Algorithm #Big_O_Time_O(n)_Space_O(1)
66
// #2024_03_13_Time_79_ms_(87.63%)_Space_7.8_MB_(92.56%)
77

88
func maxSubArray(nums []int) int {

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

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

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
5-
// #Big_O_Time_O(n)_Space_O(1) #2024_03_13_Time_48_ms_(71.95%)_Space_6.7_MB_(99.94%)
5+
// #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%)
67

78
func canJump(nums []int) bool {
89
if len(nums) == 1 {

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

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

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
5-
// #Big_O_Time_O(n_log_n)_Space_O(n) #2024_03_13_Time_12_ms_(90.65%)_Space_6.3_MB_(74.98%)
5+
// #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%)
67

78
import "sort"
89

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

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

33
// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Matrix
4-
// #Dynamic_Programming_I_Day_16 #Udemy_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(m*n)
5-
// #2024_03_14_Time_0_ms_(100.00%)_Space_4.1_MB_(24.44%)
4+
// #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%)
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

+2-2
Original file line numberDiff line numberDiff line change
@@ -2,8 +2,8 @@ package s0070_climbing_stairs
22

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
5-
// #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming #Big_O_Time_O(n)_Space_O(n)
6-
// #2024_03_14_Time_0_ms_(100.00%)_Space_2_MB_(50.58%)
5+
// #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%)
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,8 +1,8 @@
11
package s0072_edit_distance
22

3-
// #Hard #Top_100_Liked_Questions #String #Dynamic_Programming
3+
// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming
44
// #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_19
5-
// #Udemy_Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n2)
5+
// #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(n^2)_Space_O(n2)
66
// #2024_03_14_Time_0_ms_(100.00%)_Space_2.6_MB_(97.61%)
77

88
func minDistance(word1 string, word2 string) int {

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

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Matrix
4-
// #Udemy_2D_Arrays/Matrix #Big_O_Time_O(m*n)_Space_O(1)
4+
// #Udemy_2D_Arrays/Matrix #Top_Interview_150_Matrix #Big_O_Time_O(m*n)_Space_O(1)
55
// #2024_03_14_Time_8_ms_(83.64%)_Space_5.9_MB_(75.58%)
66

77
func setZeroes(matrix [][]int) {

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

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

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
5-
// #Udemy_2D_Arrays/Matrix #Big_O_Time_O(endRow+endCol)_Space_O(1)
5+
// #Udemy_2D_Arrays/Matrix #Top_Interview_150_Binary_Search #Big_O_Time_O(endRow+endCol)_Space_O(1)
66
// #2024_03_15_Time_0_ms_(100.00%)_Space_2.6_MB_(75.18%)
77

88
func searchMatrix(matrix [][]int, target int) bool {

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

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

33
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window
4-
// #Level_2_Day_14_Sliding_Window/Two_Pointer #Big_O_Time_O(s.length())_Space_O(1)
5-
// #2024_03_15_Time_0_ms_(100.00%)_Space_3_MB_(66.67%)
4+
// #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%)
66

77
import "math"
88

0 commit comments

Comments
 (0)