Jin Hyuk Cho

• Feb 3rd, 2016

 

Working example

Code
#include <iostream>


#include <vector>


#include <algorithm>


// clone array


// sort numbers


    sort(numbers.begin(), numbers.end());


    


    // front and back


// result


// non-unique number support

dada

• Feb 6th, 2016

 

This solution is O(n)

Code
#include <iostream>


#include <vector>


#include <limits>


#include <algorithm>


#include <random>


#define MAX_NUM 10000


//input data


 


        // fill input data with some random numbers


// poscount[i] will have the count of occurances of number i


// negcount[i] will have the count of occurances of number -i


 


        // go through input data and populate poscount and negcount


// number of pairs formed of negative and positive numbers of same value will be minimum of pos and neg values


"Number of pairs of numbers whose sum is 0 is: "

Jin Hyuk Cho

• Feb 8th, 2016

 

O(n) solution

Code
#include <iostream>


#include <string>


#include <vector>


#include <queue>


#include <set>


#include <locale>         // std::locale, std::isdigit


#include <sstream>


#include <algorithm>


#include <iterator>


#include <map>


// construct occurance map


// iterate over the occurance map


// cout << count.first << "=" << count.second << endl;


// complement found


                // complements count * numbers count


/**


 * Main executable


 */