Available question text
Find the smallest positive startValue such that when added to the running sum of nums (prefix sums), every cumulative total stays at least 1. This reduces to scanning the array for the minimum prefix sum and choosing startValue = max(1, 1 - minPrefix).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1413. Minimum Value to Get Positive Step by Step Sum
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source