A complete guide to Data Structures and Algorithms (DSA) using JavaScript and TypeScript.
This folder contains categorized problems, explanations, and optimized solutions designed to build strong problem-solving and algorithmic thinking skills for coding interviews.
To master DSA fundamentals and advanced concepts for technical interviews and competitive programming using real-world coding practices.
- Arrays and Strings
- Linked Lists (Singly & Doubly)
- Stack and Queue
- HashMap and Set
- Trees (Binary, BST, AVL)
- Graphs (DFS, BFS, Weighted)
- Heap and Priority Queue
- Trie and Segment Tree
- Sorting (Quick, Merge, Heap, Counting)
- Searching (Binary, Linear, Interpolation)
- Recursion and Backtracking
- Divide and Conquer
- Greedy Algorithms
- Dynamic Programming (Tabulation + Memoization)
- Bit Manipulation
- Sliding Window & Two Pointers
DSA_Master/
│
├── Arrays/
├── Strings/
├── Trees/
├── Graphs/
├── DynamicProgramming/
└── README.md