How should I practice Minimum Subarray Sum?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Mygate phone screen problems in FastPrep.

Is Minimum Subarray Sum associated with Mygate?

FastPrep tags this as a Mygate phone screen coding practice problem when the problem catalog has that company and stage context.

Mygate● MediumFULLTIMEPHONE SCREEN

Given a nonempty integer array nums, return the smallest sum of any nonempty contiguous subarray.

A subarray consists of consecutive elements. Return its sum, rather than its length or indices. There is no target-sum parameter.

minimumSubarraySum(nums: int[]) → long

nums = [3,-4,2,-3,-1,7,-5]return = -6

The subarray [-4, 2, -3, -1] has sum -6.

nums = [2,4,1]return = 1

The smallest nonempty sum is the single element 1.

nums = [-5]return = -5

The only nonempty subarray has sum -5.