Skip to interview prep
Apexed

366. Find the maximum subarray sum, the maximum sum with no two adjacent elements, and the maximum sum with no three consecutive elements.

MediumDynamic programming

Technical

Write a solution in JavaScript or Python, add a few test calls that print results and press Run. This is ungraded practice: Run shows output and does not check correctness. Open the Model answer tab to compare. Your code is saved in this browser.

Tab indents · Ctrl/⌘ + Enter runs · Esc then Tab leaves the editor

Press Run to see your program’s output.

Find the maximum subarray sum, the maximum sum with no two adjacent elements, and the maximum sum with no three consecutive elements. — Data structures & algori