# Longest Uploaded Prefix: Walkthrough

Longest Uploaded Prefix shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A tracker starts empty; videos 1..n upload in arbitrary order. After each upload return the longest prefix 1..k that is fully uploaded. Keep a boolean (or set) of uploaded ids and a pointer k that advances while k+1 is present.

## 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) total.

## Common mistake

Rescanning from 1 on every upload, or advancing k past a hole.

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