Scribd
Upload
65 views1 page

90 Day DSA Python Plan Clickable

The document outlines a 90-day learning plan for Python Data Structures and Algorithms (DSA) divided into three phases: Foundations, Core DSA, and Advanced DSA with Interview Prep. Each phase includes specific topics and corresponding resources for study. The plan is structured to progressively build knowledge and skills in Python programming and DSA concepts.

Uploaded by

Dev Rathore
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
65 views1 page

90 Day DSA Python Plan Clickable

The document outlines a 90-day learning plan for Python Data Structures and Algorithms (DSA) divided into three phases: Foundations, Core DSA, and Advanced DSA with Interview Prep. Each phase includes specific topics and corresponding resources for study. The plan is structured to progressively build knowledge and skills in Python programming and DSA concepts.

Uploaded by

Dev Rathore
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/ 1

90-Day Python DSA Learning Plan with Clickable

Resources

Phase 1 – Foundations (Days 1–20)


Days Topic Resource

1–3 Python basics HackerRank Python Track

4–6 Lists, Tuples, Sets, Dicts Real Python – Data Types

7–9 Strings freeCodeCamp – Python Strings

10–12 Time Complexity Big-O Cheat Sheet

13–15 Stack & Queue GFG – Stack in Python

16–18 Recursion basics Programiz – Python Recursion

19–20 Review problems LeetCode Easy Problems

Phase 2 – Core DSA (Days 21–50)


Days Topic Resource

21–25 Arrays & Two Pointers NeetCode – Two Sum

26–28 Sliding Window NeetCode – Sliding Window

29–32 Hashing GFG – Hashing in Python

33–36 Sorting & Searching Real Python – Sorting

37–40 Linked List NeetCode – Linked List

41–43 Stack & Monotonic Stack NeetCode – Monotonic Stack

44–47 Trees NeetCode – Binary Tree Traversal

48–50 Review problems Striver’s DSA Sheet

Phase 3 – Advanced DSA + Interview Prep (Days 51–90)


Days Topic Resource

51–55 Binary Search on Answers NeetCode – Binary Search Advanced

56–60 Graphs Abdul Bari – Graph Representation

61–65 Heap/Priority Queue Programiz – heapq Module

66–70 Trie NeetCode – Trie

71–80 Dynamic Programming Aditya Verma – DP Basics

81–85 Backtracking NeetCode – N Queens

86–88 Mock Interviews Pramp – Free Mock Interviews

89–90 Review LeetCode Problems

You might also like