Complete Modern C++ - Unordered Containers (C++11)

The video tutorial explains unordered containers, which are associative containers implemented as hash tables. It covers the types of unordered containers, namely unordered set and unordered map, and their characteristics. The video delves into the mechanics of hash tables, including hashing, load factor, and rehashing. Practical examples demonstrate how to use unordered set and unordered map in code, highlighting their template parameters, performance, and handling of duplicates.

What are unordered containers and how are they implemented?

Explain the difference between unordered set and unordered map.

How does the performance of unordered containers degrade with multiple entries in buckets?

What is the load factor in the context of hash tables?

Describe the process that occurs when the load factor approaches a certain value.

What are the template parameters required for unordered set?

How can you insert elements into an unordered map?