DSA Roadmap

6 months of DSA Roadmap

Start Learning:

• Pick a Language like C++ or Java.

• Theory + Practical

• Use first pen and paper

Basic – Arrays, Linked List, Stack, Queues, Hash Map.

Advanced - Trees, Graphs, Heap.

Six important Algorithms:

1. Searching & Sorting.
2. Divide & Conquer.
3. Greedy.
4. Recursion.
5. Dynamic Programming.
6. Backtracking.

 

(Time Complexity )

 

 

1. Array
2. Linked Lists
3. Stack and Queue (Recursion)
4. Binary Trees
5. Hash Table
6. Tree (Heap) and Graph
7. Trees and Union find

Algorithms:

1. Dynamic Programming
2. Binary Search
3. Two Pointers
4. Sliding Window
5. Backtracking

 

·       Search: Learn Data Structures and Algorithms – Roadmap by codechef.

·       Recursion is important to learn tree.

·      References:

o   Website: interviewBit

o   YouTube: Pepcoding, Abdul Barl Algorithms, WilliasmFiset Data Structures, Graph Theory, Tushar Roy Dynamic Programming

Another Path:

Blue – Data Structure

Green - Algorithms

1. Arrays
2. Linked List
3. Stacks & Queues
4. Hash Tables
5. Two Pointers/Sliding Window
6. Recursion/Backtracking
7. Sorting
8. Searching
9. Bit Manipulation
10. Tree/BST/Tree
11. Heaps
12. Greedy
13. Dynamic Programming
14. Graphs/Union Find

• ArrayList
• String and String Builder
• HashMap