Collection of LeetCode questions to ace the coding interview! - Created using LeetHub
Other Resources (DSA):
- NeetCode Roadmap
- Data Structures and Algorithms, Spring 2024
- Cracking The Coding Interview
- Cracking The Coding Interview 6th Edition In LeetCode
- DSA - My Notes on Notion
Contains but not limited to:
- Static Arrays
- Dynamic Arrays
- Stacks
- Kadane's Algorithm
- Sliding Window Fixed
- Sliding Window Variable
- Two Pointers
- Prefix Sums
- Monotonic Stacks
- Singly Linked Lists
- Doubly Linked Lists
- Queues
- Fast and Slow Pointers
- Floyd's Tortoise and Hare Algorithm
- Insertion Sort
- Selection Sort
- Merge Sort
- Quick Sort
- Quick Select
- Partitioning
- Bucket Sort
- Search Array
- Search Range
- Binary Tree
- Binary Search Trees (BST)
- BST Insert And Remove
- Depth-First Search (DFS)
- Breadth-First Search (BFS)
- Trie
- Union Find (Disjoint Set)
- Segment Tree
- Iterative DFS
- Backtracking Search
- Generative Recursion
- Subsets
- Combinations
- Permutation
- Heap Properties
- Push And Pop
- Heapify
- Two Heaps
- HashMap
- HashSet
- Hash Implementation
- Adjacency Matrices
- Matrix DFS
- Matrix BFS
- Adjacency List
- Dijkstra's Algorithm
- Prim's Algorithm
- Kruskal's Algorithm
- Topological Sort
- Brute Force
- Memoization (Top-down)
- Tabulation (Bottom-Up)
- 1-Dimension DP
- 2-Dimension DP
- 0/1 Knapsack
- Unbounded Knapsack
- Longest Common Subsequence (LCS)
- Longest Increasing Subsequence (LIS)
- Longest Palindrome Subsequence (LPS)
- Palindromes
- Bit Manipulation
- Greedy Algorithms
- Intervals