Problem - Range Minimum Query

Given an array of $n$ elements and $q$ queries, each asking for the minimum element in a range $[l, r]$.

Example: arr $= [1, 3, 2, 7, 9, 11]$

• Query $(1, 4)$: min of $[3, 2, 7, 9]$ = $2$
• Query $(0, 2)$: min of $[1, 3, 2]$ = $1$ You're solving the textbook Sparse Table application. Constraints: $n$ up to $10^5$, $q$ up to $10^6$.