# SOR Tracker: Study Guide

SOR Tracker shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

add a place (name, score); get returns the i-th best so far (1st call = best, 2nd = 2nd best, ...). Order by score desc, then name asc. A balanced tree or two heaps (a max-heap of unseen better places and a min-heap of already returned) lets get pop the next best without resorting.

## 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(log n) per add/get.

## Common mistake

Sorting the whole list on every get, or breaking name ties the wrong way.

## 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 AI coding interview assistant.