hard 21
- 2-D DP: Regular Expression Matching — Kotlin Solution
- 2-D DP: Longest Increasing Path In a Matrix — Kotlin Solution
- 2-D DP: Distinct Subsequences — Kotlin Solution
- 2-D DP: Burst Balloons — Kotlin Solution
- Advanced Graphs: Swim In Rising Water — Kotlin Solution
- Advanced Graphs: Reconstruct Itinerary — Kotlin Solution
- Advanced Graphs: Alien Dictionary — Kotlin Solution
- Intervals: Minimum Interval to Include Each Query — Kotlin Solution
- Graphs: Word Ladder — Kotlin Solution
- Backtracking: N Queens — Kotlin Solution
- Heap: Find Median From Data Stream — Kotlin Solution
- Trie: Word Search II — Kotlin Solution
- Trees: Serialize And Deserialize Binary Tree — Kotlin Solution
- Trees: Binary Tree Maximum Path Sum — Kotlin Solution
- Linked List: Reverse Nodes In K-Group — Kotlin Solution
- Linked List: Merge K Sorted Lists — Kotlin Solution
- Sliding Window: Sliding Window Maximum — Kotlin Solution
- Sliding Window: Minimum Window Substring — Kotlin Solution
- Binary Search: Median of Two Sorted Arrays — Kotlin Solution
- Stack: Largest Rectangle In Histogram — Kotlin Solution
- Two Pointers: Trapping Rain Water — Kotlin Solution