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;
}

def pickingNumbers(a):
    return max(
        (max(a.count(e + 1), a.count(e - 1)) + a.count(e)) for e in set(a)
    )

 public static int pickingNumbers(List<Integer> a) {
    // Write your code here
    int longestSubArrayLength = 0;
    Collections.sort(a);
    
    for(int i = 0; i < a.size() - 1; i++){
      int comparator = a.get(i);
      List<Integer> subArray = new ArrayList<Integer>();
      subArray.add(comparator);
      for(int j = i + 1; j < a.size(); j++){
        int range = Math.abs(comparator - a.get(j));
        if(range == 0 || range == 1) subArray.add(a.get(j));  
        else break;

      }
      if(subArray.size() > longestSubArrayLength)
       longestSubArrayLength = subArray.size();
       
    }
    return longestSubArrayLength;

  }

def pickingNumbers(a):
    s=[]
    c1,c2=0,0
    for i in range(len(a)):
        for j in range(len(a)):
            if a[i] in [a[j],a[j]-1]:
                c1+=1
            if a[i] in [a[j],a[j]+1]:
                c2+=1
        s.append(c1)
        s.append(c2)
        c1=0
        c2=0
    return max(s)

public static int pickingNumbers(List<Integer> a) {
    // Write your code here
        Collections.sort(a);
        int max = 0;
        int total = 0;
        boolean diffNumber = false;
        for (int i = 0; i < a.size() - 1; i++) {
            if (a.get(i + 1) - a.get(i) == 0) {
                total++;   
            } else if (a.get(i + 1) - a.get(i) == 1 && !diffNumber) {
                total++;
                diffNumber = true;
            } else {
                total = 0;
                diffNumber = false;
            }
            
            if (total > max)
                max = total;
        }
        return max + 1;
    }