Improved tasks 977-2130

javadev · web-flow · commit abe461b81cc6 · 2023-10-02T08:10:34.000+03:00
diff --git a/README.md b/README.md
@@ -63,7 +63,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.17'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0977 |[Squares of a Sorted Array](src/main/kotlin/g0901_1000/s0977_squares_of_a_sorted_array/Solution.kt)| Easy | Array, Sorting, Two_Pointers | 375 | 18.43
+| 0977 |[Squares of a Sorted Array](src/main/kotlin/g0901_1000/s0977_squares_of_a_sorted_array/Solution.kt)| Easy | Array, Sorting, Two_Pointers | 271 | 77.17
 | 0189 |[Rotate Array](src/main/kotlin/g0101_0200/s0189_rotate_array/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 483 | 86.95
 
 #### Day 3 Two Pointers
@@ -382,7 +382,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.17'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 1855 |[Maximum Distance Between a Pair of Values](src/main/kotlin/g1801_1900/s1855_maximum_distance_between_a_pair_of_values/Solution.kt)| Medium | Array, Greedy, Binary_Search, Two_Pointers | 541 | 14.29
+| 1855 |[Maximum Distance Between a Pair of Values](src/main/kotlin/g1801_1900/s1855_maximum_distance_between_a_pair_of_values/Solution.kt)| Medium | Array, Greedy, Binary_Search, Two_Pointers | 458 | 100.00
 | 0033 |[Search in Rotated Sorted Array](src/main/kotlin/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 151 | 93.77
 
 #### Day 12
@@ -502,7 +502,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.17'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0981 |[Time Based Key-Value Store](src/main/kotlin/g0901_1000/s0981_time_based_key_value_store/TimeMap.kt)| Medium | String, Hash_Table, Binary_Search, Design | 1555 | 10.00
+| 0981 |[Time Based Key-Value Store](src/main/kotlin/g0901_1000/s0981_time_based_key_value_store/TimeMap.kt)| Medium | String, Hash_Table, Binary_Search, Design | 1011 | 65.56
 | 1300 |[Sum of Mutated Array Closest to Target](src/main/kotlin/g1201_1300/s1300_sum_of_mutated_array_closest_to_target/Solution.kt)| Medium | Array, Sorting, Binary_Search | 217 | 100.00
 
 #### Day 17
@@ -994,7 +994,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.17'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 1129 |[Shortest Path with Alternating Colors](src/main/kotlin/g1101_1200/s1129_shortest_path_with_alternating_colors/Solution.kt)| Medium | Breadth_First_Search, Graph | 241 | 16.67
+| 1129 |[Shortest Path with Alternating Colors](src/main/kotlin/g1101_1200/s1129_shortest_path_with_alternating_colors/Solution.kt)| Medium | Breadth_First_Search, Graph | 208 | 80.00
 | 1466 |[Reorder Routes to Make All Paths Lead to the City Zero](src/main/kotlin/g1401_1500/s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero/Solution.kt)| Medium | Depth_First_Search, Breadth_First_Search, Graph | 718 | 100.00
 | 0847 |[Shortest Path Visiting All Nodes](src/main/kotlin/g0801_0900/s0847_shortest_path_visiting_all_nodes/Solution.kt)| Hard | Dynamic_Programming, Breadth_First_Search, Bit_Manipulation, Graph, Bitmask | 164 | 100.00
 
@@ -1102,7 +1102,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.17'
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 1393 |[Capital Gain/Loss](src/main/kotlin/g1301_1400/s1393_capital_gainloss/script.sql)| Medium | LeetCode_Curated_SQL_70, Database | 990 | 47.36
-| 1407 |[Top Travellers](src/main/kotlin/g1401_1500/s1407_top_travellers/script.sql)| Easy | LeetCode_Curated_SQL_70, Database | 2035 | 14.53
+| 1407 |[Top Travellers](src/main/kotlin/g1401_1500/s1407_top_travellers/script.sql)| Easy | LeetCode_Curated_SQL_70, Database | 1394 | 98.43
 | 1158 |[Market Analysis I](src/main/kotlin/g1101_1200/s1158_market_analysis_i/script.sql)| Medium | Database | 2470 | 44.76
 
 #### Day 10 Where
@@ -1440,7 +1440,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.17'
 |-|-|-|-|-|-
 | 0392 |[Is Subsequence](src/main/kotlin/g0301_0400/s0392_is_subsequence/Solution.kt)| Easy | String, Dynamic_Programming, Two_Pointers | 156 | 87.74
 | 0125 |[Valid Palindrome](src/main/kotlin/g0101_0200/s0125_valid_palindrome/Solution.kt)| Easy | Top_Interview_Questions, String, Two_Pointers | 353 | 52.06
-| 0977 |[Squares of a Sorted Array](src/main/kotlin/g0901_1000/s0977_squares_of_a_sorted_array/Solution.kt)| Easy | Array, Sorting, Two_Pointers | 375 | 18.43
+| 0977 |[Squares of a Sorted Array](src/main/kotlin/g0901_1000/s0977_squares_of_a_sorted_array/Solution.kt)| Easy | Array, Sorting, Two_Pointers | 271 | 77.17
 | 0026 |[Remove Duplicates from Sorted Array](src/main/kotlin/g0001_0100/s0026_remove_duplicates_from_sorted_array/Solution.kt)| Easy | Top_Interview_Questions, Array, Two_Pointers | 249 | 67.38
 | 0042 |[Trapping Rain Water](src/main/kotlin/g0001_0100/s0042_trapping_rain_water/Solution.kt)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(1) | 189 | 99.37
 | 0015 |[3Sum](src/main/kotlin/g0001_0100/s0015_3sum/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n^2)_Space_O(1) | 493 | 93.45
diff --git a/src/main/kotlin/g0901_1000/s0977_squares_of_a_sorted_array/Solution.kt b/src/main/kotlin/g0901_1000/s0977_squares_of_a_sorted_array/Solution.kt
@@ -1,7 +1,7 @@
 package g0901_1000.s0977_squares_of_a_sorted_array
 
 // #Easy #Array #Sorting #Two_Pointers #Algorithm_I_Day_2_Two_Pointers #Udemy_Two_Pointers
-// #2023_05_08_Time_375_ms_(18.43%)_Space_78.9_MB_(12.90%)
+// #2023_10_02_Time_271_ms_(77.17%)_Space_41_MB_(61.94%)
 
 import kotlin.math.abs
 
diff --git a/src/main/kotlin/g0901_1000/s0981_time_based_key_value_store/TimeMap.kt b/src/main/kotlin/g0901_1000/s0981_time_based_key_value_store/TimeMap.kt
@@ -1,7 +1,7 @@
 package g0901_1000.s0981_time_based_key_value_store
 
 // #Medium #String #Hash_Table #Binary_Search #Design #Binary_Search_II_Day_16
-// #2023_05_09_Time_1555_ms_(10.00%)_Space_268.7_MB_(5.00%)
+// #2023_10_02_Time_1011_ms_(65.56%)_Space_141.1_MB_(30.00%)
 
 import java.util.TreeMap
 
diff --git a/src/main/kotlin/g1101_1200/s1129_shortest_path_with_alternating_colors/Solution.kt b/src/main/kotlin/g1101_1200/s1129_shortest_path_with_alternating_colors/Solution.kt
@@ -1,7 +1,7 @@
 package g1101_1200.s1129_shortest_path_with_alternating_colors
 
 // #Medium #Breadth_First_Search #Graph #Graph_Theory_I_Day_10_Standard_Traversal
-// #2023_05_31_Time_241_ms_(16.67%)_Space_49.4_MB_(33.33%)
+// #2023_10_02_Time_208_ms_(80.00%)_Space_39.9_MB_(70.00%)
 
 import java.util.LinkedList
 import java.util.Queue
diff --git a/src/main/kotlin/g1101_1200/s1156_swap_for_longest_repeated_character_substring/Solution.kt b/src/main/kotlin/g1101_1200/s1156_swap_for_longest_repeated_character_substring/Solution.kt
@@ -1,6 +1,6 @@
 package g1101_1200.s1156_swap_for_longest_repeated_character_substring
 
-// #Medium #String #Sliding_Window #2023_05_25_Time_195_ms_(20.00%)_Space_38.9_MB_(20.00%)
+// #Medium #String #Sliding_Window #2023_10_02_Time_198_ms_(100.00%)_Space_37.4_MB_(100.00%)
 
 class Solution {
     private class Pair(var character: Char, var count: Int)
diff --git a/src/main/kotlin/g1401_1500/s1407_top_travellers/script.sql b/src/main/kotlin/g1401_1500/s1407_top_travellers/script.sql
@@ -1,6 +1,6 @@
 # Write your MySQL query statement below
 # #Easy #LeetCode_Curated_SQL_70 #Database #SQL_I_Day_9_Control_of_Flow
-# #2023_06_07_Time_2035_ms_(14.53%)_Space_0B_(100.00%)
+# #2023_10_02_Time_1394_ms_(98.43%)_Space_0B_(100.00%)
 select u.name,IFNULL(sum(r.distance), 0) as travelled_distance
 from Users u left join Rides r
 on u.id = r.user_id
diff --git a/src/main/kotlin/g1401_1500/s1450_number_of_students_doing_homework_at_a_given_time/Solution.kt b/src/main/kotlin/g1401_1500/s1450_number_of_students_doing_homework_at_a_given_time/Solution.kt
@@ -1,6 +1,6 @@
 package g1401_1500.s1450_number_of_students_doing_homework_at_a_given_time
 
-// #Easy #Array #2023_06_07_Time_180_ms_(10.00%)_Space_34.1_MB_(90.00%)
+// #Easy #Array #2023_10_02_Time_144_ms_(88.89%)_Space_34.7_MB_(11.11%)
 
 class Solution {
     fun busyStudent(startTime: IntArray, endTime: IntArray, queryTime: Int): Int {
diff --git a/src/main/kotlin/g1401_1500/s1461_check_if_a_string_contains_all_binary_codes_of_size_k/Solution.kt b/src/main/kotlin/g1401_1500/s1461_check_if_a_string_contains_all_binary_codes_of_size_k/Solution.kt
@@ -1,7 +1,7 @@
 package g1401_1500.s1461_check_if_a_string_contains_all_binary_codes_of_size_k
 
 // #Medium #String #Hash_Table #Bit_Manipulation #Hash_Function #Rolling_Hash
-// #2023_06_13_Time_578_ms_(20.00%)_Space_65.5_MB_(80.00%)
+// #2023_10_02_Time_482_ms_(100.00%)_Space_65.5_MB_(75.00%)
 
 class Solution {
     fun hasAllCodes(s: String, k: Int): Boolean {
diff --git a/src/main/kotlin/g1501_1600/s1590_make_sum_divisible_by_p/Solution.kt b/src/main/kotlin/g1501_1600/s1590_make_sum_divisible_by_p/Solution.kt
@@ -1,6 +1,6 @@
 package g1501_1600.s1590_make_sum_divisible_by_p
 
-// #Medium #Array #Hash_Table #Prefix_Sum #2023_06_14_Time_633_ms_(20.00%)_Space_58.2_MB_(100.00%)
+// #Medium #Array #Hash_Table #Prefix_Sum #2023_10_02_Time_464_ms_(100.00%)_Space_58.6_MB_(100.00%)
 
 class Solution {
     fun minSubarray(nums: IntArray, p: Int): Int {
diff --git a/src/main/kotlin/g1601_1700/s1604_alert_using_same_key_card_three_or_more_times_in_a_one_hour_period/Solution.kt b/src/main/kotlin/g1601_1700/s1604_alert_using_same_key_card_three_or_more_times_in_a_one_hour_period/Solution.kt
@@ -1,7 +1,7 @@
 package g1601_1700.s1604_alert_using_same_key_card_three_or_more_times_in_a_one_hour_period
 
 // #Medium #Array #String #Hash_Table #Sorting
-// #2023_06_13_Time_1063_ms_(20.00%)_Space_64.9_MB_(100.00%)
+// #2023_10_02_Time_704_ms_(83.33%)_Space_71.9_MB_(66.67%)
 
 class Solution {
     fun alertNames(keyName: Array<String>, keyTime: Array<String>): List<String> {
diff --git a/src/main/kotlin/g1701_1800/s1721_swapping_nodes_in_a_linked_list/Solution.kt b/src/main/kotlin/g1701_1800/s1721_swapping_nodes_in_a_linked_list/Solution.kt
@@ -1,6 +1,6 @@
 package g1701_1800.s1721_swapping_nodes_in_a_linked_list
 
-// #Medium #Two_Pointers #Linked_List #2023_06_16_Time_879_ms_(13.84%)_Space_53.8_MB_(95.50%)
+// #Medium #Two_Pointers #Linked_List #2023_10_02_Time_726_ms_(91.30%)_Space_53.2_MB_(58.70%)
 
 import com_github_leetcode.ListNode
 
diff --git a/src/main/kotlin/g1801_1900/s1855_maximum_distance_between_a_pair_of_values/Solution.kt b/src/main/kotlin/g1801_1900/s1855_maximum_distance_between_a_pair_of_values/Solution.kt
@@ -1,7 +1,7 @@
 package g1801_1900.s1855_maximum_distance_between_a_pair_of_values
 
 // #Medium #Array #Greedy #Binary_Search #Two_Pointers #Binary_Search_I_Day_11
-// #2023_06_22_Time_541_ms_(14.29%)_Space_54.8_MB_(85.71%)
+// #2023_10_02_Time_458_ms_(100.00%)_Space_55.7_MB_(50.00%)
 
 class Solution {
     fun maxDistance(nums1: IntArray, nums2: IntArray): Int {
diff --git a/src/main/kotlin/g1801_1900/s1857_largest_color_value_in_a_directed_graph/Solution.kt b/src/main/kotlin/g1801_1900/s1857_largest_color_value_in_a_directed_graph/Solution.kt
@@ -1,7 +1,7 @@
 package g1801_1900.s1857_largest_color_value_in_a_directed_graph
 
 // #Hard #Hash_Table #Dynamic_Programming #Graph #Counting #Memoization #Topological_Sort
-// #2023_06_22_Time_1308_ms_(20.00%)_Space_172.5_MB_(60.00%)
+// #2023_10_02_Time_1005_ms_(60.00%)_Space_253.2_MB_(20.00%)
 
 class Solution {
     fun largestPathValue(colors: String, edges: Array<IntArray>): Int {
diff --git a/src/main/kotlin/g2101_2200/s2130_maximum_twin_sum_of_a_linked_list/Solution.kt b/src/main/kotlin/g2101_2200/s2130_maximum_twin_sum_of_a_linked_list/Solution.kt
@@ -1,6 +1,6 @@
 package g2101_2200.s2130_maximum_twin_sum_of_a_linked_list
 
-// #Medium #Two_Pointers #Stack #Linked_List #2023_06_25_Time_534_ms_(16.77%)_Space_61.9_MB_(96.84%)
+// #Medium #Two_Pointers #Stack #Linked_List #2023_10_02_Time_458_ms_(93.88%)_Space_61.6_MB_(35.71%)
 
 import com_github_leetcode.ListNode
 
