The range minimum query problem is simple to state: you're given an array $A$ and must preprocess it to answer queries of the form "what's the smallest element between indices $i$ and $j$?" as quickly as possible. This problem turns out to be surprisingly nuanced and it's possible to solve it much, much faster than you might expect.
Readings
Links