# Hackerrank - Picking Numbers Solution

Given an array of integers, find and print the maximum number of integers you can select from the array such that the absolute difference between any two of the chosen integers is less than or equal to . For example, if your array is , you can create two subarrays meeting the criterion: and . The maximum length subarray has elements.

**Function Description**

Complete the *pickingNumbers* function in the editor below. It should return an integer that represents the length of the longest array that can be created.

pickingNumbers has the following parameter(s):

*a*: an array of integers

**Input Format**

The first line contains a single integer , the size of the array .

The second line contains space-separated integers .

**Constraints**

- The answer will be .

**Output Format**

A single integer denoting the maximum number of integers you can choose from the array such that the absolute difference between any two of the chosen integers is .

**Sample Input 0**

```
6
4 6 5 3 3 1
```

**Sample Output 0**

`3`

**Explanation 0**

We choose the following multiset of integers from the array: . Each pair in the multiset has an absolute difference (i.e., and ), so we print the number of chosen integers, , as our answer.

**Sample Input 1**

```
6
1 2 2 3 1 2
```

**Sample Output 1**

`5`

**Explanation 1**

We choose the following multiset of integers from the array: . Each pair in the multiset has an absolute difference (i.e., , , and ), so we print the number of chosen integers, , as our answer.

### Solution in Python

```
from collections import Counter
def pickingNumbers(a):
a = Counter(a)
maxi = 0
for k in sorted(a):
m = a[k]+a.get(k+1,0)
if maxi<m:
maxi=m
return maxi
input()
a = map(int,input().split())
print(pickingNumbers(a))
```

*Using list comprehension*

```
from collections import Counter
def pickingNumbers(a):
a = Counter(a)
return max(a[k]+a.get(k+1,0) for k in sorted(a))
input()
a = map(int,input().split())
print(pickingNumbers(a))
```