Scribd
Upload
210 views1 page

DSA Roadmap C++

The document outlines a DSA roadmap using C++ divided into four phases: prerequisites, beginner, intermediate, and advanced DSA concepts. Each phase includes specific topics and skills to be learned, ranging from C++ basics to advanced algorithms like dynamic programming and graph theory. A practice strategy is also provided, recommending daily problem-solving and participation in weekly contests.

Uploaded by

teamanonymous002
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
210 views1 page

DSA Roadmap C++

The document outlines a DSA roadmap using C++ divided into four phases: prerequisites, beginner, intermediate, and advanced DSA concepts. Each phase includes specific topics and skills to be learned, ranging from C++ basics to advanced algorithms like dynamic programming and graph theory. A practice strategy is also provided, recommending daily problem-solving and participation in weekly contests.

Uploaded by

teamanonymous002
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

DSA Roadmap using C++

Phase 1: Prerequisites (1 week)

- C++ basics: input/output, loops, functions

- Arrays, strings, pointers, references

- OOP basics: classes, objects

Phase 2: Beginner DSA (2-3 weeks)

1. Arrays: Sorting, Searching, Insertion, Deletion

2. Strings: Manipulations, functions, logic

3. STL: Vectors, Pairs, Sets, Maps, Stack, Queue

4. Recursion: Fibonacci, Factorial, Backtracking basics

Phase 3: Intermediate DSA (1-2 months)

5. Linked Lists: Singly, Doubly, Circular, Loop detection

6. Stacks & Queues: Infix to Postfix, Parentheses

7. Trees: Traversals, BST, LCA, Height, Diameter

8. Hashing: Frequency count, Subarray sum

9. Sliding Window & Two Pointers: Max sum, Longest substring

Phase 4: Advanced DSA (1-2 months)

10. Heaps: Max/Min-Heap, Heap Sort, Kth largest

11. Graphs: BFS, DFS, Dijkstra, Topo Sort, DSU

12. Dynamic Programming: Knapsack, LCS, LIS

13. Tries & Bit Manipulation: Word search, XOR, bit hacks

Practice Strategy

- Start with GFG topic-wise DSA

- 1-3 questions/day on LeetCode or InterviewBit

- Weekly contests on Codeforces or LeetCode

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy