File tree Expand file tree Collapse file tree 4 files changed +7
-4
lines changed
src/main/kotlin/g3501_3600
s3566_partition_array_into_two_equal_product_subsets
s3567_minimum_absolute_difference_in_sliding_submatrix
s3568_minimum_moves_to_clean_the_classroom
s3569_maximize_count_of_distinct_primes_after_split Expand file tree Collapse file tree 4 files changed +7
-4
lines changed Original file line number Diff line number Diff line change 1
1
package g3501_3600.s3566_partition_array_into_two_equal_product_subsets
2
2
3
- // #Medium #2025_06_01_Time_1_ms_(100.00%)_Space_42.26_MB_(100.00%)
3
+ // #Medium #Array #Bit_Manipulation #Recursion #Enumeration
4
+ // #2025_06_01_Time_1_ms_(100.00%)_Space_42.26_MB_(100.00%)
4
5
5
6
class Solution {
6
7
fun checkEqualPartitions (nums : IntArray , target : Long ): Boolean {
Original file line number Diff line number Diff line change 1
1
package g3501_3600.s3567_minimum_absolute_difference_in_sliding_submatrix
2
2
3
- // #Medium #2025_06_01_Time_18_ms_(100.00%)_Space_53.66_MB_(25.00%)
3
+ // #Medium #Array #Sorting #Matrix # 2025_06_01_Time_18_ms_(100.00%)_Space_53.66_MB_(25.00%)
4
4
5
5
import kotlin.math.min
6
6
Original file line number Diff line number Diff line change 1
1
package g3501_3600.s3568_minimum_moves_to_clean_the_classroom
2
2
3
- // #Medium #2025_06_01_Time_149_ms_(100.00%)_Space_64.20_MB_(100.00%)
3
+ // #Medium #Array #Hash_Table #Breadth_First_Search #Matrix #Bit_Manipulation
4
+ // #2025_06_01_Time_149_ms_(100.00%)_Space_64.20_MB_(100.00%)
4
5
5
6
import java.util.ArrayDeque
6
7
import java.util.Queue
Original file line number Diff line number Diff line change 1
1
package g3501_3600.s3569_maximize_count_of_distinct_primes_after_split
2
2
3
- // #Hard #2025_06_01_Time_441_ms_(100.00%)_Space_98.42_MB_(100.00%)
3
+ // #Hard #Array #Math #Segment_Tree #Number_Theory
4
+ // #2025_06_01_Time_441_ms_(100.00%)_Space_98.42_MB_(100.00%)
4
5
5
6
import java.util.TreeSet
6
7
import kotlin.math.max
You can’t perform that action at this time.
0 commit comments