logo CodeStepByStep logo


Language/Type: C++ HashSet Set collections
Related Links:
Author: Marty Stepp (on 2016/06/29)

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.

Type your C++ solution code here:

This is a function problem. Write a C++ function as described. Do not write a complete program; just the function(s) above.

You must log in before you can solve this problem.

Log In

Need help?

If you do not understand how to solve a problem or why your solution doesn't work, please contact your TA or instructor.
If something seems wrong with the site (errors, slow performance, incorrect problems/tests, etc.), please

Is there a problem? Contact a site administrator.

© Marty Stepp, all rights reserved.