Maximum Subarray at Apple

Medium53.0% acceptance

This problem has 68.6% 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 62 companies

Accenture Accolite ADP Airbnb Amazon Arista Networks Atlassian Autodesk Blinkit Bloomberg ByteDance Cisco Cognizant Dell Deloitte Epam Systems Fractal Analytics Goldman Sachs Google Hashedin+42 more

View Full Problem

More Apple Questions

Two SumEasy Number of IslandsMedium Merge IntervalsMedium Best Time to Buy and Sell StockEasy Design Hit CounterMedium

View all Apple questions