Back to Questions

Maximum Subarray (Kadane's Algorithm)

96.1K views•Asked at Adobe•
Easy

Question Explain

Given an integer array `nums`, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

Start Trying This Question Simulation

Practice answering orally or with text to get instant AI feedback.

Practice with This Question

Other interview questions like this

Two Sum

104.4K views

Longest Substring Without Repeating Characters

62.2K views

Median of Two Sorted Arrays

107.8K views
Maximum Subarray (Kadane's Algorithm) - Interview Question