# Kth Largest Element In A Stream: Practice Notes
Kth Largest Element In A Stream shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Maintain a min-heap of size exactly k holding the k largest values seen so far. Each add pushes the new value and pops the smallest if the heap exceeds k; the peek is the kth largest.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (a heap or priority queue, Union-Find, interval scheduling, bitmask DP, a topological order, or a Trie) 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 k) per add.
## Common mistake
Using a max-heap of the whole stream and popping k times, which is slower and wastes memory.
## 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 help for online coding assessments.