Algorithm: Maximum sum with k consecutive bags | Dataford Interview Questions

Maximum Money in K Consecutive Bags: Given an infinite number of bags arranged in a line numbered from 1 to infinity, calculate the continuous K bags with the maximum total amount of money. Return the answer modulo 10^9 + 7.

Asked in the Online Assessment stage. The Amazon financial team scenario deals with continuous ranges of money bags.

Input and Output

coins is a list of [start, end, money_per_bag] ranges, and k is the number of consecutive bags. Return the maximum obtainable money as an integer modulo 10^9 + 7.

Constraints

Ranges are non-overlapping.
1 <= len(coins) <= 500
1 <= start <= end <= 10^9
1 <= money_per_bag <= 10^9
1 <= k <= 10^9

Function Signature

def max_money(coins, k):

Your question is Algorithm: Maximum sum with k consecutive bags. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem