Blog
-
C++ Algorithm Partition | 'Partition Algorithm' Guide
Partition is an STL algorithm that divides elements into two groups based on a condition.
-
C++ Algorithm Permutation | 'Permutation Algorithm' Guide
Generate permutations and combinations using C++ next_permutation and prev_permutation.
-
C++ Algorithms | 'Must-Solve' Problems for Coding Tests
C++ algorithm problem-solving. Covers sorting, searching, DP, greedy, and graph algorithms with practical examples and applications.
-
C++ any | 'Type Erasing' Guide
A guide that summarizes std::any and variant·void* comparison, type safety, any_cast, practical examples, and performance overhead.
-
C++ async & launch | 'Asynchronous Execution' Guide
How std::async launch policies (async vs deferred) actually schedule work in C++, and the pitfalls that catch people relying on the default policy.
-
C++ auto Type Deduction | Let the Compiler Handle Complex Types
C++ auto keyword and type deduction. Using auto with iterators, lambdas, and template return types, along with deduction rules and caveats.
-
C++ Benchmarking | A Complete Guide to Benchmarking
How to benchmark C++ code correctly - avoiding compiler optimizations that skew results, using Google Benchmark, and reading the numbers you get back.
-
C++ bitset | 'Bit Set' Guide
This is a bitset guide that summarizes the basics of bit operations, bitset vs vector<bool>, masking, permutation, and combination patterns.
-
C++ Bridge Pattern Complete Guide | Enhancing Scalability by Separating Implementation and Abstraction
C++ Bridge Pattern complete guide.
-
C++ call_once | 'Call Once' Complete Guide
std::call_once is a C++11 function that guarantees a function executes exactly once, even when called from multiple threads.