My LeetCode Solutions in Python
- Arrays & Hashing (9)
- Two Pointers (5)
- Sliding Window (6)
- Stack (7)
- Binary Search (7)
- Linked List (11)
- Trees (15)
- Tries (3)
- Heap / Priority Queue (7)
- Backtracking (9)
- Graphs (13)
- Advanced Graphs (6)
- 1D Dynamic Programming (12)
- 2D Dynamic Programming (11)
- Greedy (8)
- Intervals (6)
- Math & Geometry (8)
- Bit Manipulation (7)
- Contains Duplicate (Easy)
- Valid Anagram (Easy)
- Two Sum (Easy)
- Group Anagrams (Medium)
- Top K Frequent Elements (Medium)
- Product of Array Except Self (Medium)
- Valid Sudoku (Medium)
- Encode and Decode Strings (Medium)
- Longest Consecutive Sequence (Medium)
- Valid Palindrome (Easy)
- Two Sum II Input Array Is Sorted (Medium)
- 3Sum (Medium)
- Container With Most Water (Medium)
- Trapping Rain Water (Hard)
- Best Time to Buy And Sell Stock (Easy)
- Longest Substring Without Repeating Characters (Medium)
- Longest Repeating Character Replacement (Medium)
- Permutation In String (Medium)
- Minimum Window Substring (Hard)
- Sliding Window Maximum (Hard)
- Valid Parentheses (Easy)
- Min Stack (Medium)
- Evaluate Reverse Polish Notation (Medium)
- Generate Parentheses (Medium)
- Daily Temperatures (Medium)
- Car Fleet (Medium)
- Largest Rectangle In Histogram (Hard)
- Binary Search (Easy)
- Search a 2D Matrix (Medium)
- Koko Eating Bananas (Medium)
- Find Minimum In Rotated Sorted Array (Medium)
- Search In Rotated Sorted Array (Medium)
- Time Based Key Value Store (Medium)
- Median of Two Sorted Arrays (Hard)
- Reverse Linked List (Easy)
- Merge Two Sorted Lists (Easy)
- Reorder List (Medium)
- Remove Nth Node From End of List (Medium)
- Copy List With Random Pointer (Medium)
- Add Two Numbers (Medium)
- Linked List Cycle (Easy)
- Find The Duplicate Number (Medium)
- LRU Cache (Medium)
- Merge K Sorted Lists (Hard)
- Reverse Nodes In K Group (Hard)
- Invert Binary Tree (Easy)
- Maximum Depth of Binary Tree (Easy)
- Diameter of Binary Tree (Easy)
- Balanced Binary Tree (Easy)
- Same Tree (Easy)
- Subtree of Another Tree (Easy)
- Lowest Common Ancestor of a Binary Search Tree (Medium)
- Binary Tree Level Order Traversal (Medium)
- Binary Tree Right Side View (Medium)
- Count Good Nodes In Binary Tree (Medium)
- Validate Binary Search Tree (Medium)
- Kth Smallest Element In a Bst (Medium)
- Construct Binary Tree From Preorder And Inorder Traversal (Medium)
- Binary Tree Maximum Path Sum (Hard)
- Serialize and Deserialize Binary Tree (Hard)
- Implement Trie Prefix Tree (Medium)
- Design Add And Search Words Data Structure (Medium)
- Word Search II (Hard)
- Kth Largest Element In a Stream (Easy)
- Last Stone Weight (Easy)
- K Closest Points to Origin (Medium)
- Kth Largest Element In An Array (Medium)
- Task Scheduler (Medium)
- Design Twitter (Medium)
- Find Median From Data Stream (Hard)
- Subsets (Medium)
- Combination Sum (Medium)
- Permutations (Medium)
- Subsets II (Medium)
- Combination Sum II (Medium)
- Word Search (Medium)
- Palindrome Partitioning (Medium)
- Letter Combinations of a Phone Number (Medium)
- N Queens (Hard)
- Number of Islands (Medium)
- Clone Graph (Medium)
- Max Area of Island (Medium)
- Pacific Atlantic Water Flow (Medium)
- Surrounded Regions (Medium)
- Rotting Oranges (Medium)
- Walls And Gates (Medium)
- Course Schedule (Medium)
- Course Schedule II (Medium)
- Redundant Connection (Medium)
- Number of Connected Components In An Undirected Graph (Medium)
- Graph Valid Tree (Medium)
- Word Ladder (Hard)
- Reconstruct Itinerary (Hard)
- Min Cost to Connect All Points (Medium)
- Network Delay Time (Medium)
- Swim In Rising Water (Hard)
- Alien Dictionary (Hard)
- Cheapest Flights Within K Stops (Medium)
- Climbing Stairs (Easy)
- Min Cost Climbing Stairs (Easy)
- House Robber (Medium)
- 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)
- Partition Equal Subset Sum (Medium)
- Unique Paths (Medium)
- Longest Common Subsequence (Medium)
- Best Time to Buy And Sell Stock With Cooldown (Medium)
- Coin Change II (Medium)
- Target Sum (Medium)
- Interleaving String (Medium)
- Longest Increasing Path In a Matrix (Hard)
- Distinct Subsequences (Hard)
- Edit Distance (Hard)
- Burst Balloons (Hard)
- Regular Expression Matching (Hard)
- Maximum Subarray (Medium)
- Jump Game (Medium)
- Jump Game II (Medium)
- Gas Station (Medium)
- Hand of Straights (Medium)
- Merge Triplets to Form Target Triplet (Medium)
- Partition Labels (Medium)
- Valid Parenthesis String (Medium)
- Insert Interval (Medium)
- Merge Intervals (Medium)
- Non Overlapping Intervals (Medium)
- Meeting Rooms (Easy)
- Meeting Rooms II (Medium)
- Minimum Interval to Include Each Query (Hard)
- Rotate Image (Medium)
- Spiral Matrix (Medium)
- Set Matrix Zeroes (Medium)
- Happy Number (Easy)
- Plus One (Easy)
- Pow(x, n) (Medium)
- Multiply Strings (Medium)
- Detect Squares (Medium)
- Single Number (Easy)
- Number of 1 Bits (Easy)
- Counting Bits (Easy)
- Reverse Bits (Easy)
- Missing Number (Easy)
- Sum of Two Integers (Medium)
- Reverse Integer (Medium)