Maximum Subarray at Amazon

Medium53.0% acceptance

This problem has 75.0% frequency at Amazon.

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 Apple 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 Amazon Questions

Two SumEasy Trapping Rain WaterHard Best Time to Buy and Sell StockEasy Number of IslandsMedium Median of Two Sorted ArraysHard

View all Amazon questions