C++ · Data Structure

STL – Map

In fact, the STL's map class allows you to store data by any type of key instead of simply by a numerical key, the way you must access an array or vector. So instead of having to compute a hash function and then access an array, you can just let the map class do it… Continue reading STL – Map

C++ · Data Structure

Stack and Queue

Stacks are a type of container  designed to operate in a LIFO context (last-in first-out), where elements are inserted and extracted only from one end of the container. Main Stack Operations: push (object): inserts an element. pop (): removes and returns the last inserted element. top(): returns the last element without removing it. size(): returns… Continue reading Stack and Queue

C++ · Data Structure · problem solving


The C++ STL (Standard Template Library) is a powerful set of C++ template classes to provides general-purpose templatized classes and functions that implement many popular and commonly used algorithms and data structures like vectors, lists, queues, and stacks. At the core of the C++ Standard Template Library are following three well-structured components: Component Description Containers… Continue reading C++ STL