diff --git a/src/main/kotlin/g3601_3700/s3648_minimum_sensors_to_cover_grid/Solution.kt b/src/main/kotlin/g3601_3700/s3648_minimum_sensors_to_cover_grid/Solution.kt index 39f54fb3..e9dbbb7f 100644 --- a/src/main/kotlin/g3601_3700/s3648_minimum_sensors_to_cover_grid/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3648_minimum_sensors_to_cover_grid/Solution.kt @@ -1,6 +1,6 @@ package g3601_3700.s3648_minimum_sensors_to_cover_grid -// #Medium #Biweekly_Contest_163 #2025_08_17_Time_0_ms_(100.00%)_Space_41.03_MB_(100.00%) +// #Medium #Math #Biweekly_Contest_163 #2025_08_17_Time_0_ms_(100.00%)_Space_41.03_MB_(100.00%) class Solution { fun minSensors(n: Int, m: Int, k: Int): Int { diff --git a/src/main/kotlin/g3601_3700/s3649_number_of_perfect_pairs/Solution.kt b/src/main/kotlin/g3601_3700/s3649_number_of_perfect_pairs/Solution.kt index 0adb9ead..64e1ddc7 100644 --- a/src/main/kotlin/g3601_3700/s3649_number_of_perfect_pairs/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3649_number_of_perfect_pairs/Solution.kt @@ -1,6 +1,7 @@ package g3601_3700.s3649_number_of_perfect_pairs -// #Medium #Biweekly_Contest_163 #2025_08_17_Time_46_ms_(100.00%)_Space_60.00_MB_(100.00%) +// #Medium #Array #Math #Sorting #Two_Pointers #Biweekly_Contest_163 +// #2025_08_17_Time_46_ms_(100.00%)_Space_60.00_MB_(100.00%) import kotlin.math.abs diff --git a/src/main/kotlin/g3601_3700/s3650_minimum_cost_path_with_edge_reversals/Solution.kt b/src/main/kotlin/g3601_3700/s3650_minimum_cost_path_with_edge_reversals/Solution.kt index 5b9b1abf..81970be2 100644 --- a/src/main/kotlin/g3601_3700/s3650_minimum_cost_path_with_edge_reversals/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3650_minimum_cost_path_with_edge_reversals/Solution.kt @@ -1,6 +1,7 @@ package g3601_3700.s3650_minimum_cost_path_with_edge_reversals -// #Medium #Biweekly_Contest_163 #2025_08_17_Time_51_ms_(99.85%)_Space_110.03_MB_(49.54%) +// #Medium #Heap_Priority_Queue #Graph #Shortest_Path #Biweekly_Contest_163 +// #2025_08_17_Time_51_ms_(99.85%)_Space_110.03_MB_(49.54%) import java.util.PriorityQueue diff --git a/src/main/kotlin/g3601_3700/s3651_minimum_cost_path_with_teleportations/Solution.kt b/src/main/kotlin/g3601_3700/s3651_minimum_cost_path_with_teleportations/Solution.kt index 21bbf5d6..49d57809 100644 --- a/src/main/kotlin/g3601_3700/s3651_minimum_cost_path_with_teleportations/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3651_minimum_cost_path_with_teleportations/Solution.kt @@ -1,6 +1,7 @@ package g3601_3700.s3651_minimum_cost_path_with_teleportations -// #Hard #Biweekly_Contest_163 #2025_08_17_Time_78_ms_(100.00%)_Space_45.52_MB_(97.73%) +// #Hard #Array #Dynamic_Programming #Matrix #Biweekly_Contest_163 +// #2025_08_17_Time_78_ms_(100.00%)_Space_45.52_MB_(97.73%) import kotlin.math.max import kotlin.math.min diff --git a/src/main/kotlin/g3601_3700/s3654_minimum_sum_after_divisible_sum_deletions/Solution.kt b/src/main/kotlin/g3601_3700/s3654_minimum_sum_after_divisible_sum_deletions/Solution.kt index 6f0b097b..c9ece1e5 100644 --- a/src/main/kotlin/g3601_3700/s3654_minimum_sum_after_divisible_sum_deletions/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3654_minimum_sum_after_divisible_sum_deletions/Solution.kt @@ -1,6 +1,7 @@ package g3601_3700.s3654_minimum_sum_after_divisible_sum_deletions -// #Medium #Weekly_Contest_463 #2025_08_17_Time_17_ms_(98.16%)_Space_60.80_MB_(48.62%) +// #Medium #Array #Hash_Table #Dynamic_Programming #Prefix_Sum #Weekly_Contest_463 +// #2025_08_17_Time_17_ms_(98.16%)_Space_60.80_MB_(48.62%) import kotlin.math.min diff --git a/src/main/kotlin/g3601_3700/s3658_gcd_of_odd_and_even_sums/Solution.kt b/src/main/kotlin/g3601_3700/s3658_gcd_of_odd_and_even_sums/Solution.kt index f140e473..e2f5a4d9 100644 --- a/src/main/kotlin/g3601_3700/s3658_gcd_of_odd_and_even_sums/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3658_gcd_of_odd_and_even_sums/Solution.kt @@ -1,6 +1,7 @@ package g3601_3700.s3658_gcd_of_odd_and_even_sums -// #Easy #Weekly_Contest_464 #2025_08_25_Time_0_ms_(100.00%)_Space_40.78_MB_(100.00%) +// #Easy #Math #Number_Theory #Weekly_Contest_464 +// #2025_08_25_Time_0_ms_(100.00%)_Space_40.78_MB_(100.00%) class Solution { fun gcdOfOddEvenSums(n: Int): Int { diff --git a/src/main/kotlin/g3601_3700/s3659_partition_array_into_k_distinct_groups/Solution.kt b/src/main/kotlin/g3601_3700/s3659_partition_array_into_k_distinct_groups/Solution.kt index c8062086..575a05e1 100644 --- a/src/main/kotlin/g3601_3700/s3659_partition_array_into_k_distinct_groups/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3659_partition_array_into_k_distinct_groups/Solution.kt @@ -1,6 +1,7 @@ package g3601_3700.s3659_partition_array_into_k_distinct_groups -// #Medium #Weekly_Contest_464 #2025_08_29_Time_6_ms_(100.00%)_Space_80.65_MB_(71.43%) +// #Medium #Array #Hash_Table #Counting #Weekly_Contest_464 +// #2025_08_29_Time_6_ms_(100.00%)_Space_80.65_MB_(71.43%) import kotlin.math.max diff --git a/src/main/kotlin/g3601_3700/s3660_jump_game_ix/Solution.kt b/src/main/kotlin/g3601_3700/s3660_jump_game_ix/Solution.kt index 6551f642..9fb1c197 100644 --- a/src/main/kotlin/g3601_3700/s3660_jump_game_ix/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3660_jump_game_ix/Solution.kt @@ -1,6 +1,7 @@ package g3601_3700.s3660_jump_game_ix -// #Medium #Weekly_Contest_464 #2025_08_29_Time_5_ms_(100.00%)_Space_83.83_MB_(92.31%) +// #Medium #Array #Dynamic_Programming #Weekly_Contest_464 +// #2025_08_29_Time_5_ms_(100.00%)_Space_83.83_MB_(92.31%) import kotlin.math.max import kotlin.math.min diff --git a/src/main/kotlin/g3601_3700/s3661_maximum_walls_destroyed_by_robots/Solution.kt b/src/main/kotlin/g3601_3700/s3661_maximum_walls_destroyed_by_robots/Solution.kt index 8dc5a11a..1d1008a0 100644 --- a/src/main/kotlin/g3601_3700/s3661_maximum_walls_destroyed_by_robots/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3661_maximum_walls_destroyed_by_robots/Solution.kt @@ -1,6 +1,7 @@ package g3601_3700.s3661_maximum_walls_destroyed_by_robots -// #Hard #Weekly_Contest_464 #2025_08_30_Time_147_ms_(100.00%)_Space_71.82_MB_(100.00%) +// #Hard #Array #Dynamic_Programming #Sorting #Binary_Search #Weekly_Contest_464 +// #2025_08_30_Time_147_ms_(100.00%)_Space_71.82_MB_(100.00%) import kotlin.math.max import kotlin.math.min diff --git a/src/main/kotlin/g3601_3700/s3663_find_the_least_frequent_digit/Solution.kt b/src/main/kotlin/g3601_3700/s3663_find_the_least_frequent_digit/Solution.kt index e68dfec0..77ec5753 100644 --- a/src/main/kotlin/g3601_3700/s3663_find_the_least_frequent_digit/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3663_find_the_least_frequent_digit/Solution.kt @@ -1,6 +1,7 @@ package g3601_3700.s3663_find_the_least_frequent_digit -// #Easy #Biweekly_Contest_164 #2025_09_07_Time_1_ms_(96.30%)_Space_40.60_MB_(100.00%) +// #Easy #Array #Hash_Table #Math #Counting #Biweekly_Contest_164 +// #2025_09_07_Time_1_ms_(96.30%)_Space_40.60_MB_(100.00%) class Solution { fun getLeastFrequentDigit(n: Int): Int { diff --git a/src/main/kotlin/g3601_3700/s3664_two_letter_card_game/Solution.kt b/src/main/kotlin/g3601_3700/s3664_two_letter_card_game/Solution.kt index 6b54721d..b2bd6e1c 100644 --- a/src/main/kotlin/g3601_3700/s3664_two_letter_card_game/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3664_two_letter_card_game/Solution.kt @@ -1,6 +1,7 @@ package g3601_3700.s3664_two_letter_card_game -// #Medium #Biweekly_Contest_164 #2025_09_07_Time_11_ms_(100.00%)_Space_69.41_MB_(100.00%) +// #Medium #Array #String #Hash_Table #Counting #Enumeration #Biweekly_Contest_164 +// #2025_09_07_Time_11_ms_(100.00%)_Space_69.41_MB_(100.00%) import kotlin.math.min diff --git a/src/main/kotlin/g3601_3700/s3665_twisted_mirror_path_count/Solution.kt b/src/main/kotlin/g3601_3700/s3665_twisted_mirror_path_count/Solution.kt index fc132505..276894ef 100644 --- a/src/main/kotlin/g3601_3700/s3665_twisted_mirror_path_count/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3665_twisted_mirror_path_count/Solution.kt @@ -1,6 +1,7 @@ package g3601_3700.s3665_twisted_mirror_path_count -// #Medium #Biweekly_Contest_164 #2025_09_07_Time_33_ms_(100.00%)_Space_113.52_MB_(72.73%) +// #Medium #Array #Dynamic_Programming #Matrix #Biweekly_Contest_164 +// #2025_09_07_Time_33_ms_(100.00%)_Space_113.52_MB_(72.73%) class Solution { fun uniquePaths(grid: Array): Int { diff --git a/src/main/kotlin/g3601_3700/s3666_minimum_operations_to_equalize_binary_string/Solution.kt b/src/main/kotlin/g3601_3700/s3666_minimum_operations_to_equalize_binary_string/Solution.kt index 00be3efd..f016cfc3 100644 --- a/src/main/kotlin/g3601_3700/s3666_minimum_operations_to_equalize_binary_string/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3666_minimum_operations_to_equalize_binary_string/Solution.kt @@ -1,6 +1,7 @@ package g3601_3700.s3666_minimum_operations_to_equalize_binary_string -// #Hard #Biweekly_Contest_164 #2025_09_07_Time_8_ms_(100.00%)_Space_46.70_MB_(100.00%) +// #Hard #String #Hash_Table #Math #Breadth_First_Search #Biweekly_Contest_164 +// #2025_09_07_Time_8_ms_(100.00%)_Space_46.70_MB_(100.00%) import kotlin.math.max diff --git a/src/main/kotlin/g3601_3700/s3668_restore_finishing_order/Solution.kt b/src/main/kotlin/g3601_3700/s3668_restore_finishing_order/Solution.kt index 7c416f79..ce4db37e 100644 --- a/src/main/kotlin/g3601_3700/s3668_restore_finishing_order/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3668_restore_finishing_order/Solution.kt @@ -1,6 +1,7 @@ package g3601_3700.s3668_restore_finishing_order -// #Easy #Weekly_Contest_465 #2025_09_07_Time_2_ms_(94.29%)_Space_49.08_MB_(72.86%) +// #Easy #Array #Hash_Table #Weekly_Contest_465 +// #2025_09_07_Time_2_ms_(94.29%)_Space_49.08_MB_(72.86%) class Solution { fun recoverOrder(order: IntArray, friends: IntArray): IntArray { diff --git a/src/main/kotlin/g3601_3700/s3669_balanced_k_factor_decomposition/Solution.kt b/src/main/kotlin/g3601_3700/s3669_balanced_k_factor_decomposition/Solution.kt index 638d2dad..24c16956 100644 --- a/src/main/kotlin/g3601_3700/s3669_balanced_k_factor_decomposition/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3669_balanced_k_factor_decomposition/Solution.kt @@ -1,6 +1,7 @@ package g3601_3700.s3669_balanced_k_factor_decomposition -// #Medium #Weekly_Contest_465 #2025_09_07_Time_30_ms_(85.71%)_Space_56.41_MB_(28.57%) +// #Medium #Math #Backtracking #Number_Theory #Weekly_Contest_465 +// #2025_09_07_Time_30_ms_(85.71%)_Space_56.41_MB_(28.57%) import kotlin.math.max import kotlin.math.min diff --git a/src/main/kotlin/g3601_3700/s3670_maximum_product_of_two_integers_with_no_common_bits/Solution.kt b/src/main/kotlin/g3601_3700/s3670_maximum_product_of_two_integers_with_no_common_bits/Solution.kt index 3a612f1f..051723df 100644 --- a/src/main/kotlin/g3601_3700/s3670_maximum_product_of_two_integers_with_no_common_bits/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3670_maximum_product_of_two_integers_with_no_common_bits/Solution.kt @@ -1,6 +1,7 @@ package g3601_3700.s3670_maximum_product_of_two_integers_with_no_common_bits -// #Medium #Weekly_Contest_465 #2025_09_07_Time_113_ms_(88.89%)_Space_78.00_MB_(100.00%) +// #Medium #Array #Dynamic_Programming #Bit_Manipulation #Weekly_Contest_465 +// #2025_09_07_Time_113_ms_(88.89%)_Space_78.00_MB_(100.00%) class Solution { fun maxProduct(nums: IntArray): Long { diff --git a/src/main/kotlin/g3601_3700/s3671_sum_of_beautiful_subsequences/Solution.kt b/src/main/kotlin/g3601_3700/s3671_sum_of_beautiful_subsequences/Solution.kt index 04d794b6..b60c2628 100644 --- a/src/main/kotlin/g3601_3700/s3671_sum_of_beautiful_subsequences/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3671_sum_of_beautiful_subsequences/Solution.kt @@ -1,6 +1,7 @@ package g3601_3700.s3671_sum_of_beautiful_subsequences -// #Hard #Weekly_Contest_465 #2025_09_07_Time_225_ms_(100.00%)_Space_75.96_MB_(100.00%) +// #Hard #Array #Math #Tree #Number_Theory #Weekly_Contest_465 +// #2025_09_07_Time_225_ms_(100.00%)_Space_75.96_MB_(100.00%) import kotlin.math.sqrt diff --git a/src/main/kotlin/g3601_3700/s3674_minimum_operations_to_equalize_array/Solution.kt b/src/main/kotlin/g3601_3700/s3674_minimum_operations_to_equalize_array/Solution.kt index 8e39e311..0424410a 100644 --- a/src/main/kotlin/g3601_3700/s3674_minimum_operations_to_equalize_array/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3674_minimum_operations_to_equalize_array/Solution.kt @@ -1,6 +1,7 @@ package g3601_3700.s3674_minimum_operations_to_equalize_array -// #Easy #Weekly_Contest_466 #2025_09_07_Time_1_ms_(100.00%)_Space_43.60_MB_(100.00%) +// #Easy #Array #Bit_Manipulation #Brainteaser #Weekly_Contest_466 +// #2025_09_07_Time_1_ms_(100.00%)_Space_43.60_MB_(100.00%) class Solution { fun minOperations(nums: IntArray): Int { diff --git a/src/main/kotlin/g3601_3700/s3675_minimum_operations_to_transform_string/Solution.kt b/src/main/kotlin/g3601_3700/s3675_minimum_operations_to_transform_string/Solution.kt index b5415b58..8a91dfeb 100644 --- a/src/main/kotlin/g3601_3700/s3675_minimum_operations_to_transform_string/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3675_minimum_operations_to_transform_string/Solution.kt @@ -1,6 +1,7 @@ package g3601_3700.s3675_minimum_operations_to_transform_string -// #Medium #Weekly_Contest_466 #2025_09_14_Time_6_ms_(97.92%)_Space_57.75_MB_(43.75%) +// #Medium #String #Greedy #Weekly_Contest_466 +// #2025_09_14_Time_6_ms_(97.92%)_Space_57.75_MB_(43.75%) class Solution { fun minOperations(s: String): Int { diff --git a/src/main/kotlin/g3601_3700/s3676_count_bowl_subarrays/Solution.kt b/src/main/kotlin/g3601_3700/s3676_count_bowl_subarrays/Solution.kt index 5debc1bc..c11ea01c 100644 --- a/src/main/kotlin/g3601_3700/s3676_count_bowl_subarrays/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3676_count_bowl_subarrays/Solution.kt @@ -1,6 +1,7 @@ package g3601_3700.s3676_count_bowl_subarrays -// #Medium #Weekly_Contest_466 #2025_09_14_Time_3_ms_(100.00%)_Space_79.40_MB_(50.00%) +// #Medium #Array #Stack #Monotonic_Stack #Weekly_Contest_466 +// #2025_09_14_Time_3_ms_(100.00%)_Space_79.40_MB_(50.00%) class Solution { fun bowlSubarrays(nums: IntArray): Long { diff --git a/src/main/kotlin/g3601_3700/s3677_count_binary_palindromic_numbers/Solution.kt b/src/main/kotlin/g3601_3700/s3677_count_binary_palindromic_numbers/Solution.kt index 394d2bee..89a9eaca 100644 --- a/src/main/kotlin/g3601_3700/s3677_count_binary_palindromic_numbers/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3677_count_binary_palindromic_numbers/Solution.kt @@ -1,6 +1,7 @@ package g3601_3700.s3677_count_binary_palindromic_numbers -// #Hard #Weekly_Contest_466 #2025_09_07_Time_1_ms_(100.00%)_Space_41.19_MB_(100.00%) +// #Hard #Math #Bit_Manipulation #Weekly_Contest_466 +// #2025_09_07_Time_1_ms_(100.00%)_Space_41.19_MB_(100.00%) class Solution { private fun makePalin(left: Long, odd: Boolean): Long { diff --git a/src/main/kotlin/g3601_3700/s3678_smallest_absent_positive_greater_than_average/Solution.kt b/src/main/kotlin/g3601_3700/s3678_smallest_absent_positive_greater_than_average/Solution.kt index a43ace72..e38be16b 100644 --- a/src/main/kotlin/g3601_3700/s3678_smallest_absent_positive_greater_than_average/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3678_smallest_absent_positive_greater_than_average/Solution.kt @@ -1,6 +1,7 @@ package g3601_3700.s3678_smallest_absent_positive_greater_than_average -// #Easy #Biweekly_Contest_165 #2025_09_20_Time_3_ms_(100.00%)_Space_47.84_MB_(100.00%) +// #Easy #Array #Hash_Table #Biweekly_Contest_165 +// #2025_09_20_Time_3_ms_(100.00%)_Space_47.84_MB_(100.00%) class Solution { fun smallestAbsent(nums: IntArray): Int { diff --git a/src/main/kotlin/g3601_3700/s3679_minimum_discards_to_balance_inventory/Solution.kt b/src/main/kotlin/g3601_3700/s3679_minimum_discards_to_balance_inventory/Solution.kt index a77940cd..2c8911fe 100644 --- a/src/main/kotlin/g3601_3700/s3679_minimum_discards_to_balance_inventory/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3679_minimum_discards_to_balance_inventory/Solution.kt @@ -1,6 +1,7 @@ package g3601_3700.s3679_minimum_discards_to_balance_inventory -// #Medium #Biweekly_Contest_165 #2025_09_20_Time_6_ms_(100.00%)_Space_68.59_MB_(76.92%) +// #Medium #Array #Hash_Table #Simulation #Counting #Sliding_Window #Biweekly_Contest_165 +// #2025_09_20_Time_6_ms_(100.00%)_Space_68.59_MB_(76.92%) import kotlin.math.max diff --git a/src/main/kotlin/g3601_3700/s3680_generate_schedule/Solution.kt b/src/main/kotlin/g3601_3700/s3680_generate_schedule/Solution.kt index 34395c5b..ded4a894 100644 --- a/src/main/kotlin/g3601_3700/s3680_generate_schedule/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3680_generate_schedule/Solution.kt @@ -1,6 +1,7 @@ package g3601_3700.s3680_generate_schedule -// #Medium #Biweekly_Contest_165 #2025_09_20_Time_3_ms_(100.00%)_Space_48.94_MB_(100.00%) +// #Medium #Array #Math #Greedy #Biweekly_Contest_165 +// #2025_09_20_Time_3_ms_(100.00%)_Space_48.94_MB_(100.00%) class Solution { fun generateSchedule(n: Int): Array { diff --git a/src/main/kotlin/g3601_3700/s3681_maximum_xor_of_subsequences/Solution.kt b/src/main/kotlin/g3601_3700/s3681_maximum_xor_of_subsequences/Solution.kt index 9c1218c1..0c0df015 100644 --- a/src/main/kotlin/g3601_3700/s3681_maximum_xor_of_subsequences/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3681_maximum_xor_of_subsequences/Solution.kt @@ -1,6 +1,7 @@ package g3601_3700.s3681_maximum_xor_of_subsequences -// #Hard #Biweekly_Contest_165 #2025_09_20_Time_26_ms_(100.00%)_Space_76.00_MB_(77.78%) +// #Hard #Array #Math #Greedy #Bit_Manipulation #Biweekly_Contest_165 +// #2025_09_20_Time_26_ms_(100.00%)_Space_76.00_MB_(77.78%) import kotlin.math.max import kotlin.math.min diff --git a/src/main/kotlin/g3601_3700/s3683_earliest_time_to_finish_one_task/Solution.kt b/src/main/kotlin/g3601_3700/s3683_earliest_time_to_finish_one_task/Solution.kt index fa730b99..2a6e585e 100644 --- a/src/main/kotlin/g3601_3700/s3683_earliest_time_to_finish_one_task/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3683_earliest_time_to_finish_one_task/Solution.kt @@ -1,6 +1,6 @@ package g3601_3700.s3683_earliest_time_to_finish_one_task -// #Easy #Weekly_Contest_467 #2025_09_20_Time_1_ms_(100.00%)_Space_52.19_MB_(60.38%) +// #Easy #Array #Weekly_Contest_467 #2025_09_20_Time_1_ms_(100.00%)_Space_52.19_MB_(60.38%) import kotlin.math.min diff --git a/src/main/kotlin/g3601_3700/s3684_maximize_sum_of_at_most_k_distinct_elements/Solution.kt b/src/main/kotlin/g3601_3700/s3684_maximize_sum_of_at_most_k_distinct_elements/Solution.kt index 78602fe7..d481985a 100644 --- a/src/main/kotlin/g3601_3700/s3684_maximize_sum_of_at_most_k_distinct_elements/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3684_maximize_sum_of_at_most_k_distinct_elements/Solution.kt @@ -1,6 +1,7 @@ package g3601_3700.s3684_maximize_sum_of_at_most_k_distinct_elements -// #Easy #Weekly_Contest_467 #2025_09_20_Time_12_ms_(92.59%)_Space_50.11_MB_(90.74%) +// #Easy #Array #Hash_Table #Sorting #Greedy #Weekly_Contest_467 +// #2025_09_20_Time_12_ms_(92.59%)_Space_50.11_MB_(90.74%) class Solution { fun maxKDistinct(nums: IntArray, k: Int): IntArray { diff --git a/src/main/kotlin/g3601_3700/s3685_subsequence_sum_after_capping_elements/Solution.kt b/src/main/kotlin/g3601_3700/s3685_subsequence_sum_after_capping_elements/Solution.kt index 5c9b3834..25b2a46d 100644 --- a/src/main/kotlin/g3601_3700/s3685_subsequence_sum_after_capping_elements/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3685_subsequence_sum_after_capping_elements/Solution.kt @@ -1,6 +1,7 @@ package g3601_3700.s3685_subsequence_sum_after_capping_elements -// #Medium #Weekly_Contest_467 #2025_09_20_Time_33_ms_(100.00%)_Space_50.14_MB_(100.00%) +// #Medium #Array #Dynamic_Programming #Sorting #Two_Pointers #Weekly_Contest_467 +// #2025_09_20_Time_33_ms_(100.00%)_Space_50.14_MB_(100.00%) import kotlin.math.min diff --git a/src/main/kotlin/g3601_3700/s3686_number_of_stable_subsequences/Solution.kt b/src/main/kotlin/g3601_3700/s3686_number_of_stable_subsequences/Solution.kt index ebfc25f3..a3494105 100644 --- a/src/main/kotlin/g3601_3700/s3686_number_of_stable_subsequences/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3686_number_of_stable_subsequences/Solution.kt @@ -1,6 +1,7 @@ package g3601_3700.s3686_number_of_stable_subsequences -// #Hard #Weekly_Contest_467 #2025_09_20_Time_11_ms_(100.00%)_Space_70.56_MB_(55.00%) +// #Hard #Array #Dynamic_Programming #Weekly_Contest_467 +// #2025_09_20_Time_11_ms_(100.00%)_Space_70.56_MB_(55.00%) class Solution { fun countStableSubsequences(nums: IntArray): Int { diff --git a/src/main/kotlin/g3601_3700/s3690_split_and_merge_array_transformation/Solution.kt b/src/main/kotlin/g3601_3700/s3690_split_and_merge_array_transformation/Solution.kt index a0aa2eb0..ccebf253 100644 --- a/src/main/kotlin/g3601_3700/s3690_split_and_merge_array_transformation/Solution.kt +++ b/src/main/kotlin/g3601_3700/s3690_split_and_merge_array_transformation/Solution.kt @@ -1,6 +1,6 @@ package g3601_3700.s3690_split_and_merge_array_transformation -// #Medium #Array #Hash_Table #Weekly_Contest_468 #Breadth_First_Search +// #Medium #Array #Hash_Table #Breadth_First_Search #Weekly_Contest_468 // #2025_09_26_Time_12_ms_(100.00%)_Space_49.52_MB_(92.31%) import java.util.Deque