Available question text
Starting at index 0, pick an increasing subsequence of positions to maximize the sum of their nums values minus x each time you move between visited positions of different parity. Core challenge: optimize subsequence selection under a transition penalty based on parity (can be solved by tracking best scores for each parity).
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 2786. Visit Array Positions to Maximize Score
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source