← All courses
intermediate
Data structures and algorithms
Build the problem-solving foundation every other CS subject leans on.
16 weeks · 27 sessions · certificate on completion
A language-agnostic deep dive — work in C++, Java or Python. Covers complexity analysis, every core data structure implemented by hand rather than imported, the classic algorithm design families, and the advanced structures that turn up in competitive programming. Pairs with our placement course, which adds interview technique and aptitude on top.
Included with every programme
Bonus Free AI Training with each module
Every module you study comes with its own hands-on AI training, free of charge — so alongside the subject itself you learn how to do that work with the tools the industry actually uses.
- Real tools, hands-onChatGPT, Copilot and the AI assistants teams actually use day to day.
- Tied to each moduleThe AI session covers the same code, data or design work that module just taught.
- Support while you learnBring your doubts to the AI sessions running alongside your regular classes.
- No extra chargeIncluded for every student, in classroom batches and live online alike.
Curriculum
7 modules · 27 sessions
1Thinking about efficiency4 sessions
Why complexity mattersFree preview
Big-O, and what it hidesFree preview
Measuring instead of guessing
Recursion and recurrence relations
2Linear structures4 sessions
Dynamic arrays
Linked lists in depth
Stacks and queues
Deques and circular buffers
3Hashing and sorting4 sessions
Hash tables from scratch
Collision handling
Comparison sorts
Non-comparison sorts
4Trees4 sessions
Binary trees and traversals
Balanced trees and rotations
Heaps and priority queues
Tries and prefix structures
5Graphs4 sessions
Representations and their trade-offs
BFS, DFS and topological sort
Shortest path algorithms
Minimum spanning trees
6Algorithm design4 sessions
Divide and conquer
Greedy strategies, and proving them
Dynamic programming
Backtracking and pruning
7Advanced structures3 sessions
Segment trees and Fenwick trees
Disjoint set union
Practice contest and review