Available question text
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Walk through Kadane's algorithm and explain the O(n) approach.
Related questions
Continue with questions that share topics or the same question type.
- Find the Kth Largest Integer in the Array
Coding
- Find Three Consecutive Integers That Sum to a Given Number
Coding
- Given a sorted integer array arr, two integers k and x, return the k closest integers to x in the array. The result should also be sorted in ascending order.
Coding
- Given an array nums and a sliding window of size k moving from the very left to the very right, return the maximum value in the window for each position. Solve in O(n) time using a deque.
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Glassdoor · 1 record
LinkedIn
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Walk through Kadane's algorithm and explain the O(n) approach.
Reported date not specified · 1 source report
Software Engineer
Source snapshot: Nov 12, 2026
View source