Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 199902b

Browse files
authored
Added tasks 3688-3691
1 parent ee95826 commit 199902b

File tree

41 files changed

+521
-42
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

41 files changed

+521
-42
lines changed

‎src/main/java/g3601_3700/s3648_minimum_sensors_to_cover_grid/Solution.java‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3601_3700.s3648_minimum_sensors_to_cover_grid;
22

3-
// #Medium #Biweekly_Contest_163 #2025_08_17_Time_0_ms_(100.00%)_Space_41.03_MB_(100.00%)
3+
// #Medium #Math #Biweekly_Contest_163 #2025_09_26_Time_0_ms_(100.00%)_Space_41.09_MB_(54.77%)
44

55
public class Solution {
66
public int minSensors(int n, int m, int k) {

‎src/main/java/g3601_3700/s3649_number_of_perfect_pairs/Solution.java‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g3601_3700.s3649_number_of_perfect_pairs;
22

3-
// #Medium #Biweekly_Contest_163 #2025_08_17_Time_46_ms_(100.00%)_Space_60.00_MB_(100.00%)
3+
// #Medium #Array #Math #Sorting #Two_Pointers #Biweekly_Contest_163
4+
// #2025_09_26_Time_44_ms_(71.88%)_Space_59.91_MB_(26.12%)
45

56
import java.util.Arrays;
67

‎src/main/java/g3601_3700/s3650_minimum_cost_path_with_edge_reversals/Solution.java‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g3601_3700.s3650_minimum_cost_path_with_edge_reversals;
22

3-
// #Medium #Biweekly_Contest_163 #2025_08_17_Time_51_ms_(99.85%)_Space_110.03_MB_(49.54%)
3+
// #Medium #Heap_Priority_Queue #Graph #Shortest_Path #Biweekly_Contest_163
4+
// #2025_09_26_Time_47_ms_(99.80%)_Space_109.50_MB_(56.57%)
45

56
import java.util.Arrays;
67
import java.util.PriorityQueue;

‎src/main/java/g3601_3700/s3651_minimum_cost_path_with_teleportations/Solution.java‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g3601_3700.s3651_minimum_cost_path_with_teleportations;
22

3-
// #Hard #Biweekly_Contest_163 #2025_08_17_Time_78_ms_(100.00%)_Space_45.52_MB_(97.73%)
3+
// #Hard #Array #Dynamic_Programming #Matrix #Biweekly_Contest_163
4+
// #2025_09_26_Time_79_ms_(94.66%)_Space_45.38_MB_(97.96%)
45

56
import java.util.Arrays;
67

@@ -60,7 +61,6 @@ public int minCost(int[][] grid, int k) {
6061
prev[grid[i][j]] = Math.min(prev[grid[i][j]], dp[i][j]);
6162
}
6263
}
63-
// int currcost = prev[0];
6464
for (int i = 1; i <= max; i++) {
6565
prev[i] = Math.min(prev[i], prev[i - 1]);
6666
}

‎src/main/java/g3601_3700/s3654_minimum_sum_after_divisible_sum_deletions/Solution.java‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g3601_3700.s3654_minimum_sum_after_divisible_sum_deletions;
22

3-
// #Medium #Weekly_Contest_463 #2025_08_17_Time_17_ms_(98.16%)_Space_60.80_MB_(48.62%)
3+
// #Medium #Array #Hash_Table #Dynamic_Programming #Prefix_Sum #Weekly_Contest_463
4+
// #2025_09_26_Time_17_ms_(91.65%)_Space_59.64_MB_(68.62%)
45

56
import java.util.Arrays;
67

‎src/main/java/g3601_3700/s3658_gcd_of_odd_and_even_sums/Solution.java‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g3601_3700.s3658_gcd_of_odd_and_even_sums;
22

3-
// #Easy #Weekly_Contest_464 #2025_08_24_Time_1_ms_(100.00%)_Space_41.16_MB_(100.00%)
3+
// #Easy #Math #Number_Theory #Weekly_Contest_464
4+
// #2025_09_26_Time_0_ms_(100.00%)_Space_41.43_MB_(15.15%)
45

56
public class Solution {
67
public int gcdOfOddEvenSums(int n) {

‎src/main/java/g3601_3700/s3659_partition_array_into_k_distinct_groups/Solution.java‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g3601_3700.s3659_partition_array_into_k_distinct_groups;
22

3-
// #Medium #Weekly_Contest_464 #2025_08_29_Time_2_ms_(100.00%)_Space_55.86_MB_(99.96%)
3+
// #Medium #Array #Hash_Table #Counting #Weekly_Contest_464
4+
// #2025_09_26_Time_3_ms_(99.86%)_Space_56.50_MB_(99.38%)
45

56
public class Solution {
67
public boolean partitionArray(int[] nums, int k) {

‎src/main/java/g3601_3700/s3660_jump_game_ix/Solution.java‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g3601_3700.s3660_jump_game_ix;
22

3-
// #Medium #Weekly_Contest_464 #2025_08_29_Time_3_ms_(100.00%)_Space_66.47_MB_(70.03%)
3+
// #Medium #Array #Dynamic_Programming #Weekly_Contest_464
4+
// #2025_09_26_Time_4_ms_(98.97%)_Space_70.98_MB_(7.99%)
45

56
public class Solution {
67
public int[] maxValue(int[] nums) {

‎src/main/java/g3601_3700/s3661_maximum_walls_destroyed_by_robots/Solution.java‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g3601_3700.s3661_maximum_walls_destroyed_by_robots;
22

3-
// #Hard #Weekly_Contest_464 #2025_08_29_Time_88_ms_(99.25%)_Space_68.62_MB_(40.75%)
3+
// #Hard #Array #Dynamic_Programming #Sorting #Binary_Search #Weekly_Contest_464
4+
// #2025_09_26_Time_101_ms_(91.89%)_Space_63.31_MB_(79.90%)
45

56
import java.util.Arrays;
67
import java.util.Comparator;

‎src/main/java/g3601_3700/s3663_find_the_least_frequent_digit/Solution.java‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g3601_3700.s3663_find_the_least_frequent_digit;
22

3-
// #Easy #Biweekly_Contest_164 #2025_09_06_Time_1_ms_(97.91%)_Space_41.14_MB_(60.27%)
3+
// #Easy #Array #Hash_Table #Math #Counting #Biweekly_Contest_164
4+
// #2025_09_26_Time_1_ms_(97.93%)_Space_41.02_MB_(71.15%)
45

56
public class Solution {
67
public int getLeastFrequentDigit(int n) {

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /