Maximum Subarray at Goldman Sachs

Medium53.0% acceptance

This problem has 50.0% frequency at Goldman Sachs.

Problem Description

Given an integer array `nums`, find the subarray with the largest sum, and return _its sum_.

Read full problem and hints

Topics

Array Divide and Conquer Dynamic Programming

Also asked at 65 companies

Accenture Accolite ADP Airbnb Amazon Apple Arista Networks Atlassian Autodesk Blinkit Bloomberg ByteDance Cisco Citadel Cognizant Coupang Criteo DE Shaw Deloitte Epam Systems+45 more

View Full Problem

More Goldman Sachs Questions

Trapping Rain WaterHard Median of Two Sorted ArraysHard Container With Most WaterMedium Search in Rotated Sorted ArrayMedium Minimum Path SumMedium

View all Goldman Sachs questions