{"data":{"_id":"6ae40d55ad69f3eadd1b3bc5","name":"C++","slug":"cpp","image":"https://images.unsplash.com/photo-1555066931-4365d14bab8c?auto=format&fit=crop&w=1200&q=80","icon":"cpp","accentColor":"#00599C","isFree":false,"price":899,"features":["Modern C++20 & C++23 Features","RAII & Smart Pointer Semantics","Lock-Free Queues & Concurrency","Ultra-Low Latency Order Matching"],"tags":["Interactive Roadmap","C++","Systems Programming","Low Latency","High Performance"],"category":null,"description":"Master Modern C++ (C++17/20/23), memory management, RAII, templates, concepts, multithreading, and low-latency systems engineering.","modules":[{"icon":"⚡","title":"Modern C++ Foundations: C++17 to C++23","description":"Move semantics, rvalue references, perfect forwarding, smart pointers, and RAII resource management.","duration":"2.5 hours","order":1,"isFree":true,"isPublished":true,"isProject":false,"content":"### Modern Resource Management\nEliminate memory leaks by pairing Resource Acquisition Is Initialization (RAII) with std::unique_ptr and std::make_shared.","subsections":[{"title":"Move Semantics & Rvalue References (T&&)","description":"Eliminate deep copy overheads and implement move constructors and move assignment operators.","duration":"60 mins","content":"Memory transfer semantics in modern C++.","isFree":true,"isPublished":true,"order":1,"_id":"6ae3ed503f5d6ea8c6dd3bac","locked":false},{"title":"Smart Pointers & Ownership Semantics","description":"std::unique_ptr, std::shared_ptr, std::weak_ptr, and circular reference prevention.","duration":"60 mins","content":"Best practices for deterministic memory cleanup.","isFree":true,"isPublished":true,"order":2,"_id":"6ae3ed503f5d6ea8c6dd3bad","locked":false}],"_id":"6ae3ed503f5d6ea8c6dd3bab","locked":false},{"icon":"🧩","title":"Templates, Metaprogramming & C++20 Concepts","description":"Function templates, class templates, SFINAE vs Concepts, variadic templates, and constexpr compile-time execution....","duration":"3 hours","order":2,"isFree":false,"isPublished":true,"isProject":false,"content":"","subsections":[{"title":"C++20 Concepts & Type Constraints","description":"Define requirements with template <typename T> requires ... and standard concepts.","duration":"75 mins","content":"","isFree":false,"isPublished":true,"order":1,"_id":"6ae3ed503f5d6ea8c6dd3baf","locked":true},{"title":"Constexpr, Consteval & Metaprogramming","description":"Shift calculations from runtime to compilation time with zero runtime cost.","duration":"75 mins","content":"","isFree":false,"isPublished":true,"order":2,"_id":"6ae3ed503f5d6ea8c6dd3bb0","locked":true}],"_id":"6ae3ed503f5d6ea8c6dd3bae","locked":true},{"icon":"🔄","title":"High-Performance Concurrency & Lock-Free Programming","description":"std::jthread, std::atomic, memory orders (relaxed, acquire-release, seq_cst), and lock-free queues....","duration":"3.5 hours","order":3,"isFree":false,"isPublished":true,"isProject":false,"content":"","subsections":[{"title":"Atomics & Hardware Memory Ordering","description":"Memory barriers, cache coherence (MESI protocol), and memory_order_acquire/release.","duration":"90 mins","content":"","isFree":false,"isPublished":true,"order":1,"_id":"6ae3ed503f5d6ea8c6dd3bb2","locked":true},{"title":"Lock-Free Single-Producer Single-Consumer (SPSC) Queue","description":"Build a ring buffer queue with zero lock contention.","duration":"75 mins","content":"","isFree":false,"isPublished":true,"order":2,"_id":"6ae3ed503f5d6ea8c6dd3bb3","locked":true}],"_id":"6ae3ed503f5d6ea8c6dd3bb1","locked":true},{"icon":"💾","title":"Cache Locality, Allocators & Memory Alignment","description":"Custom arena allocators, false sharing, cache line alignment (alignas(64)), and data-oriented design....","duration":"3 hours","order":4,"isFree":false,"isPublished":true,"isProject":false,"content":"","subsections":[{"title":"Custom Arena & Pool Allocators","description":"Eliminate malloc/free fragmentation by preallocating contiguous buffers.","duration":"75 mins","content":"","isFree":false,"isPublished":true,"order":1,"_id":"6ae3ed503f5d6ea8c6dd3bb5","locked":true},{"title":"False Sharing & Cache Line Padding","description":"Using alignas(hardware_destructive_interference_size) in multithreaded structs.","duration":"60 mins","content":"","isFree":false,"isPublished":true,"order":2,"_id":"6ae3ed503f5d6ea8c6dd3bb6","locked":true}],"_id":"6ae3ed503f5d6ea8c6dd3bb4","locked":true},{"icon":"🔍","title":"Tooling, Profiling & Sanitizers","description":"Modern CMake build systems, AddressSanitizer (ASan), ThreadSanitizer (TSan), Valgrind, and Linux perf....","duration":"2.5 hours","order":5,"isFree":false,"isPublished":true,"isProject":false,"content":"","subsections":[{"title":"AddressSanitizer & ThreadSanitizer","description":"Compile-time instrumentation to catch memory corruption and race conditions.","duration":"60 mins","content":"","isFree":false,"isPublished":true,"order":1,"_id":"6ae3ed503f5d6ea8c6dd3bb8","locked":true},{"title":"Linux Perf & Flame Graphs","description":"Profile CPU instruction cycles, branch mispredictions, and bottleneck functions.","duration":"60 mins","content":"","isFree":false,"isPublished":true,"order":2,"_id":"6ae3ed503f5d6ea8c6dd3bb9","locked":true}],"_id":"6ae3ed503f5d6ea8c6dd3bb7","locked":true},{"icon":"🌐","title":"Low-Latency Networking with POSIX Sockets & Epoll","description":"Non-blocking I/O, Linux epoll event loops, TCP tuning, and binary serialization....","duration":"3 hours","order":6,"isFree":false,"isPublished":true,"isProject":false,"content":"","subsections":[{"title":"Non-Blocking Sockets & Linux Epoll","description":"Build an asynchronous event-driven TCP server from scratch.","duration":"75 mins","content":"","isFree":false,"isPublished":true,"order":1,"_id":"6ae3ed503f5d6ea8c6dd3bbb","locked":true},{"title":"Zero-Copy Serialization & TCP Optimization","description":"TCP_NODELAY, SO_REUSEPORT, and direct memory layout serialization.","duration":"60 mins","content":"","isFree":false,"isPublished":true,"order":2,"_id":"6ae3ed503f5d6ea8c6dd3bbc","locked":true}],"_id":"6ae3ed503f5d6ea8c6dd3bba","locked":true},{"icon":"📈","title":"Capstone: Ultra-Low Latency Limit Order Book (LOB) Engine","description":"Design and build an ultra-fast financial Limit Order Book and Matching Engine in Modern C++ capable of executing 1,000,000 orders/sec with sub-microse...","duration":"4.5 hours","order":7,"isFree":false,"isPublished":true,"isProject":true,"content":"","subsections":[{"title":"Order Book Data Structures & Matching Algorithm","description":"Implement limit orders, market orders, cancellations, and order execution.","duration":"90 mins","content":"","isFree":false,"isPublished":true,"order":1,"_id":"6ae3ed503f5d6ea8c6dd3bbe","locked":true},{"title":"Zero-Allocation Critical Path & Performance Benchmarking","description":"Measure p50, p99, and p99.9 latency distributions under heavy load.","duration":"90 mins","content":"","isFree":false,"isPublished":true,"order":2,"_id":"6ae3ed503f5d6ea8c6dd3bbf","locked":true}],"_id":"6ae3ed503f5d6ea8c6dd3bbd","locked":true}],"details":[],"status":"published","__v":0},"message":"Course fetched successfully"}