Categorized Comprehensive Problem Set

Array and Strings - [x] Group Anagrams - LeetCode #49 (Hash Table) - [x] Meeting Scheduler - LeetCode #1229 (Two Pointers) - [x] Smallest Range Covering Elements from K Lists - LeetCode #632 (Heap, Sliding Window) - [x] Sliding Window Maximum - LeetCode #239 (Monotonic queue, Sliding Window) - [x] Minimum Window Substring - LeetCode #76 (Sliding Window) - [x] Longest Substring Without Repeating Characters - LeetCode #3 (Sliding Window) - [x] Find All Anagrams in a String - LeetCode #438 (Sliding Window) - [x] Longest Repeating Character Replacement - LeetCode #424 (Sliding Window) - [x] Longest Palindromic Substring - LeetCode #5 (Manacher's Algorithm) - [x] Stream of Character - LeetCode #1032 (Aho-Corasick Algorithm) - [x] Find the Index of the First Occurrence in a String - LeetCode #28 (KMP Algorithm) - [x] Shortest Palindrome - LeetCode #214 (KMP Algorithm) - [x] Find the Winner of the Circular Game - LeetCode # 1823 (Josephus Algorithm)

Linked Lists - [x] Linked List Cycle II - LeetCode #142 (Linked List, Floyd's Cycle Detection algorithm) - [x] Reverse Nodes in k-Group - LeetCode #25 (Linked List) - [x] Remove Nth Node From End of List - LeetCode #19 (Linked List, Fast and Slow Pointers) - [x] Reorder List - LeetCode #143 (Linked List, Fast and Slow Pointers) - [x] Rotate List - LeetCode #61 (Linked List)

Trees - [x] Maximum Depth of Binary Tree - LeetCode #104 (Tree, DFS) - [x] Binary Tree Maximum Path Sum - LeetCode #124 (Tree, DFS) - [x] Lowest Common Ancestor of a Binary Tree - LeetCode #236 (Tree, DFS) - [x] Lowest Common Ancestor of a Binary Search Tree - LeetCode #235 (BST, DFS) - [x] Maximum Width of Binary Tree - LeetCode #662 (Tree, BFS) - [x] Binary Tree Right Side View - LeetCode #199 (Tree, BFS) - [x] Serialize and Deserialize Binary Tree - LeetCode #297 (Tree, Preorder Traversal) - [x] Construct Binary Tree from Preorder and Inorder Traversal - LeetCode #105 (Tree, Preorder Traversal, Inorder Traversal) - [x] Kth Smallest Element in a BST - LeetCode #230 (BST, Inorder Traversal) - [x] Recover Binary Search Tree - LeetCode #99 (BST) - [x] Validate Binary Search Tree - LeetCode #98 (BST) - [x] Delete Node in a BST - LeetCode #450 (AVL Tree) - [x] Insert into a Binary Search Tree - LeetCode #701 (AVL Tree)

Graphs - [x] Number of Islands - LeetCode #200 (Graph, DFS) - [x] Pacific Atlantic Water Flow - LeetCode #417 (Graph, DFS) - [x] Accounts Merge - LeetCode #721 (Graph, DFS) - [x] Number of Operations to Make Network Connected - LeetCode #1319 (Graph, DFS) - [x] Minimum Knight Moves - LeetCode #1197 (Graph, BFS) - [x] Shortest Path with Alternating Color - LeetCode #1129 (Graph, BFS) - [x] Bus Routes - LeetCode #815 (Graph, BFS) - [x] Rotting Oranges - LeetCode #994 (Graph, BFS) - [x] Word Ladder - LeetCode #127 (Graph, BFS) - [x] Shortest Path in a Grid with Obstacles Elimination - LeetCode #1293 (Graph, BFS) - [x] Redundant Connection - LeetCode #684 (Graph, Disjoint Set) - [x] Process Restricted Friend Requests - LeetCode #2076 (Graph, Disjoint Set) - [x] Find the Shortest Superstring #943 (Graph, Hamiltonian Path) - [x] Reconstruct Itinerary - LeetCode #332 (Graph, Hierholzer's algorithm) - [x] Parallel Courses III - LeetCode #2050 (Graph, Kahn’s algorithm) - [x] Alien Dictionary - LeetCode #269 (Graph, Kahn’s algorithm) - [x] Course Schedule II - LeetCode #210 (Graph, Kahn’s algorithm) - [x] Connecting Cities With Minimum Cost - LeetCode # 1135 (Graph, Kruskal's Algorithm) - [x] Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree - LeetCode #1489 (Graph, Kruskal's Algorithm) - [x] Min Cost to Connect All Points - LeetCode #1584 (Graph, Prim's Algorithm) - [x] Find the City With the Smallest Number of Neighbors at a Threshold Distance - LeetCode # 1334 (Graph, Floyd-Warshall Algorithm) - [x] Cheapest Flights Within K Stops - LeetCode #787 (Graph, Dijkstra’s Algorithm) - [x] Network Delay Time - LeetCode #743 (Graph, Dijkstra’s Algorithm) - [x] Critical Connections in a Network - LeetCode #1192 (Graph, Tarjan's Algorithm) - [x] Maximum Students Taking Exam - LeetCode #1349 (Graph, Ford-Fulkerson Algorithm) - [x] Maximum Compatibility Score Sum - LeetCode #1947 (Graph, Kuhn-Munkres Algorithm)

