Available question text
Find the maximum subarray sum in the array obtained by repeating arr k times (empty subarray allowed, return 0) and output the result modulo 1e9+7. Key challenge: handle large k efficiently by combining Kadane on up to two concatenated copies with prefix/suffix and total-sum reasoning (total sum positive vs nonpositive).
Related questions
Continue with questions that share topics or the same question type.
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
- Choose K Elements With Maximum Sum
Coding
- Difference Between Maximum and Minimum Price Sum
Coding
- Find the Maximum Sum of Node Values
Coding
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 1191. K-Concatenation Maximum Sum
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source