In my experience, it's extremely difficult to identify a monotonic stack problem, most of the monotonic stack problems look like naive array problems. Are there any tips or tricks to recognize such problems?
(Monotonic queue/deque on the other hand is eaiser to recognize because they are widely applicable in some sliding windows problems.)
Example:
Odd Even Jumps
Trapping Rain Water
Largest Rectangle in Histogram