logo CodeStepByStep logo


Language/Type: C++ Hashset set collections STL
Related Links:

Write a function named twice that accepts as a parameter a reference to a vector of integers and returns a set containing all the numbers in the vector that appear exactly twice. For example, if a vector variable v stores {1, 3, 1, 4, 3, 7, -2, 0, 7, -2, -2, 1}, the call of twice(v) should return the set {3, 7}.

If you want an extra challenge: Use only sets as auxiliary storage.

Function: Write a C++ function as described, not a complete program.

You must log in before you can solve this problem.

Log In

Need help?

Stuck on an exercise? Contact your TA or instructor.

If something seems wrong with our site, please

Is there a problem? Contact us.