Available question text
Given an integer array, repeatedly pair up distinct unmarked indices (i, j) with 2 * nums[i] <= nums[j] and mark both; return the maximum number of indices that can be marked. Equivalently, find the largest number of disjoint pairs where the smaller element is at most half the larger (n up to 1e5).
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 2576. Find the Maximum Number of Marked Indices
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source