Razorpay Burst Transaction Blocks
Razorpay Burst Transaction Blocks
HardDynamic Programming0% accepted
Razorpay batches transactions represented as balloons with values. Bursting balloon i earns nums[i-1]*nums[i]*nums[i+1] coins. Find the maximum coins obtainable by bursting all balloons optimally.
Approach
Maximum coins from bursting balloons (Burst Balloons interval DP).
Input
3
3 1 5
Output
35
More Dynamic Programming problems
Browse all coding problems →solution.py
Loading editor...
Test 1
Test 2
Test 3
Press Run to test your custom input, or Submit to judge against all test cases.
Sign in to continue
Create a free account to run code, submit solutions and track progress.
- Free forever — no credit card
- 10+ languages with live execution
- Points, streaks & leaderboards