C/C++

What is the difference between map and unordered_map containers in C++?

What is back_inserter and what is it used for?

What is std::future in C++?

How does iterator invalidation occur in an unordered_map container?

What is the asymptotic complexity of operations for the unordered_set and set containers in C++?

What data type should be used as a key for a monetary equivalent?

Why did you decide to write your own library?

How are std::set and std::map implemented at a low level in C++?

How does the virtual mechanism work in C++?

How does shared_ptr work in C++?

What happens if you call free on a nullptr pointer?

What is the difference between map and unordered_map in C++?

What happens under the hood of std::cout?

How are values computed at compile time in C/C++?

What is the difference between unique_ptr and shared_ptr?

What is the complexity of operations for std::vector and std::list containers in C++?

What needs to be done to use a class as a key in an unordered_map?

What is a collision in hash tables and how to handle it?

What is std::function in C++?

Do you know about placement new operator?