Improved task 15

javadev · web-flow · commit d66fea3e4b23 · 2023-12-21T05:10:15.000+02:00
diff --git a/src/main/kotlin/g0001_0100/s0015_3sum/Solution.kt b/src/main/kotlin/g0001_0100/s0015_3sum/Solution.kt
@@ -2,7 +2,7 @@ package g0001_0100.s0015_3sum
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Two_Pointers
 // #Data_Structure_II_Day_1_Array #Algorithm_II_Day_3_Two_Pointers #Udemy_Two_Pointers
-// #Big_O_Time_O(n^2)_Space_O(1) #2023_07_03_Time_493_ms_(93.45%)_Space_53_MB_(93.97%)
+// #Big_O_Time_O(n*log(n))_Space_O(n^2) #2023_07_03_Time_493_ms_(93.45%)_Space_53_MB_(93.97%)
 
 class Solution {
     fun threeSum(nums: IntArray): List<List<Int>> {
diff --git a/src/test/kotlin/g2801_2900/s2806_account_balance_after_rounded_purchase/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2806_account_balance_after_rounded_purchase/SolutionTest.kt
@@ -4,7 +4,6 @@ import org.hamcrest.CoreMatchers.equalTo
 import org.hamcrest.MatcherAssert.assertThat
 import org.junit.jupiter.api.Test
 
-// #Easy #Math
 internal class SolutionTest {
     @Test
     fun accountBalanceAfterPurchase() {
diff --git a/src/test/kotlin/g2801_2900/s2807_insert_greatest_common_divisors_in_linked_list/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2807_insert_greatest_common_divisors_in_linked_list/SolutionTest.kt
@@ -5,7 +5,6 @@ import org.hamcrest.CoreMatchers.equalTo
 import org.hamcrest.MatcherAssert.assertThat
 import org.junit.jupiter.api.Test
 
-// #Medium #Array #Math #Linked_List
 internal class SolutionTest {
     @Test
     fun insertGreatestCommonDivisors() {
diff --git a/src/test/kotlin/g2801_2900/s2808_minimum_seconds_to_equalize_a_circular_array/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2808_minimum_seconds_to_equalize_a_circular_array/SolutionTest.kt
@@ -4,7 +4,6 @@ import org.hamcrest.CoreMatchers.equalTo
 import org.hamcrest.MatcherAssert.assertThat
 import org.junit.jupiter.api.Test
 
-// #Medium #Array #Hash_Table #Greedy
 internal class SolutionTest {
     @Test
     fun minimumSeconds() {
diff --git a/src/test/kotlin/g2801_2900/s2809_minimum_time_to_make_array_sum_at_most_x/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2809_minimum_time_to_make_array_sum_at_most_x/SolutionTest.kt
@@ -4,7 +4,6 @@ import org.hamcrest.CoreMatchers.equalTo
 import org.hamcrest.MatcherAssert.assertThat
 import org.junit.jupiter.api.Test
 
-// #Hard #Array #Dynamic_Programming #Sorting
 internal class SolutionTest {
     @Test
     fun minimumTime() {
diff --git a/src/test/kotlin/g2801_2900/s2810_faulty_keyboard/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2810_faulty_keyboard/SolutionTest.kt
@@ -4,7 +4,6 @@ import org.hamcrest.CoreMatchers.equalTo
 import org.hamcrest.MatcherAssert.assertThat
 import org.junit.jupiter.api.Test
 
-// #Easy #String #Simulation
 internal class SolutionTest {
     @Test
     fun finalString() {
diff --git a/src/test/kotlin/g2801_2900/s2811_check_if_it_is_possible_to_split_array/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2811_check_if_it_is_possible_to_split_array/SolutionTest.kt
@@ -4,7 +4,6 @@ import org.hamcrest.CoreMatchers.equalTo
 import org.hamcrest.MatcherAssert.assertThat
 import org.junit.jupiter.api.Test
 
-// #Medium #Array #Dynamic_Programming #Greedy
 internal class SolutionTest {
     @Test
     fun canSplitArray() {
diff --git a/src/test/kotlin/g2801_2900/s2812_find_the_safest_path_in_a_grid/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2812_find_the_safest_path_in_a_grid/SolutionTest.kt
@@ -5,7 +5,6 @@ import org.hamcrest.CoreMatchers.equalTo
 import org.hamcrest.MatcherAssert.assertThat
 import org.junit.jupiter.api.Test
 
-// #Medium #Array #Breadth_First_Search #Binary_Search #Matrix #Union_Find
 internal class SolutionTest {
     @Test
     fun maximumSafenessFactor() {
diff --git a/src/test/kotlin/g2801_2900/s2813_maximum_elegance_of_a_k_length_subsequence/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2813_maximum_elegance_of_a_k_length_subsequence/SolutionTest.kt
@@ -4,7 +4,6 @@ import org.hamcrest.CoreMatchers.equalTo
 import org.hamcrest.MatcherAssert.assertThat
 import org.junit.jupiter.api.Test
 
-// #Hard #Array #Hash_Table #Sorting #Greedy #Heap_Priority_Queue
 internal class SolutionTest {
     @Test
     fun findMaximumElegance() {
diff --git a/src/test/kotlin/g2801_2900/s2815_max_pair_sum_in_an_array/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2815_max_pair_sum_in_an_array/SolutionTest.kt
@@ -4,7 +4,6 @@ import org.hamcrest.CoreMatchers.equalTo
 import org.hamcrest.MatcherAssert.assertThat
 import org.junit.jupiter.api.Test
 
-// #Easy #Array #Hash_Table
 internal class SolutionTest {
     @Test
     fun maxSum() {
diff --git a/src/test/kotlin/g2801_2900/s2816_double_a_number_represented_as_a_linked_list/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2816_double_a_number_represented_as_a_linked_list/SolutionTest.kt
@@ -5,7 +5,6 @@ import org.hamcrest.CoreMatchers.equalTo
 import org.hamcrest.MatcherAssert.assertThat
 import org.junit.jupiter.api.Test
 
-// #Medium #Math #Stack #Linked_List
 internal class SolutionTest {
     @Test
     fun doubleIt() {
diff --git a/src/test/kotlin/g2801_2900/s2817_minimum_absolute_difference_between_elements_with_constraint/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2817_minimum_absolute_difference_between_elements_with_constraint/SolutionTest.kt
@@ -4,7 +4,6 @@ import org.hamcrest.CoreMatchers.equalTo
 import org.hamcrest.MatcherAssert.assertThat
 import org.junit.jupiter.api.Test
 
-// #Medium #Array #Binary_Search #Ordered_Set
 internal class SolutionTest {
     @Test
     fun minAbsoluteDifference() {
diff --git a/src/test/kotlin/g2801_2900/s2818_apply_operations_to_maximize_score/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2818_apply_operations_to_maximize_score/SolutionTest.kt
@@ -4,7 +4,6 @@ import org.hamcrest.CoreMatchers.equalTo
 import org.hamcrest.MatcherAssert.assertThat
 import org.junit.jupiter.api.Test
 
-// #Hard #Array #Math #Greedy #Stack #Monotonic_Stack #Number_Theory
 internal class SolutionTest {
     @Test
     fun maximumScore() {
diff --git a/src/test/kotlin/g2801_2900/s2824_count_pairs_whose_sum_is_less_than_target/SolutionTest.kt b/src/test/kotlin/g2801_2900/s2824_count_pairs_whose_sum_is_less_than_target/SolutionTest.kt
@@ -4,7 +4,6 @@ import org.hamcrest.CoreMatchers.equalTo
 import org.hamcrest.MatcherAssert.assertThat
 import org.junit.jupiter.api.Test
 
-// #Easy #Array #Sorting #Two_Pointers
 internal class SolutionTest {
     @Test
     fun countPairs() {
