Accepted solution

Picking Numbers (Hacker Rank)

Open original problem
Source code

int pickingNumbers(vector<int> a) {

 

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

 

 

   vector<int> count(a.size(), 1);

   int max=0;

    for (int i = 0; i < a.size(); i++) {

        for (int j = i+1; j < a.size(); j++) {

            if (abs(a[j] - a[i]) <= 1)

                count[i]++;

            else

                break;

        }

    }

   

   for(int i=0;i<count.size();i++){

       if (max<count[i])

         max=count[i];

   }

   return max;

   

}
Join the discussion

Add your comment