[go: up one dir, main page]

0% found this document useful (0 votes)
17 views4 pages

8_Week_DSA_Timetable

The document outlines an 8-week timetable for beginners to learn Data Structures and Algorithms (DSA), dedicating 2-3 hours daily. Each week focuses on different topics such as arrays, strings, recursion, sorting, linked lists, stacks, trees, and graphs, with specific daily tasks and problem-solving exercises. The schedule includes weekly reviews to reinforce learning and assess progress.

Uploaded by

binod spammer
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
17 views4 pages

8_Week_DSA_Timetable

The document outlines an 8-week timetable for beginners to learn Data Structures and Algorithms (DSA), dedicating 2-3 hours daily. Each week focuses on different topics such as arrays, strings, recursion, sorting, linked lists, stacks, trees, and graphs, with specific daily tasks and problem-solving exercises. The schedule includes weekly reviews to reinforce learning and assess progress.

Uploaded by

binod spammer
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

8-Week DSA Timetable for Beginners

This 8-week DSA timetable is designed for beginners to build a strong foundation in
Data Structures and Algorithms (DSA). Dedicate 2–3 hours daily to cover topics, solve
problems, and revise for optimal learning.

Week 1: Arrays and Basic Mathematics


Day Topics / Questions to Solve Time (Hours)
Day 1 Array traversal, finding 2
max/min in an array
Day 2 Reverse an array, check if 2
the array is sorted
Day 3 Kth smallest/largest 3
element, Sieve of
Eratosthenes
Day 4 Practice questions on 3
arrays from LeetCode
(Easy-Medium)
Day 5 Solve GCD/LCM problems, 2
check for prime numbers
Day 6 Revise all concepts and 3
practice more problems
Day 7 Weekly review with a mix 3
of Easy and Medium
problems

Week 2: Strings and Hashing


Day Topics / Questions to Solve Time (Hours)
Day 1 String basics, reverse a 2
string, check if it’s a
palindrome
Day 2 Count character 2
frequencies, anagram
checks
Day 3 Longest substring without 3
repeating characters
Day 4 Practice Easy-Medium 3
string problems on
LeetCode
Day 5 Introduction to Hashmaps: 3
frequency-based problems
Day 6 Revise all concepts and 3
solve new problems
Day 7 Weekly review with mixed 3
questions (mock test)
Week 3: Recursion and Backtracking
Day Topics / Questions to Solve Time (Hours)
Day 1 Basics of recursion: 2
factorial, Fibonacci
Day 2 Generate subsets of an 3
array
Day 3 Permutations of a string 3
Day 4 N-Queens problem 3
Day 5 Solve backtracking 3
problems from LeetCode
(Medium-Hard)
Day 6 Revise 3
recursion/backtracking
concepts
Day 7 Weekly review with mixed 3
problems

Week 4: Searching and Sorting


Day Topics / Questions to Solve Time (Hours)
Day 1 Binary search on sorted 2
arrays
Day 2 Implement Bubble Sort 2
and Selection Sort
Day 3 Solve problems on Search 3
in Rotated Sorted Arrays
Day 4 Learn and implement 3
Merge Sort
Day 5 Count inversions in an 3
array
Day 6 Revise sorting techniques 3
and solve related problems
Day 7 Weekly review with 3
Medium/Hard problems

Week 5: Linked Lists


Day Topics / Questions to Solve Time (Hours)
Day 1 Basics of linked lists: 2
Insertion and Deletion
Day 2 Reverse a linked list 2
Day 3 Merge two sorted linked 3
lists
Day 4 Detect a loop in a linked 3
list
Day 5 Solve problems like adding 3
two numbers represented
by linked lists
Day 6 Revise and practice new 3
problems
Day 7 Weekly review (mix of 3
Medium/Hard problems)

Week 6: Stacks and Queues


Day Topics / Questions to Solve Time (Hours)
Day 1 Implement Stack and 2
Queue using arrays
Day 2 Balanced Parentheses 2
problem
Day 3 Implement Queue using 3
two Stacks
Day 4 Solve Largest Rectangle in 3
Histogram
Day 5 Sliding Window Maximum 3
Day 6 Revise all concepts and 3
solve problems
Day 7 Weekly review with mixed 3
problems

Week 7: Binary Trees


Day Topics / Questions to Solve Time (Hours)
Day 1 Binary tree traversals: 2
Preorder, Inorder,
Postorder
Day 2 Check if two trees are 2
identical
Day 3 Find the height of a binary 3
tree
Day 4 Solve Diameter of a Binary 3
Tree problem
Day 5 Lowest Common Ancestor 3
problem
Day 6 Revise and practice tree- 3
based problems
Day 7 Weekly review 3
(Medium/Hard problems)

Week 8: Graphs
Day Topics / Questions to Solve Time (Hours)
Day 1 Learn BFS traversal 2
Day 2 Learn DFS traversal 2
Day 3 Solve problems on cycle 3
detection in undirected
graphs
Day 4 Solve Dijkstra's shortest 3
path algorithm
Day 5 Implement and solve 3
Topological Sort
Day 6 Revise all graph concepts 3
Day 7 Final weekly review (mock 3
problems)

You might also like