Rotting Oranges MEDIUM Array Breadth-First Search Matrix
Minimum Window Substring HARD Hash Table String Sliding Window
Convert Sorted List to Binary Search Tree MEDIUM Linked List Divide and Conquer Tree Binary Search Tree Binary Tree
Smallest Range Covering Elements from K Lists HARD Array Hash Table Greedy Sliding Window Sorting Heap (Priority Queue)
Word Ladder II HARD Hash Table String Backtracking Breadth-First Search
Longest Consecutive Sequence MEDIUM Array Hash Table Union Find
Min Stack MEDIUM Stack Design
Read N Characters Given read4 II - Call Multiple Times HARD Array Simulation Interactive
Car Pooling MEDIUM Array Sorting Heap (Priority Queue) Simulation Prefix Sum
Max Stack HARD Linked List Stack Design Doubly-Linked List Ordered Set
Implement Trie (Prefix Tree) MEDIUM Hash Table String Design Trie
Meeting Rooms II MEDIUM Array Two Pointers Greedy Sorting Heap (Priority Queue) Prefix Sum
Range Sum Query 2D - Immutable MEDIUM Array Design Matrix Prefix Sum
Water and Jug Problem MEDIUM Math Depth-First Search Breadth-First Search
String Compression MEDIUM Two Pointers String
Time Based Key-Value Store MEDIUM Hash Table String Binary Search Design
Longest Substring Without Repeating Characters MEDIUM Hash Table String Sliding Window
Find Minimum Time to Finish All Jobs HARD Array Dynamic Programming Backtracking Bit Manipulation Bitmask
Decode Ways MEDIUM String Dynamic Programming
Coordinate With Maximum Network Quality MEDIUM Array Enumeration
