Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 40
What does the 'largest rectangle in histogram' problem use to reach O(n)?
A
A monotonic increasing stack of bar indices, computing areas when bars are popped
B
Sorting bar heights
C
Divide and conquer only
D
Dynamic programming over all pairs