Scribd
Upload
7 views1 page

DSA

The document outlines a 60-day learning plan for mastering programming concepts and problem-solving techniques. It covers various topics including arrays, strings, linked lists, recursion, sorting, binary search, trees, graphs, and dynamic programming, with specific problems to solve for each topic. The final days are dedicated to revision and practice with mock interview questions.

Uploaded by

tarunvaishnav765
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
7 views1 page

DSA

The document outlines a 60-day learning plan for mastering programming concepts and problem-solving techniques. It covers various topics including arrays, strings, linked lists, recursion, sorting, binary search, trees, graphs, and dynamic programming, with specific problems to solve for each topic. The final days are dedicated to revision and practice with mock interview questions.

Uploaded by

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

Days 1–5: Basics

Choose a language (C++, Java, Python).


Learn Time & Space Complexity (Big-O).
Understand problem-solving techniques.

Days 6–15: Arrays & Strings


Arrays:
Problems: Reverse Array, Kadane’s Algorithm, Two Sum.
Strings:
Problems: Palindrome, Anagram, Longest Substring Without Repeating.

Days 16–25: Linked Lists, Stacks & Queues


Linked Lists:
Problems: Reverse Linked List, Detect Cycle.
Stacks & Queues:
Problems: Valid Parentheses, Implement Queue Using Stacks.

Days 26–30: Recursion & Sorting


Recursion:
Problems: Fibonacci, Factorial, Tower of Hanoi.
Sorting:
Learn Bubble, Quick, and Merge Sort.

Days 31–40: Binary Search, Hashing & Sliding Window


Binary Search:
Problems: Search in Rotated Array, First & Last Occurrence.
Hashing:
Problems: Two Sum, Longest Subarray with Sum Zero.
Sliding Window:
Problems: Maximum Sum Subarray of Fixed Size.

Days 41–50: Trees & Graphs


Trees:
Problems: Level Order Traversal, Lowest Common Ancestor.
Graphs:
Problems: BFS, DFS, Detect Cycle, Shortest Path.

Days 51–55: Dynamic Programming (DP)


Problems: Knapsack Problem, Fibonacci, Longest Increasing Subsequence.

Days 56–60: Revise & Practice


Solve mock interview problems and company-specific questions.

You might also like