beginner → Portfolio-ready
A structured path from modern C++ foundations and algorithmic thinking through linear and non-linear data structures, searching, sorting, dynamic programming, graph algorithms, testing, and interview-style problem solving.
Use this overview to understand the sequence. Open each stage below for course details.
Included published courses are activated together. Your course certificates remain individual, and completing every required certified course unlocks the roadmap distinction.
Required courses build the core skill. Optional courses let you specialise.
Build dependable programming habits before implementing data structures.
Learn types, control flow, functions, references, classes, standard containers, memory safety, and debugging.
Learn to reason about performance, recursion, invariants, and reusable solution patterns.
Analyse runtime and memory, trace recursion, and turn large problems into testable steps.
Implement and apply arrays, linked structures, stacks, queues, hashing, and heaps.
This sample mirrors the issued certificate. Your name, verified results, QR code, and verification ID appear only after every required course certificate is earned.
Implement and compare the core sequential structures used in real programs and coding problems.
Use fast lookup and priority-based structures while understanding collisions and performance trade-offs.
Model hierarchical and connected data, then traverse and search it efficiently.
Work with binary trees, search trees, graphs, BFS, DFS, shortest paths, and connectivity.
Understand binary search, comparison sorting, partitioning, and divide-and-conquer design.
Combine greedy, dynamic-programming, graph, testing, and communication skills in realistic problems.
Practise greedy and dynamic-programming patterns, test edge cases, and clearly explain complete solutions.
Awarded for meeting the published learning and assessment requirements. Preview only — it has no verification ID and cannot be used as a credential.