Topic-Wise Roadmap To Learning Data Structures and Algorithms

---

1. Arrays

-Bare Minimum

• Top 50 Array Coding Problems - GeeksForGeeks

-Bonus

• Array Problems - InterviewBit
• Array Problems - LeetCode

---

2. Strings

-Bare Minimum

• String Problems - InterviewBit

-Bonus

• String Problems - LeetCode
• Problem solving (String) - HackerRank

---

3. Linked Lists

-Bare Minimum

• Linked-List Problems - InterviewBit

-Bonus

• Linked-List Questions - LeetCode
• Top 20 Linked-List Questions - GeeksForGeeks

---

4. Stacks and Queues

-Theory:

• Stack Data Structure Introduction - GeeksForGeeks
• Queue Set Introduction and Array Implementation - GeeksForGeeks

-Bare Minimum

• Stacks and Queues - InterviewBit

-Bonus

• Stack Problems - LeetCode
• Queue Problems - LeetCode
• Queue Data Structure - GeeksForGeeks
• Stack Data Structure - GeeksForGeeks

---

5. Tree-based data structures:

-Theory:

• Binary Tree Data Structure - GeeksForGeeks
• Binary Search Tree Data Structure - GeeksForGeeks
• Trie Insert and Search - GeeksForGeeks
• Heap Data Structure - GeeksForGeeks
• Hashing Data Structure - GeeksForGeeks

-Bare minimum:

• Tree Data Structure - InterviewBit
• Heaps and Maps - InterviewBit
• Hashing - InterviewBit

-Bonus

• Tree - LeetCode
• Heap - LeetCode
• Trie - LeetCode
• Hash Table - LeetCode

---

6. Graphs:

-Theory:

• Graph and It's Representations

-Standard Algos:

• Breadth First Search - GeeksForGeeks
• Depth First Search - GeeksForGeeks
• Dijkstra's Shortest Path Algorithm - GeeksForGeeks
• Prim's Minimum Spanning Tree - GeeksForGeeks
• Kruskal's Minimum Spinning Tree Algorithm
• Floyd Warshall Algorithm - GeeksForGeeks
• Union Find Algorithm - GeeksForGeeks

-Bare Minimum:

• Graph Problems - LeetCode (Easy and Medium)

-Bonus:

• Graph Data Structure Algorithms - InterviewBit

---

7. Dynamic Programming:

-Video lectures:

• Dynamic Programming I: Fibonacci, Shortest Paths
• Dynamic Programming II: Text Justification, Blackjack
• Dynamic Programming III: Parenthesization, Edit Distance, Knapsack

-Bare minimum (Standard problems):

• Program For nth Fibonacci Number - GeeksForGeeks
• 0-1 Knapsack Problem - GeeksForGeeks
• Coin Change - GeeksForGeeks
• Compute nCr % p - GeeksForGeeks
• Longest Increasing Subsequence - GeeksForGeeks
• Longest Common Subsequence - GeeksForGeeks
• Longest Commono Substring - GeeksForGeeks

-Bonus:

• Dynamic Programming - InterviewBit
• Dynamic Programming - LeetCode