I need help in C++ language, please.
Given a non-empty array (specifically, vector, in our case) of integers, every element appears twice except for one. Find that single one Write a function named findSingleNumber that: Takes an integer vector (call by reference, preferably) Returns the single one (integer) Note: The best-known solution for this problem is running in O(N) run time complexity. You don’t have to squeeze your head to figure it out though, FYI LAB ACTIVITY 1.44.1:
PayPal Gateway not configured
PayPal Gateway not configured