📚 Data Structures and Algorithms

This repository contains my personal notes on data structures and algorithms.

🚀 Syllabus

• Syllabus

---

📝 Notes Index

Click any topic below to open the note 👇

---

🚀 Core Concepts & Foundations

• Time Complexity
• Space Complexity
• Log n Explained
• Variables Take Extra Memory
• Integer.MIN_VALUE & Integer.MAX_VALUE
• Pigeonhole Principle
• GCD - Euclid’s Algorithm
• Polynomial

---

🛠️ Problem Solving Techniques

• 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

---

🧩 Data Structures

• Array vs List
• Binary Tree
• Heap
• Deque

---

🔍 Searching & Traversals

• Binary Search
• DFS
• BFS
• Inorder Traversal
• Path Sum
• Maximum Depth of a Binary Tree
• Dutch National Flag Algorithm

---

📊 Sorting Algorithms

• How to Choose the Right Sorting Algorithm
• Quick Sort
• Merge Sort vs Quick Sort
• Selection Sort
• Bucket Sort
• Sieve of Eratosthenes

---

🔢 Number Theory & Bitwise

• Digital Root Formula
• Power of Two
• Add Binary Numbers

---

📏 Array & Subarray Techniques

• Kadane's Algorithm
• Maximum Subarray
• Two Pointers

---

🌌 Subsets, Combinations & Permutations

• Permutation vs Combination
• Power Set
• Subsets - Recursion & Backtracking
• Combination Sum II
• Letter Case Permutation

---

🧩 Matrix & Geometry

• Rotate Matrix By Degree

---

🗂️ Resources & Miscellaneous

• LeetCode - DSA Topic Wise Questions (PDF)
• Strategy - System Design
• Useful Tricks
• Userful Regex
• Ugly Number II