GFG — DSA Masterclass (Videos, Notes, Problems)

This listing provides the complete GeeksforGeeks (GFG) Data Structures & Algorithms (DSA) course package in a structured format: video lectures, written lessons, solved example problems, practice sets, quizzes, and topic-wise folders for step-by-step study. The course follows the standard GFG DSA syllabus and includes beginner → advanced topics so you can prepare for coding interviews and competitive programming efficiently. Priced at ₹299 for full access, this is offered as a bundled, structured learning path (GFG’s retail/self‑paced offerings are typically priced much higher on their site).geeksforgeeks+1

What students will get (bullets)

• Full video lecture series for all core DSA topics (introductory to advanced)
• Written notes and theory summaries per topic for quick revision.
• Curated practice problems and solution walkthroughs (multiple examples).
• Topic-wise quizzes to test understanding after each module.
• Structured folders (organized exactly by topic) so you can study sequentially or jump to weak areas.
• Lifetime access to the provided drive content (videos + docs + quizzes) at the one-time price.
• Guidance notes on suggested weekly study plan and interview prep path.

Why this listing (single paragraph)

You get the full, structured DSA curriculum (matching GFG’s paid DSA offerings) at a one-time low price of ₹299 — a straightforward option if you want a complete study path with videos, notes, and problems organized for fast progress. Use the included quizzes and solved problems to track improvement and prepare for technical interviews.geeksforgeeks+1

Course curriculum (extracted and consolidated from your screenshot)

Note: I grouped and named items clearly for a Topmate curriculum page so learners can click per module.

2. Introduction
3. Mathematics (number theory, combinatorics basics)
4. Bit Magic
5. Recursion
6. Arrays (05. Arrays - 01 / 05. Arrays - 02)
7. Searching (06. Searching - 01 / 06. Searching - 02)
8. Sorting (07. Sorting - 01 / 07. Sorting - 02 / 07. Sorting - 03)
9. Matrix
10. Hashing (09. Hashing - 01 / 09. Hashing - 02)
11. Strings (10. Strings - 01 / 10. Strings - 02)
12. Linked List (11. Linked List - 01 / 11. Linked List - 02)
13. Stack (12. Stack - 01 / 12. Stack - 02)
14. Queue
15. Deque
16. Tree (15. Tree - 01)
17. BST (16. BST - 01 / 16. BST - 02)
18. Heap (17. Heap - 01 / 17. Heap - 02)
19. Graph (18. Graph - 01 / 18. Graph - 02 / 18. Graph - 03 / 18. Graph - 04 / 18. Graph - 05)
20. Greedy
21. Backtracking
22. Dynamic Programming (multiple parts)
23. Trie
24. Segment Trees & Binary Indexed Trees (Segment and Binary...)
25. Disjoint Set

Each module contains: video lectures, written notes, practice problems and quizzes (as visible in the structured folders screenshot). The folder structure and multiple parts per topic reflect in-depth coverage and stepwise lectures per topic

Videos like this for Each Module :