LeetCode

LeetCode 2264 note: there are only ten candidates, “000” to “999”, so check from “999” down whether each appears

Solving the Online Stock Span problem using monotonic stack approach

Solving the Car Fleet problem using stack-based approach

Solving the Largest Rectangle in Histogram problem using monotonic stack approach

Solving the Daily Temperatures problem using monotonic stack approach

LeetCode 3644 note: every misplaced number must be swapped, so each bit of k must belong to all of them; the answer is the AND of every misplaced number

LeetCode 3643 note: flip only the submatrix rows, swapping the slices of rows x + i and x + k - 1 - i

Generating all valid parentheses combinations using backtracking approach

Solving the Valid Parentheses problem using stack-based approach

LeetCode 1696 note: dp[i] = nums[i] + max of the previous k dp values, with that max kept by a monotonic deque in O(n)

Implementing a stack with O(1) minimum retrieval using tuple-based approach

Solving the Reverse Polish Notation evaluation problem using stack-based approach