Improved tasks 207, 2918, 2923, 2924, 2925, 2926, 2928, 2948

javadev · web-flow · commit db8db58c3a54 · 2024-01-16T05:36:12.000+02:00
diff --git a/src/main/kotlin/g0201_0300/s0207_course_schedule/Solution.kt b/src/main/kotlin/g0201_0300/s0207_course_schedule/Solution.kt
@@ -2,7 +2,7 @@ package g0201_0300.s0207_course_schedule
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search
 // #Breadth_First_Search #Graph #Topological_Sort #Big_O_Time_O(N)_Space_O(N)
-// #2023_12_31_Time_356_ms_(10.58%)_Space_38.1_MB_(97.12%)
+// #2024_01_16_Time_183_ms_(92.07%)_Space_39.1_MB_(81.50%)
 
 class Solution {
     fun canFinish(numCourses: Int, prerequisites: Array<IntArray>): Boolean {
diff --git a/src/main/kotlin/g2901_3000/s2918_minimum_equal_sum_of_two_arrays_after_replacing_zeros/Solution.kt b/src/main/kotlin/g2901_3000/s2918_minimum_equal_sum_of_two_arrays_after_replacing_zeros/Solution.kt
@@ -1,15 +1,13 @@
 package g2901_3000.s2918_minimum_equal_sum_of_two_arrays_after_replacing_zeros
 
-// #Medium #Array #Greedy #2023_12_31_Time_1410_ms_(7.69%)_Space_63.2_MB_(38.46%)
+// #Medium #Array #Greedy #2024_01_16_Time_598_ms_(100.00%)_Space_60.2_MB_(90.00%)
 
 class Solution {
     fun minSum(nums1: IntArray, nums2: IntArray): Long {
         val sum1 = nums1.fold(0L) { sum, element -> sum + element }
         val zeroCount1 = nums1.count { it == 0 }
-
         val sum2 = nums2.fold(0L) { sum, element -> sum + element }
         val zeroCount2 = nums2.count { it == 0 }
-
         if (
             (zeroCount1 == 0 && sum1 < sum2 + zeroCount2) ||
             (zeroCount2 == 0 && sum2 < sum1 + zeroCount1)
diff --git a/src/main/kotlin/g2901_3000/s2923_find_champion_i/Solution.kt b/src/main/kotlin/g2901_3000/s2923_find_champion_i/Solution.kt
@@ -1,6 +1,6 @@
 package g2901_3000.s2923_find_champion_i
 
-// #Easy #Array #Matrix #2023_12_31_Time_591_ms_(5.63%)_Space_49.8_MB_(36.62%)
+// #Easy #Array #Matrix #2024_01_16_Time_320_ms_(58.62%)_Space_49.8_MB_(48.28%)
 
 class Solution {
     fun findChampion(grid: Array<IntArray>): Int {
diff --git a/src/main/kotlin/g2901_3000/s2924_find_champion_ii/Solution.kt b/src/main/kotlin/g2901_3000/s2924_find_champion_ii/Solution.kt
@@ -1,6 +1,6 @@
 package g2901_3000.s2924_find_champion_ii
 
-// #Medium #Graph #2023_12_31_Time_724_ms_(6.98%)_Space_45.3_MB_(97.67%)
+// #Medium #Graph #2024_01_16_Time_422_ms_(81.82%)_Space_58.4_MB_(63.64%)
 
 class Solution {
     fun findChampion(n: Int, edges: Array<IntArray>): Int {
diff --git a/src/main/kotlin/g2901_3000/s2925_maximum_score_after_applying_operations_on_a_tree/Solution.kt b/src/main/kotlin/g2901_3000/s2925_maximum_score_after_applying_operations_on_a_tree/Solution.kt
@@ -1,7 +1,7 @@
 package g2901_3000.s2925_maximum_score_after_applying_operations_on_a_tree
 
 // #Medium #Dynamic_Programming #Depth_First_Search #Tree
-// #2023_12_31_Time_1274_ms_(6.67%)_Space_85.1_MB_(10.00%)
+// #2024_01_16_Time_706_ms_(81.82%)_Space_84.7_MB_(27.27%)
 
 import kotlin.math.min
 
diff --git a/src/main/kotlin/g2901_3000/s2926_maximum_balanced_subsequence_sum/Solution.kt b/src/main/kotlin/g2901_3000/s2926_maximum_balanced_subsequence_sum/Solution.kt
@@ -1,7 +1,7 @@
 package g2901_3000.s2926_maximum_balanced_subsequence_sum
 
 // #Hard #Array #Dynamic_Programming #Binary_Search #Segment_Tree #Binary_Indexed_Tree
-// #2023_12_31_Time_1067_ms_(12.50%)_Space_64.7_MB_(68.75%)
+// #2024_01_16_Time_636_ms_(100.00%)_Space_66.4_MB_(66.67%)
 
 import kotlin.math.max
 
diff --git a/src/main/kotlin/g2901_3000/s2928_distribute_candies_among_children_i/Solution.kt b/src/main/kotlin/g2901_3000/s2928_distribute_candies_among_children_i/Solution.kt
@@ -1,6 +1,6 @@
 package g2901_3000.s2928_distribute_candies_among_children_i
 
-// #Easy #Math #Enumeration #Combinatorics #2023_12_31_Time_282_ms_(6.38%)_Space_33.7_MB_(85.11%)
+// #Easy #Math #Enumeration #Combinatorics #2024_01_16_Time_141_ms_(86.36%)_Space_33.8_MB_(86.36%)
 
 import kotlin.math.min
 
diff --git a/src/main/kotlin/g2901_3000/s2948_make_lexicographically_smallest_array_by_swapping_elements/Solution.kt b/src/main/kotlin/g2901_3000/s2948_make_lexicographically_smallest_array_by_swapping_elements/Solution.kt
@@ -1,6 +1,6 @@
 package g2901_3000.s2948_make_lexicographically_smallest_array_by_swapping_elements
 
-// #Medium #Array #Sorting #Union_Find #2023_12_31_Time_1831_ms_(6.45%)_Space_69.4_MB_(74.19%)
+// #Medium #Array #Sorting #Union_Find #2024_01_16_Time_928_ms_(94.59%)_Space_77.9_MB_(21.62%)
 
 import kotlin.math.abs
 
