[go: up one dir, main page]
Scribd
Upload
105 views4 pages

DSA Learning Plan

Uploaded by

barbighaparsobigha
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
105 views4 pages

DSA Learning Plan

Uploaded by

barbighaparsobigha
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

2-Month DSA Learning Plan (1 Video per Day)

This is a 2-month learning plan for Data Structures and Algorithms (DSA). Each day you will watch 1

video from the provided playlist.

The playlist consists of 56 videos, and the goal is to cover them over 60 days with 1 video per day.

Link to Playlist: https://youtube.com/playlist?list=PLfqMhTWNBTe137I_EPQd34TsgV6IO55pt

Week 1: Basics (Day 1-7)

Day 1-7: Watch introductory videos about DSA, Arrays, Time Complexity, and Big-O notation.

Each video will cover the following:

1. What is DSA and Introduction to Time Complexity?

2. Arrays - Introduction and Basic Operations

3. Time Complexity and Space Complexity

4. Sorting Algorithms - Bubble Sort, Insertion Sort, Selection Sort

5. Searching Algorithms - Linear Search, Binary Search

6. Introduction to Strings and String Operations

7. Basic String Problems - Palindrome, Anagram

Week 2: Recursion and Backtracking (Day 8-14)

Day 8-14: Watch videos on Recursion and Backtracking.

Each video will cover:

1. Introduction to Recursion - Basics and Examples

2. Recursion - Factorial and Fibonacci Series


3. Recursion - Power of a Number, Tower of Hanoi

4. Backtracking - N-Queens Problem

5. Backtracking - Subset Sum Problem

6. Backtracking - Rat in a Maze Problem

7. Backtracking - Permutations and Combinations

Week 3: Stacks, Queues, and Linked Lists (Day 15-21)

Day 15-21: Watch videos on Stacks, Queues, and Linked Lists.

Each video will cover:

1. Stacks - Basic Operations, Applications

2. Queues - FIFO Concept, Circular Queue

3. Linked Lists - Introduction, Singly Linked List

4. Linked Lists - Doubly Linked List

5. Linked Lists - Reverse a Linked List, Detect Cycle

6. Stacks and Queues - Problems

7. Linked Lists - Merge Two Sorted Lists

Week 4: Trees and Binary Search Trees (Day 22-28)

Day 22-28: Watch videos on Binary Trees and Binary Search Trees (BST).

Each video will cover:

1. Introduction to Binary Trees and Traversals

2. Pre-order, In-order, Post-order Traversals

3. Binary Search Trees - Introduction and Insertion

4. Binary Search Trees - Deletion and Searching

5. Binary Trees - Height, Diameter, and Depth

6. Binary Search Trees - Validate BST


7. Binary Search Trees - Lowest Common Ancestor

Week 5: Advanced Data Structures (Day 29-35)

Day 29-35: Watch videos on Heaps, Priority Queues, and Graphs.

Each video will cover:

1. Introduction to Heaps - Min-Heap, Max-Heap

2. Heaps - Insertion, Deletion, and Extract

3. Priority Queues - Applications and Implementations

4. Graph Representation - Adjacency List, Matrix

5. Graph Traversals - BFS, DFS

6. Graph Problems - Connected Components, Cycle Detection

7. Graph Algorithms - Dijkstra's Shortest Path

Week 6: Dynamic Programming (Day 36-42)

Day 36-42: Watch videos on Dynamic Programming (DP).

Each video will cover:

1. Introduction to DP - Fibonacci Series

2. Knapsack Problem - 0/1 Knapsack

3. Subset Sum Problem

4. Longest Increasing Subsequence

5. Longest Common Subsequence

6. Matrix Chain Multiplication

7. Coin Change Problem

Week 7-8: Revision and Practice (Day 43-56)


Day 43-56: These days will focus on revision and solving problems from each topic.

1. Review all topics covered in previous weeks.

2. Solve at least 5 problems per topic on platforms like LeetCode or HackerRank.

3. Focus on Mock Tests and Time-based Coding Contests.

4. Spend 2-3 days doing a complete review of all data structures and algorithms.

You might also like