File tree Expand file tree Collapse file tree 10 files changed +13
-11
lines changed
src/main/racket/g0201_0300
s0208_implement_trie_prefix_tree
s0215_kth_largest_element_in_an_array
s0230_kth_smallest_element_in_a_bst
s0234_palindrome_linked_list
s0238_product_of_array_except_self
s0287_find_the_duplicate_number
s0300_longest_increasing_subsequence Expand file tree Collapse file tree 10 files changed +13
-11
lines changed Original file line number Diff line number Diff line change 1
1
; #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search
2
2
; #Breadth_First_Search #Graph #Topological_Sort #Top_Interview_150_Graph_General
3
- ; #Big_O_Time_O(N)_Space_O(N) #2025_02_10_Time_4_ (100.00%)_Space_101.62_ (100.00%)
3
+ ; #Big_O_Time_O(N)_Space_O(N) #2025_02_10_Time_4_ms_ (100.00%)_Space_101.62_MB_ (100.00%)
4
4
5
5
(define (can-finish num-courses prereqs)
6
6
(let ([adj (make-hash)]
Original file line number Diff line number Diff line change 1
1
; #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Design #Trie
2
2
; #Level_2_Day_16_Design #Udemy_Trie_and_Heap #Top_Interview_150_Trie
3
3
; #Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N)
4
- ; #2025_02_10_Time_102_ (100.00%)_Space_134.45_ (100.00%)
4
+ ; #2025_02_10_Time_102_ms_ (100.00%)_Space_134.45_MB_ (100.00%)
5
5
6
6
(define trie%
7
7
(class object%
Original file line number Diff line number Diff line change 1
1
; #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Heap_Priority_Queue
2
2
; #Divide_and_Conquer #Quickselect #Data_Structure_II_Day_20_Heap_Priority_Queue
3
3
; #Top_Interview_150_Heap #Big_O_Time_O(n*log(n))_Space_O(log(n))
4
- ; #2025_02_10_Time_79_ (100.00%)_Space_135.10_ (100.00%)
4
+ ; #2025_02_10_Time_79_ms_ (100.00%)_Space_135.10_MB_ (100.00%)
5
5
6
6
(define/contract (find-kth-largest nums k)
7
7
(-> (listof exact-integer?) exact-integer? exact-integer?)
Original file line number Diff line number Diff line change 1
1
; #Medium #Array #Dynamic_Programming #Matrix #Dynamic_Programming_I_Day_16
2
2
; #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(m*n)_Space_O(m*n)
3
- ; #2025_02_10_Time_426_ (100.00%)_Space_130.80_ (100.00%)
3
+ ; #2025_02_10_Time_426_ms_ (100.00%)_Space_130.80_MB_ (100.00%)
4
4
5
5
(define/contract (maximal-square matrix)
6
6
(-> (listof (listof char?)) exact-integer?)
Original file line number Diff line number Diff line change 1
- ; #Easy #Depth_First_Search #Tree #Binary_Search #Binary_Tree #Binary_Search_II_Day_10
2
- ; #Top_Interview_150_Binary_Tree_General #2025_02_10_Time_0_(100.00%)_Space_129.49_(100.00%)
1
+ ; #Easy #Top_100_Liked_Questions #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
2
+ ; #Data_Structure_I_Day_12_Tree #Level_2_Day_6_Tree #Udemy_Tree_Stack_Queue
3
+ ; #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n)
4
+ ; #2025_02_10_Time_0_ms_(100.00%)_Space_129.49_MB_(100.00%)
3
5
4
6
; Definition for a binary tree node.
5
7
#|
Original file line number Diff line number Diff line change 1
1
; #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Binary_Search_Tree
2
2
; #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree
3
3
; #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(n)_Space_O(n)
4
- ; #2025_02_10_Time_27_ (100.00%)_Space_130.16_ (100.00%)
4
+ ; #2025_02_10_Time_27_ms_ (100.00%)_Space_130.16_MB_ (100.00%)
5
5
6
6
; Definition for a binary tree node.
7
7
#|
Original file line number Diff line number Diff line change 1
1
; #Easy #Top_100_Liked_Questions #Two_Pointers #Stack #Linked_List #Recursion
2
2
; #Level_2_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(1)
3
- ; #2025_02_10_Time_69_ (100.00%)_Space_130.91_ (100.00%)
3
+ ; #2025_02_10_Time_69_ms_ (100.00%)_Space_130.91_MB_ (100.00%)
4
4
5
5
; Definition for singly-linked list:
6
6
#|
Original file line number Diff line number Diff line change 1
1
; #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #Data_Structure_II_Day_5_Array #Udemy_Arrays
2
2
; #Top_Interview_150_Array/String #Big_O_Time_O(n^2)_Space_O(n)
3
- ; #2025_02_10_Time_10_ (100.00%)_Space_132.25_ (100.00%)
3
+ ; #2025_02_10_Time_10_ms_ (100.00%)_Space_132.25_MB_ (100.00%)
4
4
5
5
(define/contract (product-except-self nums)
6
6
(-> (listof exact-integer?) (listof exact-integer?))
Original file line number Diff line number Diff line change 1
1
; #Medium #Top_100_Liked_Questions #Array #Binary_Search #Two_Pointers #Bit_Manipulation
2
2
; #Binary_Search_II_Day_5 #Big_O_Time_O(n)_Space_O(n)
3
- ; #2025_02_10_Time_327_ (100.00%)_Space_132.76_ (100.00%)
3
+ ; #2025_02_10_Time_327_ms_ (100.00%)_Space_132.76_MB_ (100.00%)
4
4
5
5
(require racket/hash)
6
6
Original file line number Diff line number Diff line change 1
1
; #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Binary_Search
2
2
; #Algorithm_II_Day_16_Dynamic_Programming #Binary_Search_II_Day_3 #Dynamic_Programming_I_Day_18
3
3
; #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(n*log_n)_Space_O(n)
4
- ; #2025_02_10_Time_3_ (100.00%)_Space_101.78_ (100.00%)
4
+ ; #2025_02_10_Time_3_ms_ (100.00%)_Space_101.78_MB_ (100.00%)
5
5
6
6
(require racket/list)
7
7
You can’t perform that action at this time.
0 commit comments