Practice Oracle Coding Question | Real Coding Interviews

Quick Summary

Find the optimal starting layer that maximizes accumulated reward points.
Movement is strictly downward and bounded by a fixed initial energy budget.
Handle negative rewards and resolve ties by selecting the smallest starting index.

What This Tests

Common Patterns

Prefix SumSliding WindowMonotonic Stack

Hint 1

Hint 2

Hint 3

What Interviewers May Ask Next

Report seen similar question in interview

python

Test Cases

Input

Output

Expected