Arrays & Hashing
Contains Duplicate (Easy)
Valid Anagram (Easy)
Two Sum (Easy)
Group Anagrams (Medium)
Top K Frequent Elements (Medium)
Encode and Decode Strings (Medium)
Product of Array Except Self (Medium)
Longest Consecutive Sequence (Medium)
Two Pointers
Valid Palindrome (Easy)
3Sum (Medium)
Container With Most Water (Medium)
Sliding Window
Minimum Window Substring (Hard)
Stack
Valid Parentheses (Easy)
Binary Search
Find Minimum In Rotated Sorted Array (Medium)
Search In Rotated Sorted Array (Medium)
Linked List
Reverse Linked List (Easy)
Merge Two Sorted Lists (Easy)
Linked List Cycle (Easy)
Reorder List (Medium)
Remove Nth Node From End of List (Medium)
Merge K Sorted Lists (Hard)
Trees
Invert Binary Tree (Easy)
Maximum Depth of Binary Tree (Easy)
Same Tree (Easy)
Subtree of Another Tree (Easy)
Binary Tree Level Order Traversal (Medium)
Validate Binary Search Tree (Medium)
Kth Smallest Element In a Bst (Medium)
Binary Tree Maximum Path Sum (Hard)
Heaps / Priority Queue
Find Median from Data Stream (Hard)
Tries
Implement Trie (Prefix Tree) (Medium)
Word Search II (Hard)
Backtracking
Combination Sum (Medium)
Word Search (Medium)
Graphs
Number of Islands (Medium)
Clone Graph (Medium)
Pacific Atlantic Water Flow (Medium)
Course Schedule (Medium)
Graph Valid Tree (Medium)
Alien Dictionary (Hard)
Advanced Graphs
Graph Valid Tree (Medium) (Alternative classification)
1D Dynamic Programming
Climbing Stairs (Easy)
House Robber (Easy)
House Robber II (Medium)
Longest Palindromic Substring (Medium)
Palindromic Substrings (Medium)
Decode Ways (Medium)
Coin Change (Medium)
Maximum Product Subarray (Medium)
Word Break (Medium)
Longest Increasing Subsequence (Medium)
2D Dynamic Programming
Unique Paths (Medium)
Longest Common Subsequence (Medium)
Greedy
Maximum Subarray (Medium)
Jump Game (Medium)
Intervals
Insert Interval (Medium)
Merge Intervals (Medium)
Non-overlapping Intervals (Medium)
Meeting Rooms (Easy)
Meeting Rooms II (Medium)
Math & Geometry
Rotate Image (Medium)
Spiral Matrix (Medium)
Set Matrix Zeroes (Medium)
Bit Manipulation
Number of 1 Bits (Easy)
Counting Bits (Easy)
Missing Number (Easy)
Reverse Bits (Easy)
Sum of Two Integers (Medium)
