A curated list of the Blind 75 LeetCode problems for coding interviews. Fork this repo and tick off problems as you solve them. Happy coding! 🚀
- Two Sum
- Best Time to Buy and Sell Stock
- Contains Duplicate
- Product of Array Except Self
- Maximum Subarray
- Maximum Product Subarray
- Find Minimum in Rotated Sorted Array
- Search in Rotated Sorted Array
- 3Sum
- Container With Most Water
- Climbing Stairs
- Coin Change
- Longest Increasing Subsequence
- Longest Common Subsequence
- Word Break
- Combination Sum
- House Robber
- House Robber II
- Decode Ways
- Unique Paths
- Jump Game
- Clone Graph
- Course Schedule
- Pacific Atlantic Water Flow
- Number of Islands
- Longest Consecutive Sequence
- Alien Dictionary (LeetCode Premium)
- Graph Valid Tree (LeetCode Premium)
- Number of Connected Components in an Undirected Graph (LeetCode Premium)
- Insert Interval
- Merge Intervals
- Non-overlapping Intervals
- Meeting Rooms (LeetCode Premium)
- Meeting Rooms II (LeetCode Premium)
- Reverse Linked List
- Detect Cycle in a Linked List
- Merge Two Sorted Lists
- Merge k Sorted Lists
- Remove Nth Node From End of List
- Reorder List
- Longest Substring Without Repeating Characters
- Longest Repeating Character Replacement
- Minimum Window Substring
- Valid Anagram
- Group Anagrams
- Valid Parentheses
- Valid Palindrome
- Longest Palindromic Substring
- Palindromic Substrings
- Encode and Decode Strings (LeetCode Premium)
- Maximum Depth of Binary Tree
- Same Tree
- Invert Binary Tree
- Binary Tree Maximum Path Sum
- Binary Tree Level Order Traversal
- Serialize and Deserialize Binary Tree
- Subtree of Another Tree
- Construct Binary Tree from Preorder and Inorder Traversal
- Validate Binary Search Tree
- Kth Smallest Element in a BST
- Lowest Common Ancestor of a Binary Search Tree
- Implement Trie (Prefix Tree)
- Fork this repository.
- Tick off problems as you solve them by replacing
[ ]with[x]. - Happy coding! 🎉