File tree Expand file tree Collapse file tree 8 files changed +12
-8
lines changed
s3285_find_indices_of_stable_mountains
s3286_find_a_safe_walk_through_a_grid
s3287_find_the_maximum_sequence_value_of_array
s3288_length_of_the_longest_increasing_path
s3289_the_two_sneaky_numbers_of_digitville
s3290_maximum_multiplication_score
s3291_minimum_number_of_valid_strings_to_form_target_i
s3292_minimum_number_of_valid_strings_to_form_target_ii Expand file tree Collapse file tree 8 files changed +12
-8
lines changed Original file line number Diff line number Diff line change 1
1
package g3201_3300 .s3285_find_indices_of_stable_mountains ;
2
2
3
- // #Easy #2024_09_15_Time_1_ms_(100.00%)_Space_44.5_MB_(100.00%)
3
+ // #Easy #Array # 2024_09_15_Time_1_ms_(100.00%)_Space_44.5_MB_(100.00%)
4
4
5
5
import java .util .ArrayList ;
6
6
import java .util .List ;
Original file line number Diff line number Diff line change 1
1
package g3201_3300 .s3286_find_a_safe_walk_through_a_grid ;
2
2
3
- // #Medium #2024_09_15_Time_90_ms_(100.00%)_Space_46.6_MB_(100.00%)
3
+ // #Medium #Array #Matrix #Heap_Priority_Queue #Graph #Shortest_Path #Breadth_First_Search
4
+ // #2024_09_15_Time_90_ms_(100.00%)_Space_46.6_MB_(100.00%)
4
5
5
6
import java .util .LinkedList ;
6
7
import java .util .List ;
Original file line number Diff line number Diff line change 1
1
package g3201_3300 .s3287_find_the_maximum_sequence_value_of_array ;
2
2
3
- // #Hard #2024_09_15_Time_1140_ms_(100.00%)_Space_285.4_MB_(100.00%)
3
+ // #Hard #Array #Dynamic_Programming #Bit_Manipulation
4
+ // #2024_09_15_Time_1140_ms_(100.00%)_Space_285.4_MB_(100.00%)
4
5
5
6
import java .util .HashSet ;
6
7
import java .util .Set ;
Original file line number Diff line number Diff line change 1
1
package g3201_3300 .s3288_length_of_the_longest_increasing_path ;
2
2
3
- // #Hard #2024_09_15_Time_34_ms_(100.00%)_Space_106.2_MB_(50.00%)
3
+ // #Hard #Array #Sorting #Binary_Search # 2024_09_15_Time_34_ms_(100.00%)_Space_106.2_MB_(50.00%)
4
4
5
5
import java .util .ArrayList ;
6
6
import java .util .List ;
Original file line number Diff line number Diff line change 1
1
package g3201_3300 .s3289_the_two_sneaky_numbers_of_digitville ;
2
2
3
- // #Easy #2024_09_16_Time_3_ms_(100.00%)_Space_45_MB_(100.00%)
3
+ // #Easy #Array #Hash_Table #Math # 2024_09_16_Time_3_ms_(100.00%)_Space_45_MB_(100.00%)
4
4
5
5
import java .util .HashMap ;
6
6
import java .util .Map ;
Original file line number Diff line number Diff line change 1
1
package g3201_3300 .s3290_maximum_multiplication_score ;
2
2
3
- // #Medium #2024_09_16_Time_8_ms_(100.00%)_Space_62.5_MB_(100.00%)
3
+ // #Medium #Array #Dynamic_Programming # 2024_09_16_Time_8_ms_(100.00%)_Space_62.5_MB_(100.00%)
4
4
5
5
import java .util .Arrays ;
6
6
Original file line number Diff line number Diff line change 1
1
package g3201_3300 .s3291_minimum_number_of_valid_strings_to_form_target_i ;
2
2
3
- // #Medium #2024_09_16_Time_263_ms_(60.00%)_Space_56.9_MB_(20.00%)
3
+ // #Medium #Array #String #Dynamic_Programming #Binary_Search #Trie #Segment_Tree #Hash_Function
4
+ // #String_Matching #Rolling_Hash #2024_09_16_Time_263_ms_(60.00%)_Space_56.9_MB_(20.00%)
4
5
5
6
public class Solution {
6
7
public int minValidStrings (String [] words , String target ) {
Original file line number Diff line number Diff line change 1
1
package g3201_3300 .s3292_minimum_number_of_valid_strings_to_form_target_ii ;
2
2
3
- // #Hard #2024_09_16_Time_103_ms_(100.00%)_Space_94.7_MB_(100.00%)
3
+ // #Hard #Array #String #Dynamic_Programming #Binary_Search #Segment_Tree #Hash_Function
4
+ // #String_Matching #Rolling_Hash #2024_09_16_Time_103_ms_(100.00%)_Space_94.7_MB_(100.00%)
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