Leetcode
- š Day 1: Introduction to Algorithms & Big O Notation
- š Day 2: Big O Notation ā O(1), O(n), O(nĀ²)
- š Day 4: Array Patterns ā Two Pointers and Sliding Window
- šļø Day 3: Arrays ā Indexing, Iteration, and Basic Operations
- šļø Day 5: Prefix Sum and Difference Arrays
- šļø Day 6: Binary Search Fundamentals
- šļø Day 7: Sliding Window Technique
- šļø Day 8: Two Pointers Pattern
- šļø Day 9: Fast & Slow Pointers (Tortoise and Hare)
- šļø Day 10: Sliding Window Technique
- šļø Day 11: Prefix Sum Technique
- šļø Day 12: Two Pointers Technique
- šļø Day 13: Binary Search Basics
- šļø Day 14: Binary Search Variants
- šļø Day 15: Binary Search on Answers
- šļø Day 16: Recursion
- šļø Day 17: Backtracking
- šļø Day 18: Memoization & Dynamic Programming (DP) Introduction
- šļø Day 19: House Robber Pattern
- šļø Day 20: House Robber II (Circular Houses)
- šļø Day 21: Climbing Stairs Variants
- šļø Day 22: Frog Jump with Minimum Energy
- šļø Day 23: 0/1 Knapsack Intro
- šļø Day 24: DP on Subsequences
- šļø Day 25: Permutations ā DFS on All Orders
- šļø Day 26: Backtracking with Constraints ā N-Queens, Sudoku
- šļø Day 27: Permutations and Combinations with Backtracking
- šļø Day 28: Subsets and Power Set
- šļø Day 29: Word Break with DP + Trie
- šļø Day 30: Palindrome Partitioning with Backtracking
- šļø Day 31: Dynamic Programming on Palindromic Substrings
- šļø Day 32: Palindromic Substrings with Center Expansion
- šļø Day 33: Longest Palindromic Substring
- šļø Day 34: Palindrome Partitioning with Backtracking
- šļø Day 35: Word Break with Memoized Recursion
- šļø Day 36: Word Break II ā Return All Segmentations
- šļø Day 37: Decode Ways ā DP on Strings with Numbers
- šļø Day 38: Palindrome Partitioning ā All Ways to Split
- šļø Day 39: DP + Backtracking ā Palindrome Partitioning II (Min Cuts)
- šļø Day 40: Hard DP ā Burst Balloons Problem
- šļø Day 41 Bonus: Strings ā Manipulation and Character Operations
- šļø Day 42 Bonus: Arrays ā Advanced Operations and Two-Pointer Techniques
- šļø Day 43 Bonus: Strings ā Manipulation and Pattern Matching Techniques
- šļø Day 44 Bonus: Hash Maps ā Keys, Values, and O(1) Lookup Magic
- š§ 40-Day Algorithm & LeetCode Learning Review
- š§ 40-Day Algorithm & LeetCode Learning Review with Exercises