# Online Election Query: Study Guide

Online Election Query shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Store the leader after each vote and the times array. A query binary-searches the last vote at or before t and returns that stored leader.

## 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 + q log n).

## Common mistake

Recounting votes from the start of the array on every query.

## 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 interview copilot.