[go: up one dir, main page]

0% found this document useful (0 votes)
73 views6 pages

DSA 30 Day LeetCode Revision Complete

The document outlines a comprehensive 30-day revision plan for Data Structures and Algorithms (DSA) using 90+ LeetCode problems across various key patterns such as Arrays, Strings, Trees, and Graphs. Each day includes a specific set of problems to solve, culminating in a mock interview on the final day. The plan is designed to enhance problem-solving skills and prepare for technical interviews.

Uploaded by

yadavchandan6104
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)
73 views6 pages

DSA 30 Day LeetCode Revision Complete

The document outlines a comprehensive 30-day revision plan for Data Structures and Algorithms (DSA) using 90+ LeetCode problems across various key patterns such as Arrays, Strings, Trees, and Graphs. Each day includes a specific set of problems to solve, culminating in a mock interview on the final day. The plan is designed to enhance problem-solving skills and prepare for technical interviews.

Uploaded by

yadavchandan6104
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/ 6

Complete 30-Day DSA Revision Plan (LeetCode)

This plan provides a complete revision schedule of 90+ LeetCode problems across all key patterns:

Arrays, Strings, Trees, Graphs, DP, and more.


Day-wise Problem Breakdown

Day 1

- LC 1 - Two Sum

- LC 121 - Best Time to Buy and Sell Stock

- LC 53 - Maximum Subarray

Day 2

- LC 217 - Contains Duplicate

- LC 128 - Longest Consecutive Sequence

- LC 169 - Majority Element

Day 3

- LC 238 - Product of Array Except Self

- LC 560 - Subarray Sum Equals K

- LC 76 - Minimum Window Substring

Day 4

- LC 3 - Longest Substring Without Repeating Characters

- LC 567 - Permutation in String

- LC 424 - Longest Repeating Character Replacement

Day 5

- LC 283 - Move Zeroes

- LC 26 - Remove Duplicates from Sorted Array

- LC 80 - Remove Duplicates II

Day 6

- LC 75 - Sort Colors

- LC 11 - Container With Most Water


- LC 42 - Trapping Rain Water

Day 7

- LC 14 - Longest Common Prefix

- LC 6 - Zigzag Conversion

- LC 28 - Find the Index of the First Occurrence

Day 8

- LC 20 - Valid Parentheses

- LC 150 - Evaluate Reverse Polish Notation

- LC 155 - Min Stack

Day 9

- LC 1047 - Remove All Adjacent Duplicates

- LC 232 - Implement Queue using Stacks

- LC 239 - Sliding Window Maximum

Day 10

- LC 17 - Letter Combinations of a Phone Number

- LC 46 - Permutations

- LC 77 - Combinations

Day 11

- LC 22 - Generate Parentheses

- LC 39 - Combination Sum

- LC 40 - Combination Sum II

Day 12

- LC 78 - Subsets

- LC 90 - Subsets II
- LC 131 - Palindrome Partitioning

Day 13

- LC 51 - N-Queens

- LC 37 - Sudoku Solver

Day 14

- LC 200 - Number of Islands

- LC 695 - Max Area of Island

- LC 733 - Flood Fill

Day 15

- LC 104 - Maximum Depth of Binary Tree

- LC 226 - Invert Binary Tree

- LC 101 - Symmetric Tree

Day 16

- LC 102 - Binary Tree Level Order Traversal

- LC 103 - Zigzag Level Order Traversal

- LC 199 - Binary Tree Right Side View

Day 17

- LC 112 - Path Sum

- LC 437 - Path Sum III

- LC 124 - Binary Tree Maximum Path Sum

Day 18

- LC 98 - Validate BST

- LC 230 - Kth Smallest in BST

- LC 236 - LCA of Binary Tree


Day 19

- LC 617 - Merge Two Binary Trees

- LC 105 - Construct Binary Tree

- LC 106 - Construct Binary Tree II

Day 20

- LC 743 - Network Delay Time

- LC 133 - Clone Graph

- LC 207 - Course Schedule

Day 21

- LC 684 - Redundant Connection

- LC 1584 - Min Cost to Connect All Points

- LC 332 - Reconstruct Itinerary

Day 22

- LC 70 - Climbing Stairs

- LC 746 - Min Cost Climbing Stairs

- LC 198 - House Robber

Day 23

- LC 213 - House Robber II

- LC 337 - House Robber III

- LC 91 - Decode Ways

Day 24

- LC 300 - Longest Increasing Subsequence

- LC 1143 - Longest Common Subsequence

- LC 139 - Word Break


Day 25

- LC 62 - Unique Paths

- LC 64 - Minimum Path Sum

- LC 322 - Coin Change

Day 26

- LC 309 - Best Time to Buy and Sell Stock with Cooldown

- LC 123 - Best Time to Buy and Sell Stock III

- LC 188 - Stock IV

Day 27

- LC 44 - Wildcard Matching

- LC 10 - Regular Expression Matching

Day 28

- Final Revision Day: Mix 3 Problems from Any Pattern You Struggle With

Day 29

- LC 1091 - Shortest Path in Binary Matrix

- LC 329 - Longest Increasing Path in Matrix

- LC 120 - Triangle

Day 30

- Mock Interview Day: Choose 2 Random Medium + 1 Hard Problem from LeetCode Random

You might also like