C/C++

What is a collision and how is it resolved in unordered_map? What collision resolution methods do you know?

What happens to unordered_map iterators after rehashing the hash table?

Name the algorithmic complexity of insertion, search, and deletion operations for unordered_map.

What is a hash function, and how does a good one differ from a bad one?

What is the fundamental difference from a vector in terms of iterator invalidation?

How is a unique_ptr implemented under the hood?

Tell me how a forward_list is implemented under the hood.

How is shared_ptr implemented under the hood? Tell me about the control block.

How to use your data structures as keys in a map?

Как устроен weak_ptr под капотом?

Tell me how the map is implemented under the hood.

Name the algorithmic complexity of insertion, search, and deletion operations for forward_list.

What happens to the reference count when copying a shared_ptr?

Зачем нужен weak_ptr?

How is unordered_map implemented under the hood?

Briefly tell about the architecture of Linux OS.

Why is shared_ptr needed?

В чём нюанс make_shared по сравнению с конструктором shared_ptr?

How does Linux differ from Windows in architecture?

There is a vector of 100 elements. How does adding the 101st element work, and what happens when this element is removed?