Available question text
Given a circular integer array, return the maximum sum of any non-empty contiguous subarray (allowed to wrap from end to start). Typical solution uses Kadane’s algorithm for the non-wrapping case and total-sum minus minimum-subarray for the wrapping case, with care for the all-negative edge case.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 918. Maximum Sum Circular Subarray
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source