CareerCup

How can I sort a map by its .second parameter.Write the C++ code.

1. loop through the map using iterator
2. look at each value and compare to the search value
3. delete the key-value pair in the map that matches the search value
4. break out of loop immediately
5. put the search value in the map using a new / updated key

Time efficiency is O(n) or better. If there is faster algorithm, please reply to this.

I am not sure if understood this question right...let me know if i am doing some thing wrong:

Following are unique pairs with the same value:
1,10
2,10
3,10
4,10

if we try to find a value based on value 10, we would not be getting one key right?

Mr.AlgosLearner, It is given in the question "assuming all key,value pairs are unique".

Create a parallel map<value,key>. When a key needs to be modified for a given value, look up the key in this map<value,key>. Then update both map<value,key> & map<key, value>.