Improved tasks

Author: javadev

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

@@ -44,8 +44,6 @@ You can return the answer in any order.
 
 ```erlang
 % #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_05_Time_3_(97.50%)_Space_65.32_(7.50%)
 
 -spec two_sum(Nums :: [integer()], Target :: integer()) -> [integer()].
 two_sum(Nums, Target) ->

src/main/erlang/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
 
 ```erlang
-% #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_05_Time_1_(77.78%)_Space_63.11_(100.00%)
-
 %% Definition for singly-linked list.
 %%
 %% -record(list_node, {val = 0 :: integer(),

src/main/erlang/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
 
 ```erlang
-% #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_08_Time_11_(100.00%)_Space_61.60_(60.00%)
-
 -spec length_of_longest_substring(S :: unicode:unicode_binary()) -> integer().
 length_of_longest_substring(S) ->
     do(S, 0, #{}, 0, 1).

src/main/erlang/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
 
 ```erlang
-% #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_08_Time_1_(100.00%)_Space_65.96_(100.00%)
-
 -spec find_median_sorted_arrays(Nums1 :: [integer()], Nums2 :: [integer()]) -> float().
 find_median_sorted_arrays(Nums1, Nums2) -> 
     Len = length(Nums1) + length(Nums2),

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

@@ -39,11 +39,6 @@ Given a string `s`, return _the longest palindromic substring_ in `s`.
 ## Solution
 
 ```erlang
-% #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_08_Time_179_(100.00%)_Space_59.84_(100.00%)
-
 -spec longest_palindrome(S :: unicode:unicode_binary()) -> unicode:unicode_binary().
 longest_palindrome(S) ->
     Length = byte_size(S),

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

@@ -44,8 +44,6 @@ string convert(string s, int numRows);
 ## Solution
 
 ```erlang
-% #Medium #String #2025_01_08_Time_203_(100.00%)_Space_60.52_(100.00%)
-
 %% Define the function specification
 -spec convert(S :: unicode:unicode_binary(), NumRows :: integer()) -> unicode:unicode_binary().
 convert(S, NumRows) ->

src/main/erlang/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
 
 ```erlang
-% #Medium #Top_Interview_Questions #Math #Udemy_Integers
-% #2025_01_08_Time_244_(100.00%)_Space_58.56_(100.00%)
-
 -spec reverse(X :: integer()) -> integer().
 reverse(X) -> reverse(X, 0).
 reverse(0, Work) ->

src/main/erlang/g0501_0600/s0560_subarray_sum_equals_k/readme.md

@@ -30,9 +30,6 @@ A subarray is a contiguous **non-empty** sequence of elements within an array.
 ## Solution
 
 ```erlang
-% #Medium #Top_100_Liked_Questions #Array #Hash_Table #Prefix_Sum #Data_Structure_II_Day_5_Array
-% #Big_O_Time_O(n)_Space_O(n) #2025_01_08_Time_47_(100.00%)_Space_79.35_(_%)
-
 -spec subarray_sum(Nums :: [integer()], K :: integer()) -> integer().
 subarray_sum(Nums, K) ->
     subarray_sum(Nums, K, 0, 0, #{0 => 1}).