Topic-Wise Roadmap To Learn Data Structures and Algorithms

---

1. Arrays

-Bare Minimum

• Top 50 Array Coding Problems - GeeksForGeeks

-Bonus

• Interview Bit Array Problems - LeetCode
• LeetCode Array Problems.

---

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: a. Lec 1 - https://www.youtube.com/watch?v=OQ5jsbhAv_M\u0026list=PLcDimPvbmfT8qAxD6JH_kmXiQwTNcoK78 b. Lec 2 - https://www.youtube.com/watch?v=ENyox7kNKeY\u0026list=PLcDimPvbmfT8qAxD6JH_kmXiQwTNcoK78\u0026index=2 c. Lec 3 - https://www.youtube.com/watch?v=ocZMDMZwhCY\u0026list=PLcDimPvbmfT8qAxD6JH_kmXiQwTNcoK78\u0026index=3

   -Bare minimum (Standard problems): a. https://www.geeksforgeeks.org/program-for-nth-fibonacci-number/ b. https://www.geeksforgeeks.org/0-1-knapsack-problem-dp-10/ c. https://www.geeksforgeeks.org/coin-change-dp-7/ d. https://www.geeksforgeeks.org/compute-ncr-p-set-1-introduction-and-dynamic-programming-solution/ e. https://www.geeksforgeeks.org/longest-increasing-subsequence-dp-3/ f. https://www.geeksforgeeks.org/longest-common-subsequence-dp-4/ g. https://www.geeksforgeeks.org/longest-common-substring-dp-29/

   -Bonus: a. https://www.interviewbit.com/courses/programming/topics/dynamic-programming/ b. https://leetcode.com/tag/dynamic-programming/