Leetcode 1413. Minimum Value to Get Positive Step by Step Sum

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).