Skip to content

Commit e213fa5

Browse files
javadevjavadev
committed
Improved racket
1 parent 0233451 commit e213fa5

File tree

85 files changed

+666
-65
lines changed

Some content is hidden

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

85 files changed

+666
-65
lines changed

‎src/main/racket/g0001_0100/s0001_two_sum/Solution.rkt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
; #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table
22
; #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Top_Interview_150_Hashmap
33
; #Big_O_Time_O(n)_Space_O(n) #AI_can_be_used_to_solve_the_task
4-
; #2025_02_05_Time_0_(100.00%)_Space_102.04_(40.82%)
4+
; #2025_02_05_Time_0_ms_(100.00%)_Space_102.04_MB_(40.82%)
55

66
(define (two-sum-iter nums target hash index)
77
(cond

‎src/main/racket/g0001_0100/s0002_add_two_numbers/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 #Top_Interview_Questions #Math #Linked_List #Recursion
22
; #Data_Structure_II_Day_10_Linked_List #Programming_Skills_II_Day_15
33
; #Top_Interview_150_Linked_List #Big_O_Time_O(max(N,M))_Space_O(max(N,M))
4-
; #AI_can_be_used_to_solve_the_task #2025_02_05_Time_0_(100.00%)_Space_128.08_(72.73%)
4+
; #AI_can_be_used_to_solve_the_task #2025_02_05_Time_0_ms_(100.00%)_Space_128.08_MB_(72.73%)
55

66
; Definition for singly-linked list:
77
#|

‎src/main/racket/g0001_0100/s0003_longest_substring_without_repeating_characters/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 #Top_Interview_Questions #String #Hash_Table #Sliding_Window
22
; #Algorithm_I_Day_6_Sliding_Window #Level_2_Day_14_Sliding_Window/Two_Pointer #Udemy_Strings
33
; #Top_Interview_150_Sliding_Window #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task
4-
; #2025_02_06_Time_119_(71.43%)_Space_131.37_(28.57%)
4+
; #2025_02_06_Time_119_ms_(71.43%)_Space_131.37_MB_(28.57%)
55

66
; Helper function to get the sublist up to 'v' excluded.
77
(define (take-till q v)

‎src/main/racket/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.rkt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
; #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Divide_and_Conquer
22
; #Top_Interview_150_Binary_Search #Big_O_Time_O(log(min(N,M)))_Space_O(1)
3-
; #AI_can_be_used_to_solve_the_task #2025_02_06_Time_0_(100.00%)_Space_128.80_(25.00%)
3+
; #AI_can_be_used_to_solve_the_task #2025_02_06_Time_0_ms_(100.00%)_Space_128.80_MB_(25.00%)
44

55
(define/contract (find-median-sorted-arrays nums1 nums2)
66
(-> (listof exact-integer?) (listof exact-integer?) flonum?)

‎src/main/racket/g0001_0100/s0005_longest_palindromic_substring/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 #Top_Interview_Questions #String #Dynamic_Programming
22
; #Data_Structure_II_Day_9_String #Algorithm_II_Day_14_Dynamic_Programming
33
; #Dynamic_Programming_I_Day_17 #Udemy_Strings #Top_Interview_150_Multidimensional_DP
4-
; #Big_O_Time_O(n)_Space_O(n) #2025_02_06_Time_4_(100.00%)_Space_101.40_(85.71%)
4+
; #Big_O_Time_O(n)_Space_O(n) #2025_02_06_Time_4_ms_(100.00%)_Space_101.40_MB_(85.71%)
55

66
(define (longest-palindrome s)
77
(define (expand-around-center s left right)

‎src/main/racket/g0001_0100/s0006_zigzag_conversion/Solution.rkt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
; #Medium #String #Top_Interview_150_Array/String
2-
; #2025_02_03_Time_57_(100.00%)_Space_130.82_(60.00%)
2+
; #2025_02_03_Time_57_ms_(100.00%)_Space_130.82_MB_(60.00%)
33

44
(define/contract (convert s numRows)
55
(-> string? exact-integer? string?)

‎src/main/racket/g0001_0100/s0007_reverse_integer/Solution.rkt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
; #Medium #Top_Interview_Questions #Math #Udemy_Integers
2-
; #2025_02_03_Time_204_(100.00%)_Space_101.45_(100.00%)
2+
; #2025_02_03_Time_204_ms_(100.00%)_Space_101.45_MB_(100.00%)
33

44
(define/contract (reverse x)
55
(-> exact-integer? exact-integer?)

‎src/main/racket/g0001_0100/s0008_string_to_integer_atoi/Solution.rkt

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,5 @@
1-
; #Medium #Top_Interview_Questions #String #2025_02_03_Time_3_(100.00%)_Space_101.64_(100.00%)
1+
; #Medium #Top_Interview_Questions #String
2+
; #2025_02_03_Time_3_ms_(100.00%)_Space_101.64_MB_(100.00%)
23

34
(define/contract (my-atoi s)
45
(-> string? exact-integer?)

‎src/main/racket/g0001_0100/s0009_palindrome_number/Solution.rkt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
; #Easy #Math #Udemy_Integers #Top_Interview_150_Math
2-
; #2025_02_03_Time_8_(100.00%)_Space_129.01_(88.24%)
2+
; #2025_02_03_Time_8_ms_(100.00%)_Space_129.01_MB_(88.24%)
33

44
(define/contract (is-palindrome x)
55
(-> exact-integer? boolean?)

‎src/main/racket/g0001_0100/s0010_regular_expression_matching/Solution.rkt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
; #Hard #Top_Interview_Questions #String #Dynamic_Programming #Recursion #Udemy_Dynamic_Programming
2-
; #Big_O_Time_O(m*n)_Space_O(m*n) #2025_02_03_Time_11_(100.00%)_Space_101.36_(100.00%)
2+
; #Big_O_Time_O(m*n)_Space_O(m*n) #2025_02_03_Time_11_ms_(100.00%)_Space_101.36_MB_(100.00%)
33

44
(define (regex-state s is-star)
55
(list s (if is-star '* '1)))

0 commit comments

Comments
 (0)