File tree Expand file tree Collapse file tree 8 files changed +12
-8
lines changed
src/main/kotlin/g3201_3300
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_17_Time_195_ms_(92.68%)_Space_37.5_MB_(48.78%)
3
+ // #Easy #Array # 2024_09_17_Time_195_ms_(92.68%)_Space_37.5_MB_(48.78%)
4
4
5
5
class Solution {
6
6
fun stableMountains (height : IntArray , threshold : Int ): List <Int > {
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_17_Time_357_ms_(48.28%)_Space_48.2_MB_(58.62%)
3
+ // #Medium #Array #Breadth_First_Search #Matrix #Heap_Priority_Queue #Graph #Shortest_Path
4
+ // #2024_09_17_Time_357_ms_(48.28%)_Space_48.2_MB_(58.62%)
4
5
5
6
import java.util.LinkedList
6
7
import java.util.Objects
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_17_Time_2893_ms_(33.33%)_Space_290.4_MB_(33.33%)
3
+ // #Hard #Array #Dynamic_Programming #Bit_Manipulation
4
+ // #2024_09_17_Time_2893_ms_(33.33%)_Space_290.4_MB_(33.33%)
4
5
5
6
import kotlin.math.max
6
7
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_17_Time_984_ms_(83.33%)_Space_147.1_MB_(16.67%)
3
+ // #Hard #Array #Sorting #Binary_Search # 2024_09_17_Time_984_ms_(83.33%)_Space_147.1_MB_(16.67%)
4
4
5
5
import java.util.ArrayList
6
6
import java.util.Comparator
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_17_Time_223_ms_(68.97%)_Space_37.3_MB_(89.66%)
3
+ // #Easy #Array #Hash_Table #Math # 2024_09_17_Time_223_ms_(68.97%)_Space_37.3_MB_(89.66%)
4
4
5
5
import java.util.HashMap
6
6
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_17_Time_749_ms_(66.67%)_Space_71.3_MB_(75.00%)
3
+ // #Medium #Array #Dynamic_Programming # 2024_09_17_Time_749_ms_(66.67%)_Space_71.3_MB_(75.00%)
4
4
5
5
import kotlin.math.max
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_17_Time_566_ms_(70.00%)_Space_50.2_MB_(80.00%)
3
+ // #Medium #Array #String #Dynamic_Programming #Binary_Search #Trie #Segment_Tree #Hash_Function
4
+ // #String_Matching #Rolling_Hash #2024_09_17_Time_566_ms_(70.00%)_Space_50.2_MB_(80.00%)
4
5
5
6
import kotlin.math.min
6
7
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_17_Time_674_ms_(50.00%)_Space_74.6_MB_(100.00%)
3
+ // #Hard #Array #String #Dynamic_Programming #Binary_Search #Segment_Tree #Hash_Function
4
+ // #String_Matching #Rolling_Hash #2024_09_17_Time_674_ms_(50.00%)_Space_74.6_MB_(100.00%)
4
5
5
6
import java.util.ArrayList
6
7
import kotlin.math.min
You can’t perform that action at this time.
0 commit comments