Skip to content

Latest commit

 

History

History
93 lines (69 loc) · 3.96 KB

README.md

File metadata and controls

93 lines (69 loc) · 3.96 KB

🛤️ 90 Days of DSA Roadmap

Day 1 & 2: Understanding Space and Time Complexity

The foundation of efficient programming is understanding the complexity of your code.

📚 Resources:

Day 3 to 10: Recursion and Backtracking

Master these essential concepts to unlock more advanced problem-solving techniques.

📚 Resources:

Day 11 to 30: Basic Data Structures: Arrays, Linked Lists, Stacks, and Queues

📚 Resources:

Arrays:

Linked List:

Stacks and Queues:

💡 Nishant Chahar's advice: Start participating in contests and learn new concepts along the way. You may not do well initially, but keep learning and growing!


Day 31 to 45: Advanced Data Structures and Algorithms

📚 Topics:
  • Searching
  • Sorting (Bubble, Insertion, Selection, Merge, Quick)
  • Hashmaps
  • Trees
  • Heaps
  • Sliding Window
📚 Resources:

Searching:

Sorting:

Hashmaps:

Trees:

Heaps:

Sliding Window:


Day 46 to 70: Dynamic Programming and Graphs

📚 Topics:
  • Graph Algorithms: BFS, DFS, Dijkstra, Floyd Warshall, Prim's, Kruskal's, Kosaraju’s, Topological Sort, DSU
  • Dynamic Programming

Day 71 to 80: Object-Oriented Programming (OOPs)

Surprise topic — stay tuned!


Day 80 to 90: Additional Advanced Topics

📚 Topics:
  • Number Theory
  • Bit Manipulation
  • Tries