DSA 1-Week Crash Course Roadmap
Day 1: Arrays & Strings
Concepts: Sliding window, two pointers, prefix sum, sorting.
Practice:
- Kadane's Algorithm
- Two Sum
- Move Zeroes
- Rotate Array
- Longest Substring Without Repeating Characters
Resources:
- CodeHelp Arrays Playlist: [Link]/playlist?list=PLDzeHZWIZsTryvtXdMr6rPh4IDexB5NIA
- Love Babbar DSA Sheet (Arrays): [Link]/dsa-sheet-by-love-babbar/
Day 2: Hashing + STL/Maps
Concepts: HashMaps, frequency counters, sets.
Practice:
- First/Non-repeating element
- Group Anagrams
- Intersection of Arrays
Resources:
- Hashmaps in C++: [Link]/y5KQ2z-qkfw
- STL Playlist - Apna College: [Link]/playlist?list=PLfqMhTWNBTe0b2nM6JHVCnAkhQRGiZMSJ
Day 3: Recursion + Backtracking
Concepts: Recursion basics, permutations, subsets, N-Queens.
Practice:
- Subset Sum
- Permutations of String
DSA 1-Week Crash Course Roadmap
- Sudoku Solver
- Rat in a Maze
Resources:
- Take U Forward Playlist: [Link]/playlist?list=PLgUwDviBIf0q5w1RYR-Ir8kVfP5yGzH1r
Day 4: Linked Lists + Stacks & Queues
Concepts: Singly/doubly LL, fast-slow pointers, Stack & Queue.
Practice:
- Reverse Linked List
- Detect Cycle
- Valid Parentheses
- Min Stack
- Queue using Stacks
Resources:
- Linked Lists - Apna College: [Link]/oLrs5xD4iI0
- Stacks & Queues - Take U Forward: [Link]/playlist?list=PLgUwDviBIf0qUlt5H_kiKYaNSqJ81PMMY
Day 5: Trees + Binary Search Trees
Concepts: Inorder, Preorder, Postorder, BFS/DFS, BSTs.
Practice:
- Level Order Traversal
- Diameter of Tree
- LCA
- Validate BST
Resources:
- Trees & BST - Take U Forward: [Link]/playlist?list=PLgUwDviBIf0qYbL4TBaEWgb-ljVdhkM7R
DSA 1-Week Crash Course Roadmap
Day 6: Searching & Sorting
Concepts: Binary Search, Merge Sort, Quick Sort, sorting logic.
Practice:
- Binary Search Rotated Array
- Kth Largest Element
- Merge Intervals
- Search in Matrix
Resources:
- Binary Search - Take U Forward: [Link]/playlist?list=PLgUwDviBIf0qYbL4TBaEWgb-ljVdhkM7R
- Sorting - Apna College: [Link]/playlist?list=PLfqMhTWNBTe3LtFWcvwpqTkUSlB32kJop
Day 7: Graphs + DP Basics
Concepts: BFS, DFS, Disjoint Set, Recursion to DP.
Practice:
- Detect Cycle
- Number of Islands
- 0/1 Knapsack
- Longest Increasing Subsequence
Resources:
- Graphs - CodeHelp: [Link]/playlist?list=PLDzeHZWIZsTo87y1ytEAqp7wYlEP3nner
- DP - Aditya Verma: [Link]/playlist?list=PL_z_8CaSLPWekqhdCPmFohncHwz8TY2Go
