Available question text
Choose a subsequence (order preserved) of nums to maximize its alternating sum — the sum of elements at even positions minus the sum at odd positions after reindexing. With n up to 1e5, this is solved by a linear DP/greedy that decides for each element whether to include it as a positive (even) or negative (odd) contribution.
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 1911. Maximum Alternating Subsequence Sum
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source