[go: up one dir, main page]
Scribd
Upload
25 views5 pages

DSA 1month Revision Plan v2

The document outlines a 1-month revision plan for Data Structures and Algorithms (DSA), organized by topics such as Arrays, Recursion, Linked Lists, Binary Search, Heaps, Stacks, Queues, Strings, Trees, Graphs, Dynamic Programming, Greedy Algorithms, Backtracking, and Binary Search Trees. Each day focuses on specific problems and concepts within these topics, providing a structured approach to mastering DSA. The final day is dedicated to revision, practice, and addressing weak areas.

Uploaded by

Neelesh Singh Thakur
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
25 views5 pages

DSA 1month Revision Plan v2

The document outlines a 1-month revision plan for Data Structures and Algorithms (DSA), organized by topics such as Arrays, Recursion, Linked Lists, Binary Search, Heaps, Stacks, Queues, Strings, Trees, Graphs, Dynamic Programming, Greedy Algorithms, Backtracking, and Binary Search Trees. Each day focuses on specific problems and concepts within these topics, providing a structured approach to mastering DSA. The final day is dedicated to revision, practice, and addressing weak areas.

Uploaded by

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

1-Month DSA Revision Plan

Day 1: Arrays Part 1


- Set Matrix Zero

- Pascal's Triangle

- Next Permutation

- Kadane's Algorithm

Day 2: Arrays Part 2


- Sort Colors

- Stock Buy and Sell

- Rotate Matrix

- Merge Intervals

Day 3: Arrays Part 3


- Find Duplicate

- Merge Sorted Arrays

- Missing and Repeating Number

- Count Inversions

Day 4: Arrays Part 4


- Subarray with XOR

- Longest Consecutive Sequence

- Maximum Product Subarray

Day 5: Recursion Part 1


- Subset Sum

- Combination Sum

- Palindrome Partitioning

Day 6: Recursion Part 2


- N Queens

- Sudoku Solver
- Word Break

Day 7: Linked List Part 1


- Reverse Linked List

- Middle of Linked List

- Merge Two Sorted Lists

Day 8: Linked List Part 2


- Remove Nth Node

- Detect Cycle

- Reverse in K Groups

Day 9: Linked List Part 3


- Find Intersection

- Flatten a Linked List

- Clone a Random List

Day 10: Binary Search Part 1


- Binary Search Basics

- Search in Rotated Array

- Median of Two Sorted Arrays

Day 11: Binary Search Part 2


- Allocate Books

- Aggressive Cows

- Find Nth Root

Day 12: Heaps


- Kth Largest Element

- Merge K Sorted Arrays

- Top K Frequent Elements

Day 13: Stack and Queue Part 1


- Valid Parentheses

- Next Greater Element


- LRU Cache

Day 14: Stack and Queue Part 2


- Sliding Window Maximum

- Rotten Oranges

- Stock Span Problem

Day 15: Strings Part 1


- Longest Substring Without Repeat

- Rabin Karp Algorithm

- Check Anagram

Day 16: Strings Part 2


- Z Algorithm

- KMP Pattern Search

- Longest Palindromic Substring

Day 17: Trees Part 1


- Inorder Traversal

- Preorder Traversal

- Postorder Traversal

- Level Order Traversal

Day 18: Trees Part 2


- Diameter of Binary Tree

- Lowest Common Ancestor

- Check Balanced Tree

Day 19: Trees Part 3


- Binary Tree to DLL

- Serialize and Deserialize

- Right View of Binary Tree

Day 20: Graphs Part 1


- DFS
- BFS

- Cycle Detection (Undirected)

- Cycle Detection (Directed)

Day 21: Graphs Part 2


- Topological Sort

- Shortest Path (Dijkstra)

- MST (Prim’s Algorithm)

Day 22: Graphs Part 3


- Flood Fill

- Number of Islands

- Word Ladder

Day 23: Dynamic Programming Part 1


- 0/1 Knapsack

- Subset Sum Problem

- Equal Partition Problem

Day 24: Dynamic Programming Part 2


- Longest Increasing Subsequence

- Longest Common Subsequence

- Rod Cutting

Day 25: Dynamic Programming Part 3


- House Robber

- Maximum Path Sum

- Edit Distance

Day 26: Greedy Algorithms


- Activity Selection

- Job Sequencing Problem

- Fractional Knapsack
Day 27: Backtracking
- Permutations

- Combination Sum

- Rat in a Maze

Day 28: Binary Search Tree


- Search in BST

- Insert into BST

- Delete Node in BST

Day 29: Miscellaneous


- Power of Two

- Count Set Bits

- Square Root Using Binary Search

Day 30: Revision & Practice


- Revisit Weak Topics

- Mock Test

- Q&A Discussion

You might also like