8000 Improved tags · jscrdev/LeetCode-in-Racket@8cedc8c · GitHub
[go: up one dir, main page]
Skip to content

Commit 8cedc8c

Browse files
javadevjavadev
authored
Improved tags
1 parent 1d3dae6 commit 8cedc8c

File tree

10 files changed

+12
-11
lines changed

10 files changed

+12
-11
lines changed

‎src/main/racket/g0301_0400/s0322_coin_change/Solution.rkt

Lines changed: 1 addition & 1 8000 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
; #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Breadth_First_Search
22
; #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_20
33
; #Level_2_Day_12_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(m*n)_Space_O(amount)
4-
; #2025_02_11_Time_29_(100.00%)_Space_101.98_(100.00%)
4+
; #2025_02_11_Time_29_ms_(100.00%)_Space_101.98_MB_(100.00%)
55

66
(define/contract (coin-change coins amount)
77
(-> (listof exact-integer?) exact-integer? exact-integer?)

‎src/main/racket/g0301_0400/s0338_counting_bits/Solution.rkt

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
1-
// #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation
2-
// #Big_O_Time_O(num)_Space_O(num) #2025_02_11_Time_3_(100.00%)_Space_135.21_(100.00%)
1+
; #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation
2+
; #Big_O_Time_O(num)_Space_O(num) #2025_02_11_Time_3_ms_(100.00%)_Space_135.21_MB_(100.00%)
33

44
(define (near-bit n i)
55
(if (and (<= i n) (< n (* i 2)))

‎src/main/racket/g0301_0400/s0347_top_k_frequent_elements/Solution.rkt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
; #Medium #Top_100_Liked_Questions #Array #Hash_Table #Sorting #Heap_Priority_Queue #Counting
22
; #Divide_and_Conquer #Quickselect #Bucket_Sort #Data_Structure_II_Day_20_Heap_Priority_Queue
3-
; #Big_O_Time_O(n*log(n))_Space_O(k) #2025_02_11_Time_3_(100.00%)_Space_103.26_(100.00%)
3+
; #Big_O_Time_O(n*log(n))_Space_O(k) #2025_02_11_Time_3_ms_(100.00%)_Space_103.26_MB_(100.00%)
44

55
(define (hash-table-counter ls)
66
(let ([counts (make-hash)])

‎src/main/racket/g0301_0400/s0394_decode_string/Solution.rkt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
; #Medium #Top_100_Liked_Questions #String #Stack #Recursion #Level_1_Day_14_Stack #Udemy_Strings
2-
; #Big_O_Time_O(n)_Space_O(n) #2025_02_11_Time_0_(100.00%)_Space_101.43_(100.00%)
2+
; #Big_O_Time_O(n)_Space_O(n) #2025_02_11_Time_0_ms_(100.00%)_Space_101.43_MB_(100.00%)
33

44
(define/contract (decode-string s)
55
(-> string? string?)

‎src/main/racket/g0401_0500/s0416_partition_equal_subset_sum/Solution.rkt

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,6 @@
11
; #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Level_2_Day_13_Dynamic_Programming
2-
; #Big_O_Time_O(n*sums)_Space_O(n*sums) #2025_02_11_Time_1098_(100.00%)_Space_132.26_(100.00%)
2+
; #Big_O_Time_O(n*sums)_Space_O(n*sums)
3+
; #2025_02_11_Time_1098_ms_(100.00%)_Space_132.26_MB_(100.00%)
34

45
(define/contract (can-partition nums)
56
(-> (listof exact-integer?) boolean?)

‎src/main/racket/g0401_0500/s0437_path_sum_iii/Solution.rkt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
; #Medium #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree #Big_O_Time_O(n)_Space_O(n)
2-
; #2025_02_11_Time_107_(100.00%)_Space_136.84_(100.00%)
2+
; #2025_02_11_Time_107_ms_(100.00%)_Space_136.84_MB_(100.00%)
33

44
; Definition for a binary tree node.
55
#|

‎src/main/racket/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.rkt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
; #Medium #Top_100_Liked_Questions #String #Hash_Table #Sliding_Window
22
; #Algorithm_II_Day_5_Sliding_Window #Programming_Skills_II_Day_12
33
; #Level_1_Day_12_Sliding_Window/Two_Pointer #Big_O_Time_O(n+m)_Space_O(1)
4-
; #2025_02_11_Time_57_(100.00%)_Space_131.96_(100.00%)
4+
; #2025_02_11_Time_57_ms_(100.00%)_Space_131.96_MB_(100.00%)
55

66
(define/contract (find-anagrams s p)
77
(-> string? string? (listof exact-integer?))

‎src/main/racket/g0401_0500/s0494_target_sum/Solution.rkt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
; #Medium #Array #Dynamic_Programming #Backtracking #Big_O_Time_O(n*(sum+s))_Space_O(n*(sum+s))
2-
; #2025_02_11_Time_1_(100.00%)_Space_101.46_(100.00%)
2+
; #2025_02_11_Time_1_ms_(100.00%)_Space_101.46_MB_(100.00%)
33

44
(define/contract (find-target-sum-ways nums target)
55
(-> (listof exact-integer?) exact-integer? exact-integer?)

‎src/main/racket/g0501_0600/s0543_diameter_of_binary_tree/Solution.rkt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
; #Easy #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree
22
; #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n)
3-
; #2025_02_11_Time_0_(100.00%)_Space_102.61_(100.00%)
3+
; #2025_02_11_Time_0_ms_(100.00%)_Space_102.61_MB_(100.00%)
44

55
; Definition for a binary tree node.
66
#|

‎src/main/racket/g0501_0600/s0560_subarray_sum_equals_k/Solution.rkt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
; #Medium #Top_100_Liked_Questions #Array #Hash_Table #Prefix_Sum #Data_Structure_II_Day_5_Array
2-
; #Big_O_Time_O(n)_Space_O(n) #2025_02_11_Time_56_(100.00%)_Space_131.71_(_%)
2+
; #Big_O_Time_O(n)_Space_O(n) #2025_02_11_Time_56_ms_(100.00%)_Space_131.71_MB_(_%)
33

44
(define/contract (subarray-sum nums k)
55
(-> (listof exact-integer?) exact-integer? exact-integer?)

0 commit comments

Comments
 (0)
0