5-Month DSA Study Timetable
DSA Foundation
Date Range Topic Details / Progress
Aug 15 - Aug 26 Basics of Java Focus on Java syntax,
control structures (loops,
conditionals), and OOP
principles (classes, objects,
inheritance, etc.).
Date Range Topic Details / Progress
Aug 27 - Sep 10 Data Structures 1 Aug 27 - Aug 31: Study
Arrays.
Sep 01 - Sep 05: Study
Strings and Bit
Manipulation.
Sep 06 - Sep 10: Focus on
HashMap.
Date Range Topic Details / Progress
Sep 11 - Sep 28 Recursion, Searching, and Explore recursion
Sorting techniques, linear and
binary search algorithms,
and sorting algorithms
(bubble, merge, quick, etc.).
Date Range Topic Details / Progress
Sep 29 - Oct 13 Data Structures 2 Sep 29 - Oct 03: Study
LinkedList and Stacks.
Oct 04 - Oct 08: Study
Queues and Trees.
Oct 09 - Oct 13: Focus on
Heaps.
DP & Graphs
Date Range Topic Details / Progress
Oct 14 - Oct 28 DP & Graphs Learn dynamic
programming techniques
and basic graph algorithms
(BFS, DFS).
DSA Level Up
Date Range Topic Details / Progress
Oct 29 - Nov 07 Arrays and Bit Manipulation Focus on advanced array
problems and bit
manipulation techniques.
Date Range Topic Details / Progress
Nov 08 - Nov 22 Math, Recursion, and Strengthen understanding
Backtracking of mathematical problems,
advanced recursion, and
backtracking strategies.
Date Range Topic Details / Progress
Nov 23 - Dec 02 Searching and Sorting Revisit searching and
sorting with more complex
problems, focusing on
optimizations.
Date Range Topic Details / Progress
Dec 03 - Dec 12 HashMap and Two Pointers Study advanced HashMap
problems and the Two
Pointers technique.
DSA Level Up 2
Date Range Topic Details / Progress
Dec 13 - Dec 22 LinkedList, Stack, and Dive deeper into
Queue LinkedLists, Stacks, and
Queues, solving more
challenging problems.
Date Range Topic Details / Progress
Dec 23 - Jan 01 Tree and Trie Study trees (BST, AVL, etc.)
and tries in-depth, with a
focus on implementation
and problem-solving.
Date Range Topic Details / Progress
Jan 02 - Jan 11 Heaps and Greedy Learn heaps (min-heap,
max-heap) and greedy
algorithms, solving complex
problems.
Date Range Topic Details / Progress
Jan 12 - Jan 21 DP and Graphs Finalize learning with
advanced dynamic
programming and graph
problems (Dijkstra, Floyd-
Warshall, etc.).
Final Review and Practice
Date Range Topic Details / Progress
Jan 22 - Feb 05 Final Review and Practice Use the remaining days for
revision, solving practice
problems, and mock
interviews.