awesome-leetcode-resources
Awesome LeetCode resources to learn Data Structures and Algorithms and prepare for Coding Interviews.
https://github.com/ashishps1/awesome-leetcode-resources
Last synced: 8 days ago
JSON representation
📚 Books
Books
📇 Courses
✅ Curated Problems
Curated Problems
📌 Fundamental Concepts
- Linked List
- Queues
- Stacks
- Hash Tables
- Heaps
- Recursion
- Trees
- Tries
- Dynamic Programming
- Graph Theory
- DFS Traversal
- BFS Traversal
- Big-O Cheat Sheet
- Algorithmic Complexity
- Sorting Algorithms
- Dummy Node Technique
- Backtracking
- Union-Find - Find-A-Complete-Guide)
- Dijkstra Algorithm
- Minimum Spanning Tree
- Bit Manipulation Techniques
- Important Graph Algorithms
- Arrays
- Linked List
- Graph Theory
- Stacks
- Binary Tree
- Binary Search Tree
- Algorithmic Complexity
- Arrays
- Bit Manipulation Techniques
- Sorting Algorithms
- Linked List
- Stacks
- Queues
- Hash Tables
- Binary Tree
- Binary Search Tree
- Heaps
- Recursion
- Backtracking
- Tries
- Binary Search
- Greedy Algorithm
- Dynamic Programming
- Graph Theory
- DFS Traversal
- BFS Traversal
- Union-Find
- Dijkstra Algorithm
Fundamental Concepts
📎 LeetCode Extensions
LeetCode Extensions
💻 Must-Do Problems (Topic Wise)
Backtracking
- Permutations
- Subsets
- Generate Parentheses
- Combination Sum
- Palindrome Partitioning
- Letter Combinations of a Phone Number
- Unique Binary Search Trees II
- Partition to K Equal Sum Subsets
- N-Queens II
- Sudoku Solver
Binary Trees
- Invert Binary Tree
- Convert Sorted Array to Binary Search Tree
- Count Complete Tree Nodes
- All Possible Full Binary Trees
- Delete Leaves With a Given Value
- Binary Search Tree Iterator
- Longest Univalue Path
- Delete Nodes And Return Forest
- Validate Binary Search Tree
- Construct Binary Tree from Inorder and Postorder Traversal
- All Nodes Distance K in Binary Tree
- Maximum Difference Between Node and Ancestor
- Find Duplicate Subtrees
- Flatten Binary Tree to Linked List
- House Robber III
- Step-By-Step Directions From a Binary Tree Node to Another
- Delete Node in a BST
- Populating Next Right Pointers in Each Node II
- Trim a Binary Search Tree
- Distribute Coins in Binary Tree
- Binary Search Tree to Greater Sum Tree
- Serialize and Deserialize Binary Tree
- Binary Tree Cameras
- Binary Tree Maximum Path Sum
- Maximum Sum BST in Binary Tree
Linked List
- Reverse Linked List
- Linked List Cycle
- Merge Two Sorted Lists
- Intersection of Two Linked Lists
- Remove Nth Node From End of List
- Add Two Numbers
- Copy List with Random Pointer
- Flatten a Multilevel Doubly Linked List
- Rotate List
- Sort List
- Remove Duplicates from Sorted List II
- LRU Cache
- Design Browser History
- Merge k Sorted Lists
- Reverse Nodes in k-Group
Tries
📝 Must-Read Leetcode Articles
📩 Newsletter
🚀 Patterns
- 14 Coding Interview Patterns
- Tree Patterns
- Tree Iterative Traversal
- Tree Question Pattern
- Graph Patterns
- DFS + BFS Patterns (1)
- DFS + BFS Patterns (2)
- Fast and Slow Pointers Pattern
- Prefix Sum Pattern
- 15 Leetcode Patterns
- Prefix Sum Pattern
- Two Pointers Pattern
- Linked List In-place Reversal Pattern
- Sliding Window Pattern
- 20 DP Patterns
- Top 'K' Elements Pattern
- Monotonic Stack Pattern
- Overlapping Intervals Pattern
- Backtracking Pattern
- Modified Binary Search Pattern
- Prefix Sum Pattern
- Top 'K' Elements Pattern
- Fast and Slow Pointers Pattern
- Kadane's Algorithm
- Linked List In-place Reversal Pattern
- Monotonic Stack Pattern
- Two Pointers Pattern
- Sliding Window Pattern
- Two Pointers Pattern
- Sliding Window Pattern
- Prefix Sum Pattern
- Fast and Slow Pointers Pattern
- Top 'K' Elements Pattern
- Kadane's Algorithm
- Linked List In-place Reversal Pattern
- Monotonic Stack Pattern
- Two Pointers Pattern
- Sliding Window Pattern
- Prefix Sum Pattern
- Fast and Slow Pointers Pattern
- Top 'K' Elements Pattern
- Kadane's Algorithm
- Linked List In-place Reversal Pattern
- Monotonic Stack Pattern
- Overlapping Intervals Pattern