Sorting and Searching - [x] Top K Frequent Words - LeetCode #692 (Sorting) - [x] Trapping Rain Water - LeetCode #42 (Two Pointers, Monotonic Stack) - [x] Largest Rectangle in Histogram - LeetCode #84 (Monotonic Stack) - [x] Smallest Subsequence of Distinct Characters - LeetCode #1081 (Monotonic stack) - [x] Minimum Cost to Hire K Workers - LeetCode #857 (Heap) - [x] Kth Largest Element in an Array - LeetCode #215 (Heap) - [x] Employee Free Time - LeetCode #759 (Sweep Line Algorithm) - [x] The Skyline Problem - LeetCode #218 (Heap, Divide and Conquer, Sweep Line Algorithm) - [x] Implement Trie (Prefix Tree) - LeetCode #208 (Trie) - [x] Range Sum Query - Mutable - LeetCode #307 (Segment Tree) - [x] Count of Range Sum - LeetCode #327 (Balanced Binary Search Tree) - [x] Count of Smaller Numbers After Self - LeetCode #315 (Fenwick Tree)

Backtracking - [x] Permutations - LeetCode #46 (Backtracking) - [x] Word Search - LeetCode #79 (Backtracking) - [x] Word Search II - LeetCode #212 (Backtracking, Trie) - [x] N-Queens - LeetCode #51 (Backtracking)

Greedy Algorithms - [x] Insert Interval - LeetCode #57 (Greedy) - [x] Merge Intervals - LeetCode #56 (Greedy) - [x] Non-overlapping Intervals - LeetCode #435 (Greedy) - [x] Gas Station - LeetCode #134 (Greedy) - [x] Jump Game - LeetCode #55 (Greedy) - [x] Meeting Rooms II - LeetCode #253 (Greedy) - [x] Task Scheduler - LeetCode #621 (Greedy) - [x] Maximum Number of Tasks You Can Assign - LeetCode #2071 (Greedy) - [x] Flower Planting With No Adjacent - LeetCode #1042 (Greedy)

Dynamic Programming - [x] Decode Ways - LeetCode #91 (Dynamic Programming) - [x] Wildcard Matching - LeetCode #44 (Dynamic Programming) - [x] Burst Balloons - LeetCode #312 (Dynamic Programming) - [x] Best Time to Buy and Sell Stock - LeetCode #121 (Dynamic Programming) - [x] Best Time to Buy and Sell Stock II - LeetCode #122 (Dynamic Programming) - [x] Best Time to Buy and Sell Stock III - LeetCode #123 (Dynamic Programming) - [x] Best Time to Buy and Sell Stock IV - LeetCode #188 (Dynamic Programming) - [x] Best Time to Buy and Sell Stock with Cooldown #309 (Dynamic Programming) - [x] House Robber - LeetCode #198 (Dynamic Programming) - [x] House Robber II - LeetCode #213 (Dynamic Programming) - [x] House Robber IV - LeetCode #2560 (Dynamic Programming) - [x] Word Break - LeetCode #139 (Dynamic Programming) - [x] Word Break II - LeetCode #140 (Dynamic Programming) - [x] Coin Change - LeetCode #322 (Dynamic Programming) - [x] Coin Change II - LeetCode #518 (Dynamic Programming) - [x] Edit Distance - LeetCode #72 (Dynamic Programming) - [x] Longest Increasing Subsequence - LeetCode #300 (Dynamic Programming) - [x] Longest Valid Parentheses - LeetCode #32 (Dynamic Programming) - [x] Combination Sum IV - LeetCode #377 (Dynamic Programming) - [x] Palindrome Partitioning II - LeetCode #132 (Dynamic Programming) - [x] Maximum Profit in Job Scheduling - LeetCode #1235 (Dynamic Programming) - [x] Maximum Subarray - LeetCode #53 (Kadane's Algorithm) - [x] Cat and Mouse - LeetCode #913 (Minimax, BFS, Dynamical Programming) - [x] Cat and Mouse II - LeetCode #1728 (Minimax, DFS, Memoization)