Coming soon
DSA for Placements
Data structures and algorithms with solved interview problems, for campus placements.
- 3 months
- Beginner to advanced
- 5 parts · 42 topics
Send us one message on WhatsApp, and we will tell you the launch date.
Planned syllabus
The full roadmap, basic to advanced
Every part builds on the one before it. You finish each part with a real project.
- Parts
- 5
- Duration
- 3 months
- Topics
- 42
- Projects
- 5
Part 1Basics
- Choosing a language: C++, Java or Python
- Time and space complexity: Big O
- Arrays and strings
- Two pointers
- Sliding window
- Prefix sums
- Hashing with maps and sets
- Sorting: bubble, merge, quick
- Binary search and its patterns
Project Solve 50 easy problems.
Part 2Core structures
- Recursion
- Backtracking
- Linked lists
- Stacks
- Queues and deques
- Monotonic stack
- Heaps and priority queues
- Bit manipulation
Project Solve 80 medium problems by pattern.
Part 3Trees and graphs
- Binary trees and traversals
- Binary search trees
- Tries
- Graph representation
- BFS and DFS
- Topological sort
- Shortest paths: Dijkstra, Bellman-Ford
- Union-Find (DSU)
- Minimum spanning tree
Project Solve 70 tree and graph problems.
Part 4Advanced
- Dynamic programming: memoization and tabulation
- 1D and 2D DP
- Knapsack patterns
- DP on strings: LCS, edit distance
- DP on trees
- Greedy algorithms
- Intervals
- Segment tree basics
Project Solve 60 hard problems.
Part 5Placement ready
- The top interview patterns
- Solving company question sets
- LeetCode and Codeforces practice plan
- Mock interviews
- Explaining your approach out loud
- OOP and DBMS quick revision
- Operating systems and networks quick revision
- Resume and HR round
Project Two full mock interviews with feedback.
This is the planned syllabus. Small changes are possible before launch.
Want this course? Tell us.
Send one message on WhatsApp, and we will tell you as soon as the launch date is fixed.