📘 DSA-Sheet

✅ Day 1: Array & String Fundamentals

✅ Day 2: String & HashMap Fundamentals

✅ Day 3: String & Loops

✅ Day 4: String, Two Pointers, Sliding Window

✅ Day 5: String Practice

✅ Day 6: Palindromic Patterns & Substring Practice

✅ Day 7: Binary Search for Interviews

✅ Day 8: Binary Search Practice

✅ Day 9: Binary Search Variations & Greedy

✅ Day 10: Binary Search on Answer

✅ Day 11: Binary Search on Answer – Continued

✅ Day 12: Hash table & Number Theory

✅ Day 13: Math & Hash table

✅ Day 14: Matrix & 2D Arrays

✅ Day 15: Matrix & Traversals Practice

✅ Day 16: Matrix Validation, Stack & Queue

✅ Day 17: Monotonic Stack

✅ Day 18: Matrix Operations & Validation

✅ Day 19: Stack, Queue & Element Comparison

✅ Day 20: Strings, Encoding & Stack-Based Scoring

✅ Day 21: Greedy & Stack-based Decisions

✅ Day 22: Design & Sliding Window

✅ Day 23: Stack & Backtracking

✅ Day 24: Greedy & DP Transitions

✅ Day 25: Recursion & Stack Simulation

✅ Day 26: DP Transitions – Easy to Medium

✅ Day 27: Triangle Patterns & Edit Distance

✅ Day 28: Recursion & Minimum Path DP

✅ Day 29: Power Checks using Math & Bitwise

✅ Day 30: Game Theory & String Simulation

✅ Day 31: Coin Game & Math Simulation

✅ Day 32: Number Construction & Set Logic

✅ Day 33: Arrays & Dynamic Programming

✅ Day 34: DP – Word Segmentation & Circular Robbery

✅ Day 35: Linked List – Fundamentals & Techniques

✅ Day 36: Linked List – Advanced Operations

✅ Day 37: Linked List – Pointer Manipulation & Variants

✅ Day 38: Linked List – Arithmetic & Intersection

✅ Day 39: Binary Tree – Traversal & Construction

✅ Day 40: Binary Tree – Comparison & Symmetry

✅ Day 41: Binary Tree – Transformation & Path Sum

✅ Day 42: Binary Tree – Diameter & Depth

✅ Day 43: Dynamic Programming – Coin Change Variants

✅ Day 44: Graph – Foundations & Tree Validation

✅ Day 45: Graph – DFS, Cloning & Connected Components

✅ Day 46: Tree & N-ary Tree – Depth & BST

✅ Day 47: Tree – Perimeter, Leaves & Grids

✅ Day 48: Graph – Topological Sort & Island Count

✅ Day 49: Tree Traversal & Bit Manipulation

✅ Day 50: Graph – BFS & Tree Height

✅ Day 51: N-ary Tree & Stack Patterns

✅ Day 52: Advanced DFS – Equalizing Leaves & Enclaves

✅ Day 53: Islands & String Manipulation

✅ Day 54: BST Validation & N-ary Trees

✅ Day 55: Tree Paths & Traversals

✅ Day 56: Tree Depth & Number Systems

✅ Day 57: Tree Balance & Probability

✅ Day 58: Number Theory & Heap Operations

✅ Day 59: Streams & Rankings

✅ Day 60: Array Products & Frequency Analysis

✅ Day 61: Bit Manipulation Fundamentals

✅ Day 62: Graph Fundamentals & BFS

✅ Day 63: BFS Patterns & Cycle Detection

✅ Day 64: DFS & Advanced Graph Algorithms

✅ Day 65: Tree Views & Distribution

✅ Day 66: Cycle Detection & Topological Sort

✅ Day 67: Shortest Path Algorithms

✅ Day 68: All-Pairs Shortest Path & Tree Construction

✅ Day 69: Tree Construction & MST

✅ Day 70: BST Operations & Cache Design

✅ Day 71: Trie Data Structure

✅ Day 72: Trie Applications & Strongly Connected Components

✅ Day 73: Math & Greedy Optimization

✅ Day 74: Sliding Window & Fruit Collection

✅ Day 75: Advanced Fruit Collection Patterns

✅ Day 76: Dynamic Programming & Probability

✅ Day 77: Number Theory & Powers

✅ Day 78: String Pattern Matching