File tree Expand file tree Collapse file tree 4 files changed +6
-4
lines changed
src/main/kotlin/g3401_3500
s3417_zigzag_grid_traversal_with_skip
s3418_maximum_amount_of_money_robot_can_earn
s3419_minimize_the_maximum_edge_weight_of_graph
s3420_count_non_decreasing_subarrays_after_k_operations Expand file tree Collapse file tree 4 files changed +6
-4
lines changed Original file line number Diff line number Diff line change 1
1
package g3401_3500.s3417_zigzag_grid_traversal_with_skip
2
2
3
- // #Easy #2025_01_14_Time_2_(100.00%)_Space_43.72_(76.92%)
3
+ // #Easy #Array #Matrix #Simulation # 2025_01_14_Time_2_(100.00%)_Space_43.72_(76.92%)
4
4
5
5
class Solution {
6
6
fun zigzagTraversal (grid : Array <IntArray >): List <Int > {
Original file line number Diff line number Diff line change 1
1
package g3401_3500.s3418_maximum_amount_of_money_robot_can_earn
2
2
3
- // #Medium #2025_01_14_Time_60_(81.82%)_Space_84.66_(81.82%)
3
+ // #Medium #Array #Dynamic_Programming #Matrix # 2025_01_14_Time_60_(81.82%)_Space_84.66_(81.82%)
4
4
5
5
import kotlin.math.max
6
6
Original file line number Diff line number Diff line change 1
1
package g3401_3500.s3419_minimize_the_maximum_edge_weight_of_graph
2
2
3
- // #Medium #2025_01_14_Time_88_(100.00%)_Space_115.26_(83.33%)
3
+ // #Medium #Depth_First_Search #Breadth_First_Search #Binary_Search #Graph #Shortest_Path
4
+ // #2025_01_14_Time_88_(100.00%)_Space_115.26_(83.33%)
4
5
5
6
import java.util.LinkedList
6
7
import java.util.Queue
Original file line number Diff line number Diff line change 1
1
package g3401_3500.s3420_count_non_decreasing_subarrays_after_k_operations
2
2
3
- // #Hard #2025_01_14_Time_18_(100.00%)_Space_69.62_(_%)
3
+ // #Hard #Array #Two_Pointers #Stack #Monotonic_Stack #Queue #Segment_Tree #Monotonic_Queue
4
+ // #2025_01_15_Time_28_(100.00%)_Space_68.93_(88.89%)
4
5
5
6
class Solution {
6
7
fun countNonDecreasingSubarrays (nums : IntArray , k : Int ): Long {
You can’t perform that action at this time.
0 commit comments