Minimum Number of Visited Cells in a Grid (HARD) — Array, Dynamic Programming, Stack, Breadth-First Search, Union Find, Heap (Priority Queue), Matrix, Monotonic Stack
Find Median from Data Stream (HARD) — Two Pointers, Design, Sorting, Heap (Priority Queue), Data Stream