Maximum Subarray at Infosys

Medium53.0% acceptance

This problem has 75.0% frequency at Infosys.

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

Two SumEasy Longest Palindromic SubstringMedium Largest Number After Mutating SubstringMedium Next PermutationMedium Find Building Where Alice and Bob Can MeetHard

View all Infosys questions