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

Lines changed: 2 additions & 2 deletions
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

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

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

Lines changed: 2 additions & 1 deletion
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

Lines changed: 2 additions & 1 deletion
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

Lines changed: 2 additions & 1 deletion
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

Lines changed: 2 additions & 1 deletion
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

Lines changed: 2 additions & 2 deletions
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

Lines changed: 2 additions & 1 deletion
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

Lines changed: 2 additions & 1 deletion
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

Lines changed: 2 additions & 3 deletions
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)

0 commit comments

Comments
 (0)