## set vs map in C++ STL

set and map in STL are similar in the sense that they both use Red Black Tree (A self balancing BST). Note that the time… Read More »

- Print nodes in top view of Binary Tree | Set 2
- Count distinct pairs from two arrays having same sum of digits
- Print all pairs in an unsorted array with equal sum
- Double ended priority queue
- map rbegin() function in C++ STL
- Most frequent word in first String which is not present in second String
- Remove minimum elements from array so that max <= 2 * min
- map value_comp() in C++ STL
- How to traverse a STL map in reverse direction?
- Check if frequency of character in one string is a factor or multiple of frequency of same character in other string
- map key_comp() function in C++ STL
- map rend() function in C++ STL
- map rbegin() function in C++ STL
- Count pairs in an array such that both elements has equal set bits
- How to delete last element from a map in C++
- Maximum score after flipping a Binary Matrix atmost K times
- Find all good indices in the given Array
- Check if a king can move a valid move or not when N nights are there in a modified chessboard
- Count occurrences of the average of array elements with a given number
- Find the Number of Maximum Product Quadruples
- Check whether frequency of characters in a string makes Fibonacci Sequence
- String with frequency of characters in Lucas Sequence
- Pair with minimum absolute difference after solving each query
- map get_allocator in C++ STL
- Count of numbers appearing in the given ranges at-least K times
- map key_comp() in C++ STL

set and map in STL are similar in the sense that they both use Red Black Tree (A self balancing BST). Note that the time… Read More »

Given a graph with N nodes numbered from 1 to N and M edges and an array of numbers from 1 to N. Check if… Read More »

Given an array of N non-negative integers, task is to find the maximum size of a subarray such that the pairwise sum of the elements… Read More »

C++ map stores keys in ordered form (Note that it internally use a self balancing binary search tree). Ordering is internally done using operator ”… Read More »

Given a tree and a node data, your task to reverse the path till that particular Node. Examples: Input : 7 / \ 6 5… Read More »

Associative arrays are also called map or dictionaries. In C++. These are special kind of arrays, where indexing can be numeric or any other data… Read More »

Maps are the container in STL which is used to store the elements in the form of key-value pair. Internally, the elements in a map… Read More »

In C++, all containers (vector, stack, queue, set, map, etc) support both insert and emplace operations. The advantage of emplace is, it does in-place insertion… Read More »

Map is dictionary like data structure. It is an associative array of (key, value) pair, where only single value is associated with each unique key.… Read More »

Maps are associative containers that store elements in a mapped fashion. Each element has a key value and a mapped value. No two mapped values… Read More »

According to Midy’s theorem, if the period of a repeating decimal for , where p is prime and is a reduced fraction, has an even… Read More »