The Bugdle Algodle archive is a complete index of every daily algorithm-recognition puzzle. Each entry presents a redacted snippet implementing a famous algorithm — quicksort, Dijkstra, Knuth–Morris–Pratt, A*, union-find, RSA, depth-first traversal, Boyer–Moore — with the function name and identifier names reduced to generic placeholders. Five attempts to type the canonical name; every wrong guess reveals a row of hint chips scoring your guess across five metadata dimensions (category, complexity, paradigm, data structure, era of formalisation).
With names stripped, the snippet has to be read for its shape: control flow, visiting order, data structures. Two pointers crawling toward each other is search or partition; a recursion that splits its input in half and recurses on both halves is divide-and-conquer; a priority queue plus graph traversal is almost certainly Dijkstra, Prim, or A*. The catalog ranges across canonical sorts, search algorithms, graph traversals, string-matching, dynamic programming, cryptography, compression, and the random/stochastic family. Every postmortem tells the algorithm's history, its complexity envelope, and the one tell that would have nailed it in a real review.