Print nodes in top view of Binary Tree | Set 2
Top view of a binary tree is the set of nodes visible when the tree is viewed from the top. Given a binary tree, print… Read More »
Tag Archives: cpp-map
Count of numbers appearing in the given ranges at-least K times
Given N ranges and a number K, the task is to find total count of numbers that appears at least K times in the given… Read More »
Pair with minimum absolute difference after solving each query
Given Q queries and an empty list. The queries can be of two types: addToList(x) : Add x to your list. removeFromList(x) : Remove x… Read More »
LFU (Least Frequently Used) Cache Implementation
Least Frequently Used (LFU) is a caching algorithm in which the least frequently used cache block is removed whenever the cache is overflowed. In LFU… Read More »
Minimum operations required to make all the elements distinct in an array
Given an array of N integers. If a number occurs more than once, choose any number y from the array and replace the x in… Read More »
map erase() function in C++ STL
map::erase() is a built-in function in C++ STL which is used to erase element from the container. It can be used to erase keys, elements… Read More »
map equal_range() in C++ STL
The map::equal_range() is a built-in function in C++ STL which returns an iterator of pairs. The pair refers to the bounds of a range that… Read More »
map insert() in C++ STL
The map::insert() is a built-in function in C++ STL which is used to insert elements with a particular key in the map container. Syntax: iterator… Read More »
map count() function in C++ STL
The map::count() is a built-in function in C++ STL which returns 1 if the element with key K is present in the map container. It… Read More »
map emplace_hint() function in C++ STL
The map::emplace_hint() is a built-in function in C++ STL which inserts the key and its element in the map container with a given hint. It… Read More »
map find() function in C++ STL
The map::find() is a built-in function in C++ STL which returns an iterator or a constant iterator that refers to the position where the key… Read More »
map lower_bound() function in C++ STL
The map::lower_bound(k) is a built-in function in C++ STL which returns an iterator pointing to the key in the container which is equivalent to k… Read More »
map operator= in C++ STL
The map::operator= is a built function in C++ STL which assigns contents of a container to a different container, replacing its current content. Syntax: map1_name… Read More »
Sum of nodes at maximum depth of a Binary Tree | Iterative Approach
Given a root node to a tree, find the sum of all the leaf nodes which are at maximum depth from root node. Example: 1… Read More »
Difference between the summation of numbers whose frequency of all digits are same and different
Given an array of N integers, find the difference between the summation of numbers whose frequency of all digits are same and different. For e.g.… Read More »