This repository contains my personal notes on data structures and algorithms.
Click any topic below to open the note 👇
- Time Complexity
- Space Complexity
- Log n Explained
- Variables Take Extra Memory
- Integer.MIN_VALUE & Integer.MAX_VALUE
- Pigeonhole Principle
- GCD - Euclid’s Algorithm
- Polynomial
- Recursion Over Loop
- Divide and Conquer
- Divide and Conquer vs Dynamic Programming
- Dynamic Programming (DP)
- Memoization - DP
- Backtracking
- Bit Masking
- Tortoise and Hare Algorithm
- Boyer-Moore Voting Algorithm
- Binary Search
- DFS
- BFS
- Inorder Traversal
- Path Sum
- Maximum Depth of a Binary Tree
- Dutch National Flag Algorithm
- How to Choose the Right Sorting Algorithm
- Quick Sort
- Merge Sort vs Quick Sort
- Selection Sort
- Bucket Sort
- Sieve of Eratosthenes
- Permutation vs Combination
- Power Set
- Subsets - Recursion & Backtracking
- Combination Sum II
- Letter Case Permutation