Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3147. Taking Maximum Energy From the Mystic Dungeon
Given an array and a step k, pick a starting index and sum the values at i, i+k, i+2k, ... until you fall off the end (you must take negative values too); return the maximum possible total. The core challenge is to evaluate these k interleaved arithmetic subsequences and pick the maximum suffix sum among them.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.