Maximum Subarray at Tekion

Medium53.0% acceptance

This problem has 75.0% frequency at Tekion.

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 Tekion Questions

Count the Number of Infection SequencesHard Trapping Rain WaterHard Product of Array Except SelfMedium Best Time to Buy and Sell Stock IIIHard Split Array Largest SumHard

View all Tekion questions