```
I appeared for Hackerrank intermediate problem-solving certification.
came across the below-mentioned problem and was stuck for more than an hour.
```

```
Let there are n number of students and every student has predefined
skill-level ,S where S[i] defines skill-Level of ith student .what is the
maximum number of pairs that can be formed such that the difference
between the skill-Level of students in a pair is not less than a number
,minDiff.
Constraints :
1<n<=2*10^5
0<=S[i]<=10^9
0<=minDiff<=10^5
```