Learn C++ — Intermediate
Build classes and process collections in C++. Manage object ownership, combine STL algorithms, format reports, and learn about threads and basic design patterns.
COURSE OVERVIEWREADY
Lessons: 68
Quizzes: 12
All steps: 80
$Ready to start
What you will learn
- Design classes with inheritance, virtual methods, overloads, constness, and copy and move operations.
- Choose STL containers and algorithms for searching, filtering, sorting, grouping and aggregating data, accounting for ties and range boundaries.
- Manage object lifetimes and ownership through references, smart pointers and data models with optional and variant.
- Create reproducible reports and tests, process text in streams, and synchronize shared data in a simple multithreaded program.
SYLLABUS / 80
Course curriculum
Work through the curriculum step by step. Completed stages are marked, and you can open the next available stage.
68 lessons12 quizzes80 steps total
- 01LESSONLESSON 1: Function OverloadingAvailable now
- 02LESSONLESSON 2: Operator Overloading in the Money ClassLocked
- 03LESSONLESSON 3: Function TemplatesLocked
- 04LESSONLESSON 4: Class Templates — A Universal Candidate RepositoryLocked
- 05LESSONLESSON 5: Static Classes and Static FieldsLocked
- 06LESSONLESSON 6: Inline MethodsLocked
- 01QUIZQuiz 1: applying knowledge from lessons 1–6Locked
- 07LESSONLESSON 7: NamespacesLocked
- 08LESSONLESSON 8: Type Aliases: typedef and usingLocked
- 09LESSONLESSON 9: Range-based for — iterating over collections of candidatesLocked
- 10LESSONLESSON 10: Function pointersLocked
- 11LESSONLESSON 11: Lambda functionsLocked
- 12LESSONLESSON 12: Functors — callable objects in sorting and filteringLocked
- 02QUIZQuiz 2: applying knowledge from lessons 7–12Locked
- 13LESSONLESSON 13: Predicates – filtering candidates in collectionsLocked
- 14LESSONLESSON 14: std::function — flexible passing of behaviorLocked
- 15LESSONLESSON 15: STL algorithms – sortingLocked
- 16LESSONLESSON 16: STL algorithms – filtering: copy_if, remove_ifLocked
- 17LESSONLESSON 17: STL Algorithms – Counting (count, count_if)Locked
- 18LESSONLESSON 18: STL Algorithms – TransformationLocked
- 03QUIZQuiz 3: applying knowledge from lessons 13–18Locked
- 19LESSONLESSON 19: STL Algorithms – for_eachLocked
- 20LESSONLESSON 20: The std::accumulate Algorithm – Summation and AggregationLocked
- 21LESSONLESSON 21: The std::find Algorithm — Searching for Elements in CollectionsLocked
- 22LESSONLESSON 22: Vector – a Dynamic Array in a Shopping Cart ModuleLocked
- 23LESSONLESSON 23: Doubly Linked List — Insertion, Removal, IterationLocked
- 24LESSONLESSON 24: deque – a Double-Ended QueueLocked
- 04QUIZQuiz 4: applying knowledge from lessons 19–24Locked
- 25LESSONLESSON 25: Stack and Queue – Processing Service TicketsLocked
- 26LESSONLESSON 26: set – A Collection of Unique ValuesLocked
- 27LESSONLESSON 27: multiset – A Set with DuplicatesLocked
- 28LESSONLESSON 28: map – A Key-Value DictionaryLocked
- 29LESSONLESSON 29: multimap — a dictionary with multiple valuesLocked
- 30LESSONLESSON 30: unordered_map – a fast hashed dictionaryLocked
- 05QUIZQuiz 5: applying knowledge from lessons 25–30Locked
- 31LESSONLESSON 31: unordered_set – a fast hashed setLocked
- 32LESSONLESSON 32: Grouping data with pair and tupleLocked
- 33LESSONLESSON 33: Memory management with smart pointers (std::unique_ptr, std::shared_ptr, std::weak_ptr)Locked
- 34LESSONLESSON 34: Custom exceptionsLocked
- 35LESSONLESSON 35: Recursion in processing a hierarchy in the recruitment processLocked
- 36LESSONLESSON 36: Abstract Classes and Virtual MethodsLocked
- 06QUIZQuiz 6: applying knowledge from lessons 31–36Locked
- 37LESSONLESSON 37: Inheritance and Polymorphism in a Candidate Evaluation ModuleLocked
- 38LESSONLESSON 38: Constructor Overloading and How the Destructor WorksLocked
- 39LESSONLESSON 39: const Members and MethodsLocked
- 40LESSONLESSON 40: Enumeration Types — enum and enum class in an Order SystemLocked
- 41LESSONLESSON 41: The explicit Keyword — Safe ConstructorsLocked
- 42LESSONLESSON 42: The -> operator and the [] operator in classesLocked
- 07QUIZQuiz 7: applying knowledge from lessons 37–42Locked
- 43LESSONLESSON 43: A friend of a class and of a functionLocked
- 44LESSONLESSON 44: User-defined types: struct, class, unionLocked
- 45LESSONLESSON 45: Anonymous namespaces and local staticLocked
- 46LESSONLESSON 46: Resource Move SemanticsLocked
- 47LESSONLESSON 47: std::move and std::forward – Moving and ForwardingLocked
- 48LESSONLESSON 48: Measuring Time with std::chronoLocked
- 08QUIZQuiz 8: applying knowledge from lessons 43–48Locked
- 49LESSONLESSON 49: Unit tests: assert and a custom mini frameworkLocked
- 50LESSONLESSON 50: std::thread, mutex, lock_guard — the basics of multithreading and synchronizationLocked
- 51LESSONLESSON 51: Stream manipulators – std::setw, std::setprecision, and custom manipulatorsLocked
- 52LESSONLESSON 52: In-memory text processing with std::ostringstream and std::istringstreamLocked
- 53LESSONLESSON 53: STL Algorithms — unique, reverse, partition, lower_bound, upper_boundLocked
- 09QUIZQuiz 9: applying knowledge from lessons 49–53Locked
- 54LESSONLESSON 54: Pointers to Class MembersLocked
- 55LESSONLESSON 55: Design Patterns — Singleton, Factory, Decorator (Introduction)Locked
- 56LESSONLESSON 56: Variant Types and Optional Values in Candidate DataLocked
- 57LESSONLESSON 57: Static and Dynamic Allocation of Arrays and CollectionsLocked
- 58LESSONLESSON 58: Pointers, References, nullptrLocked
- 10QUIZQuiz 10: applying knowledge from lessons 54–58Locked
- 59LESSONLESSON 59: Working with string and stringstreamLocked
- 60LESSONLESSON 60: STL Algorithms – find (searching for candidates)Locked
- 61LESSONLESSON 61: STL Algorithms – accumulate (summing points)Locked
- 62LESSONLESSON 62: map – storing candidates by identifierLocked
- 63LESSONLESSON 63: set – a set of unique candidate namesLocked
- 11QUIZQuiz 11: applying knowledge from lessons 59–63Locked
- 64LESSONLESSON 64: pair – storing candidates' scoresLocked
- 65LESSONLESSON 65: Storing candidates with the same scores using multimapLocked
- 66LESSONLESSON 66: unordered_map – fast access to candidates by emailLocked
- 67LESSONLESSON 67: unordered_set – fast registration checksLocked
- 68LESSONLESSON 68: Next-actions report — selecting, filtering and sorting tasksLocked
- 12QUIZQuiz 12: applying knowledge from lessons 64–68Locked
- +EXAMConfirm your skills with an examPreparing with this course is optional. You can choose a certification exam for this language and level without completing the course or quizzes. Check your account access and confirm exam authorization.Other status