Available question text
Given an integer array and k sign-flip operations, maximize the array sum by choosing which elements to negate. The core challenge is a greedy selection of the most negative values to flip first, then handling leftover flips by parity (possibly flipping the element with smallest absolute value).
Related questions
Continue with questions that share topics or the same question type.
- Apply Operations on Array to Maximize Sum of Squares
Coding
- Maximize Consecutive Elements in an Array After Modification
Coding
- Maximize Subarray Sum After Removing All Occurrences of One Element
Coding
- Maximize Sum of Weights after Edge Removals
Coding · Depth-First Search · Dynamic Programming · Sorting
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 1005. Maximize Sum Of Array After K Negations
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source