File tree 4 files changed +8
-4
lines changed
s3507_minimum_pair_removal_to_sort_array_i
s3509_maximum_product_of_subsequences_with_an_alternating_sum_equal_to_k
s3510_minimum_pair_removal_to_sort_array_ii
4 files changed +8
-4
lines changed Original file line number Diff line number Diff line change 1
1
package g3501_3600 .s3507_minimum_pair_removal_to_sort_array_i ;
2
2
3
- // #Easy #2025_04_06_Time_1_ms_(100.00%)_Space_43.21_MB_(23.72%)
3
+ // #Easy #Array #Hash_Table #Heap_Priority_Queue #Simulation #Linked_List #Ordered_Set
4
+ // #Doubly_Linked_List #2025_04_09_Time_1_ms_(100.00%)_Space_42.96_MB_(53.67%)
4
5
5
6
public class Solution {
6
7
public int minimumPairRemoval (int [] nums ) {
Original file line number Diff line number Diff line change 1
1
package g3501_3600 .s3508_implement_router ;
2
2
3
- // #Medium #2025_04_06_Time_157_ms_(99.88%)_Space_115.01_MB_(94.70%)
3
+ // #Medium #Array #Hash_Table #Binary_Search #Design #Ordered_Set #Queue
4
+ // #2025_04_09_Time_137_ms_(100.00%)_Space_116.63_MB_(91.98%)
4
5
5
6
import java .util .ArrayList ;
6
7
import java .util .HashMap ;
Original file line number Diff line number Diff line change 1
1
package g3501_3600 .s3509_maximum_product_of_subsequences_with_an_alternating_sum_equal_to_k ;
2
2
3
- // #Hard #2025_04_06_Time_142_ms_(100.00%)_Space_46.26_MB_(93.55%)
3
+ // #Hard #Array #Hash_Table #Dynamic_Programming
4
+ // #2025_04_09_Time_141_ms_(89.52%)_Space_46.06_MB_(99.56%)
4
5
5
6
import java .util .BitSet ;
6
7
import java .util .HashMap ;
Original file line number Diff line number Diff line change 1
1
package g3501_3600 .s3510_minimum_pair_removal_to_sort_array_ii ;
2
2
3
- // #Hard #2025_04_06_Time_478_ms_(100.00%)_Space_62.47_MB_(99.17%)
3
+ // #Hard #Array #Hash_Table #Heap_Priority_Queue #Simulation #Linked_List #Ordered_Set
4
+ // #Doubly_Linked_List #2025_04_09_Time_492_ms_(98.32%)_Space_62.71_MB_(97.48%)
4
5
5
6
import java .util .ArrayList ;
6
7
import java .util .Arrays ;
You can’t perform that action at this time.
0 commit comments