You've successfully subscribed to The Poor Coder | Hackerrank Solutions
Great! Next, complete checkout for full access to The Poor Coder | Hackerrank Solutions
Welcome back! You've successfully signed in.
Success! Your account is fully activated, you now have access to all content.

STL

Beeze Aal

Hackerrank Deque-STL Solution

Double ended queue or Deque(part of C++ STL) are sequence containers with dynamic sizes that can be expanded or contracted on both ends (either its front or its back). The member functions of deque that are mainly used are: Deque Template: std::deque<value_type> Declaration: deque&
Beeze Aal

Hackerrank Print Pretty Solution

Your manager gave you a text file with many lines of numbers to format and print. For each row of  space-separated doubles, format and print the numbers using the specifications in the Output Format section below. Input Format The first line contains an integer, , the number of test cases. Each
Beeze Aal

Hackerrank Maps-STL Solution

Maps are a part of the C++ STL.Maps are associative containers that store elements formed by a combination of a key value and a mapped value, following a specific order.The mainly used member functions of maps are: Map Template: std::map <key_type, data_type> Declaration:
Beeze Aal

Hackerrank Sets-STL Solution

.MathJax_SVG_LineBox {display: table!important} .MathJax_SVG_LineBox span {display: table-cell!important; width: 10000em!important; min-width: 0; max-width: none; padding: 0; border: 0; margin: 0} Sets are a part of the C++ STL. Sets are containers that store unique elements following a specific order. Here are some of the
Beeze Aal

Hackerrank Lower Bound-STL Solution

.MathJax_SVG_LineBox {display: table!important} .MathJax_SVG_LineBox span {display: table-cell!important; width: 10000em!important; min-width: 0; max-width: none; padding: 0; border: 0; margin: 0} You are given  integers in sorted order. Also, you are given  queries. In each query, you will be given an integer and you have
Beeze Aal

Hackerrank Vector-Erase Solution

.MathJax_SVG_LineBox {display: table!important} .MathJax_SVG_LineBox span {display: table-cell!important; width: 10000em!important; min-width: 0; max-width: none; padding: 0; border: 0; margin: 0} You are provided with a vector of  integers. Then, you are given  queries. For the first query, you are provided with  integer, which denotes
Beeze Aal

Hackerrank Vector-Sort Solution

You are given  integers.Sort the  integers and print the sorted order. Store the  integers in a vector.Vectors are sequence containers representing arrays that can change in size. Declaration: vector<int>v; (creates an empty vector of integers) Size: int size=v.size(); Pushing an integer into