What types of containers do you mainly use in your practice?

In C++ practice, I most often use standard containers from the STL:

• std::vector — a dynamic array, convenient for storing elements with quick access by index.
• std::list — a doubly linked list, suitable for frequent insertions and deletions in the middle.
• std::map and std::unordered_map — associative containers for storing key-value pairs, where map is ordered, and unordered_map is a hash table.
• std::set — a collection of unique elements.

Example of using std::vector:

#include <vector>
#include <iostream>

int main() {
    std::vector<int> numbers = {1, 2, 3, 4, 5};
    numbers.push_back(6);
    for (int num : numbers) {
        std::cout << num << " ";
    }
    return 0;
}