Skip to content

Practice Maximum Coins From K Consecutive Bags

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#3413
LeetCode Problem

Maximum Coins From K Consecutive Bags

Problem Statement

There are an infinite amount of bags on a number line, one bag for each coordinate. Some of these bags contain coins. You are given a 2D array coins, where coins[i] = [li, ri, ci] denotes that every bag from li to ri contains ci coins. The segments that coins contain are non-overlapping. You are also given an integer k. Return the maximum amount of coins you can obtain by collecting k consecutive bags.

Source: Maximum Coins From K Consecutive Bags on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
coins = [[8,10,1],[1,3,2],[5,6,4]], k = 4
Output
10

# Example 2

Input
coins = [[1,10,3]], k = 2
Output
6

Constraints

1 <= coins.length <= 10^5
1 <= k <= 10^9
coins[i] == [li, ri, ci]
1 <= li <= ri <= 10^9
1 <= ci <= 1000
The given segments are non-overlapping.

Related LeetCode Problems

Practice more problems similar to Maximum Coins From K Consecutive Bags.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.