Technical: đ Blind75
A list of the best LeetCode questions that go over the core concepts & techniques for each category/type of problems!
See: Blind (original) vs. LeetCode post, and other related posts (LeetCode Patterns, or 14 Patterns to Ace any Coding Interview Question)
Status
- ã°ī¸ To do
- â : Complete
- đŠ Did not complete
Topics
Array
| Status | Title | Difficulty |
|---|---|---|
| â | Find Minimum in Rotated Sorted Array | Medium |
| đŠ | Best Time To Buy and Sell Stock (max profit) | Easy |
| â | Contains Duplicate | Easy |
| đŠī¸ | Product of Array Except Self | Medium |
| â | Maximum Subarray | Easy |
| đŠ | Maximum Product Subarray | Medium |
| â | Two Sum | Easy |
| â | Search in Rotated Sorted Array | Medium |
| đŠ | 3 Sum | Medium |
| đŠ/â | Container with Most Water | Medium |
Binary
| Status | Title | Difficulty |
|---|---|---|
| đŠ | Sum of Two Integers | Medium |
| â | Number of 1 Bits | Easy |
| đŠ | Counting Bits | Easy |
| đŠ/â | Missing Number | Easy |
| â | Reverse Bits | Easy |
Dynamic Programming
| Status | Title | Difficulty |
|---|---|---|
| â | Climbing Stairs | Easy |
| đŠī¸ | Coin Change | Medium |
| ã°ī¸ | Longest Increasing Subsequence | Medium |
| ã°ī¸ | Longest Common Subsequence | Medium |
| ã°ī¸ | Word Break Problem | Medium |
| ã°ī¸ | Combination Sum | Medium |
| ã°ī¸ | House Robber | Medium |
| ã°ī¸ | House Robber II | Medium |
| ã°ī¸ | Decode Ways | Medium |
| ã°ī¸ | Unique Ways | Medium |
| ã°ī¸ | Jump Game | Medium |
Graph
| Status | Title | Difficulty |
|---|---|---|
| đŠ | Clone Graph | Medium |
| ã°ī¸ | Course Schedule | Medium |
| ã°ī¸ | Pacific Atlantic Water Flow | Medium |
| ã°ī¸ | Number of Islands | Medium |
| ã°ī¸ | Longest Consecutive Sequence | Medium |
| ã°ī¸ | Alien Dictionary | Hard |
| ã°ī¸ | Graph Valid Tree | Medium |
| ã°ī¸ | Number of Connected Components in an Undirected Graph | Medium |
Interval
| Status | Title | Difficulty |
|---|---|---|
| ã°ī¸ | Insert Interval | Medium |
| ã°ī¸ | Merge Intervals | Medium |
| ã°ī¸ | Non-overlapping Intervals | Medium |
| ã°ī¸ | Meeting Rooms | Easy |
| ã°ī¸ | Meeting Rooms II | Medium |
Linked List
| Status | Title | Difficulty |
|---|---|---|
| đŠ | Reverse a Linked List | Easy |
| đŠ | Detect Cycle in a Linked List | Easy |
| đŠī¸ | Merge Two Sorted Lists | Easy |
| ã°ī¸ | Merge K Sorted Lists | Hard |
| ã°ī¸ | Remove Nth Node From End Of List | Medium |
| ã°ī¸ | Reorder List | Medium |
Matrix
| Status | Title | Difficulty |
|---|---|---|
| ã°ī¸ | Set Matrix Zeroes | Medium |
| ã°ī¸ | Spiral Matrix | Medium |
| ã°ī¸ | Rotate Image | Medium |
| đŠ | Word Search | Medium |
String
| Status | Title | Difficulty |
|---|---|---|
| â | Longest Substring Without Repeating Characters | Medium |
| đŠ | Longest Repeating Character Replacement | Medium |
| ã°ī¸ | Minimum Window Substring | Hard |
| â | Valid Anagram | Easy |
| â | Group Anagrams | Medium |
| â | Valid Parentheses | Easy |
| â | Valid Palindrome | Easy |
| â | Longest Palindromic Substring | Medium |
| â | Palindromic Substrings | Medium |
| ã°ī¸ | Encode and Decode strings | Medium |
Tree
| Status | Title | Difficulty |
|---|---|---|
| đŠ | Maximum Depth of Binary Tree | Easy |
| đŠ | Same Tree | Easy |
| đŠī¸ | Invert/Flip Binary Tree | Easy |
| ã°ī¸ | Binary Tree Maximum Path Sum | Hard |
| ã°ī¸ | Binary Tree Level Order Traversal | Medium |
| ã°ī¸ | Serialize and Deserialize Binary Tree | Hard |
| đŠī¸ | Subtree of Another Tree | Easy |
| ã°ī¸ | Construct Binary Tree from Preorder and Inorder Traversal | Medium |
| ã°ī¸ | Validate Binary Search Tree | Medium |
| ã°ī¸ | Kth Smallest Element in a BST | Medium |
| đŠī¸ | Lowest Common Ancestor of BST | Easy |
| â | Implement Trie (Prefix Tree) | Medium |
| ã°ī¸ | And and Search Word | Medium |
| ã°ī¸ | Word Search II | Hard |
Heap
| Status | Title | Difficulty |
|---|---|---|
| ã°ī¸ | Merge K Sorted Lists | Hard |
| ã°ī¸ | Top K Frequent Elements | Medium |
| ã°ī¸ | Find Median from Data Stream | Hard |