Connect with me on LinkedIn | Connect with me on X ( twitter)
This repository contains LeetCode resources which are useful during interview preparation.- Linked List
- Queues
- Stacks
- Hash Tables
- Heaps
- Recursion
- Trees
- Tries
- Binary Search
- Dynamic Programming
- Graph Theory
- DFS Traversal
- BFS Traversal
- Dijkstra Algorithm
- 14 Coding Interview Patterns
- Sliding Window patterns
- Two Pointers Patterns
- Substring Problem Patterns
- Dynamic Programming Patterns
- Binary Search Patterns
- Backtracking Patterns
- Tree Patterns
- Graph Patterns
- Monotonic Stack Patterns
- Bit Manipulation Patterns
- String Question Patterns
- DFS + BFS Patterns (1)
- DFS + BFS Patterns (2)
- Stock Series Patterns
- LeetCode Timer: Easily time your leetcode practise sessions with automatic time setting based on difficulty.
- LeetCode Video Solutions: Watch free LeetCode video ▶ solutions on the problem page itself.
- LeetCode Format: Adds Format code button on leetcode to format the code using Prettier code formatter.
- LeetHub v2: Automatically integrate your Leetcode & GeeksforGeeks submissions to GitHub.
- LeetCode VS Code Extension: Solve LeetCode problems in VS Code.
- 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
- 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
- Implement Trie (Prefix Tree)
- Longest Common Prefix
- Search Suggestions System
- Longest Word in Dictionary
- Top K Frequent Words
- Design Add and Search Words Data Structure
- Implement Magic Dictionary
- Replace Words
- Word Search II
- Stream of Characters
Your contributions are most welcome!