Maximum Subarray at Apple

Medium53.0% acceptance

This problem has 75.0% frequency at Apple.

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 Arista Networks Atlassian Autodesk Blinkit Bloomberg ByteDance Cisco Citadel Cognizant Coupang Criteo DE Shaw Deloitte Epam Systems Fractal Analytics+45 more

View Full Problem

More Apple Questions

Two SumEasy Merge IntervalsMedium Best Time to Buy and Sell StockEasy Number of IslandsMedium Longest Common PrefixEasy

View all Apple questions