We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Picking Numbers
  5. Discussions

Picking Numbers

  • alban_tyrex
     + 0 comments

    Here is my O(n) c++ solution, you can find the explanation here : https://youtu.be/0zvqEO1gDRw

    int pickingNumbers(vector<int> a) {
    map<int, int> mp;
    for(int e : a) mp[e]++;
    int ans = mp[0];
    for(int i = 1; i < 99; i++){
        int curr = max(mp[i] + mp[i+1], mp[i] + mp[i-1]);
        ans = max(ans, curr);
    }
    return ans;
}