Improved racket

Author: javadev

src/main/racket/g0001_0100/s0001_two_sum/readme.md

@@ -43,10 +43,6 @@ You can return the answer in any order.
 ## Solution
 
 ```racket
-; #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table
-; #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Big_O_Time_O(n)_Space_O(n)
-; #AI_can_be_used_to_solve_the_task #2025_01_28_Time_0_(100.00%)_Space_102.07_(45.83%)
-
 (define (two-sum-iter nums target hash index)
   (cond
     ((null? nums) '())

src/main/racket/g0001_0100/s0002_add_two_numbers/readme.md

@@ -40,11 +40,6 @@ You may assume the two numbers do not contain any leading zero, except the numbe
 ## Solution
 
 ```racket
-; #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Math #Linked_List #Recursion
-; #Data_Structure_II_Day_10_Linked_List #Programming_Skills_II_Day_15
-; #Big_O_Time_O(max(N,M))_Space_O(max(N,M)) #AI_can_be_used_to_solve_the_task
-; #2025_01_28_Time_0_(100.00%)_Space_128.42_(12.50%)
-
 ; Definition for singly-linked list:
 #|
 

src/main/racket/g0001_0100/s0003_longest_substring_without_repeating_characters/readme.md

@@ -45,11 +45,6 @@ Given a string `s`, find the length of the **longest substring** without repeati
 ## Solution
 
 ```racket
-; #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window
-; #Algorithm_I_Day_6_Sliding_Window #Level_2_Day_14_Sliding_Window/Two_Pointer #Udemy_Strings
-; #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task
-; #2025_01_28_Time_134_(75.00%)_Space_132.36_(100.00%)
-
 ; Helper function to get the sublist up to 'v' excluded.
 (define (take-till q v)
   (define (take-till/helper q v acc)

src/main/racket/g0001_0100/s0004_median_of_two_sorted_arrays/readme.md

@@ -55,10 +55,6 @@ The overall run time complexity should be `O(log (m+n))`.
 ## Solution
 
 ```racket
-; #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Divide_and_Conquer
-; #Big_O_Time_O(log(min(N,M)))_Space_O(1) #AI_can_be_used_to_solve_the_task
-; #2025_01_28_Time_0_(100.00%)_Space_128.57_(100.00%)
-
 (define/contract (find-median-sorted-arrays nums1 nums2)
   (-> (listof exact-integer?) (listof exact-integer?) flonum?)
   

src/main/racket/g0001_0100/s0005_longest_palindromic_substring/readme.md

@@ -39,11 +39,6 @@ Given a string `s`, return _the longest palindromic substring_ in `s`.
 ## Solution
 
 ```racket
-; #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming
-; #Data_Structure_II_Day_9_String #Algorithm_II_Day_14_Dynamic_Programming
-; #Dynamic_Programming_I_Day_17 #Udemy_Strings #Big_O_Time_O(n)_Space_O(n)
-; #2025_01_28_Time_10_(50.00%)_Space_102.35_(50.00%)
-
 (define (longest-palindrome s)
   (define (expand-around-center s left right)
     (let loop ([l left] [r right])

src/main/racket/g0001_0100/s0006_zigzag_conversion/readme.md

@@ -44,9 +44,6 @@ string convert(string s, int numRows);
 ## Solution
 
 ```racket
-; #Medium #String #Top_Interview_150_Array/String
-; #2025_02_03_Time_57_(100.00%)_Space_130.82_(60.00%)
-
 (define/contract (convert s numRows)
   (-> string? exact-integer? string?)
   (let* ((sLen (string-length s))

src/main/racket/g0001_0100/s0007_reverse_integer/readme.md

@@ -40,9 +40,6 @@ Given a signed 32-bit integer `x`, return `x` _with its digits reversed_. If rev
 ## Solution
 
 ```racket
-; #Medium #Top_Interview_Questions #Math #Udemy_Integers
-; #2025_02_03_Time_204_(100.00%)_Space_101.45_(100.00%)
-
 (define/contract (reverse x)
   (-> exact-integer? exact-integer?)
   (let loop ((x x) (rev 0))

src/main/racket/g0001_0100/s0008_string_to_integer_atoi/readme.md

@@ -118,8 +118,6 @@ Since -91283472332 is less than the lower bound of the range [-2<sup>31</sup>, 2
 ## Solution
 
 ```racket
-; #Medium #Top_Interview_Questions #String #2025_02_03_Time_3_(100.00%)_Space_101.64_(100.00%)
-
 (define/contract (my-atoi s)
   (-> string? exact-integer?)
   (let* ((trimmed (string-trim s))

src/main/racket/g0001_0100/s0009_palindrome_number/readme.md

@@ -46,9 +46,6 @@ An integer is a **palindrome** when it reads the same backward as forward. For e
 ## Solution
 
 ```racket
-; #Easy #Math #Udemy_Integers #Top_Interview_150_Math
-; #2025_02_03_Time_8_(100.00%)_Space_129.01_(88.24%)
-
 (define/contract (is-palindrome x)
   (-> exact-integer? boolean?)
   (if (< x 0)

src/main/racket/g0001_0100/s0010_regular_expression_matching/readme.md

@@ -61,9 +61,6 @@ The matching should cover the **entire** input string (not partial).
 ## Solution
 
 ```racket
-; #Hard #Top_Interview_Questions #String #Dynamic_Programming #Recursion #Udemy_Dynamic_Programming
-; #Big_O_Time_O(m*n)_Space_O(m*n) #2025_02_03_Time_11_(100.00%)_Space_101.36_(100.00%)
-
 (define (regex-state s is-star)
   (list s (if is-star '* '1)))