Practice Oracle Coding Question | Real Coding Interviews | Hack2hire

NewML System Design & SQL tracks just landedSee what's new

Question Bank Pricing Blog Forum

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

Prefix sum array construction and range query optimization
Constrained subarray tracking using sliding windows or deques
Handling negative values and precise tie-breaking logic
Achieving linear time complexity for large input arrays

Common Patterns

Prefix Sum

Sliding Window

Monotonic Stack

Test Cases

Input

Output

Expected