Solution: A Container “owns” its elements: the lifetime of an element stored in a container cannot exceed that of the Container itself.

Solution: Container adaptors are not full container classes, but classes that provide a specific interface relying on an object of one of the container classes such as deque or list to handle the elements.

Solution: All the STL containers define the iterator types for that container, e.g., iterator and const_iterator, e.g., vector::iterator and the begin/end methods for that container, e.g., begin() and end().

Solution: Pointers are legal iterators, so if your internal container is a simple C array, then all you need to do is return the pointers.

Solution: Iterators are used to increase the generality of an algorithm. Otherwise, we need to define the algorithm for each types.

Solution: These are the design specific requirements for building a container from the scratch.

Solution: There are three main iterators needed for designing a container. They are const iterator, Reverse iterator and Iterator traits.

Solution: Storage management is the use of the allocator interface in the user-defined container.

Solution: There are two type of container classes in c++. They are value containers and reference containers.

Solution: Heterogeneous container is the name of the container which contains group of multiple objects.