Available question text
Repeatedly pick the smallest unmarked element (ties by smallest index), add its value to the score, and mark that element and its immediate neighbors until all elements are marked; return the total score. The core challenge is efficiently simulating this greedy selection and neighbor-marking for up to 1e5 elements.
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 2593. Find Score of an Array After Marking All Elements
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source