# Find The Maximum Number Of Marked Indices: Interview Notes
Find The Maximum Number Of Marked Indices shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
You may mark pairs (i,j) with 2*nums[i] <= nums[j], each index once. Sort and pair the smallest left half with the smallest feasible right-half partner via two pointers; the max marks is 2*pairs.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n log n).
## Common mistake
Pairing from the middle outward without a sort, or allowing an index to be used in two pairs.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at Linkjob AI copilot.