Picking Numbers Solution in Java| HackerRank | Picking Numbers HackerRank Solution Java Picking Numbers Solution HackerRank | Picking Numbers Solution

 

Picking Numbers Solution in Java| HackerRank | Picking Numbers HackerRank Solution Java

Picking Numbers Solution HackerRank | Picking Numbers Solution

Picking Numbers Solution in Java

Picking Numbers Solution in Java

Picking Numbers HackerRank Solution in Java

Problem:

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 .

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.

https://www.hackerrank.com/challenges/picking-numbers/problem

Day of the Programmer HackerRank Solution in Java

Day of the Programmer Solution 

import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;

class Result {

    /*
     * Complete the 'pickingNumbers' function below.
     *
     * The function is expected to return an INTEGER.
     * The function accepts INTEGER_ARRAY a as parameter.
     */
    
    public static int pickingNumbers(List<Integer> a) {
    // Write your code here
        int maxDiffCount=0,diffCount=0;
        Collections.sort(a);
        for(int i=0;i<a.size()-1;i++){
            for(int j=i+1;j<a.size();j++){
                int diff=Math.abs(a.get(i)-a.get(j));   
                if(diff>1){
                    break;
                }
                diffCount++;
                if(diffCount>maxDiffCount){
                    maxDiffCount=diffCount;
                }
            }   
            diffCount=0;
        }
        return maxDiffCount+1;
    }
}
public class Solution {
    public static void main(String[] args) throws IOException {
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));

        int n = Integer.parseInt(bufferedReader.readLine().trim());

        List<Integer> a = Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))
            .map(Integer::parseInt)
            .collect(toList());

        int result = Result.pickingNumbers(a);

        bufferedWriter.write(String.valueOf(result));
        bufferedWriter.newLine();

        bufferedReader.close();
        bufferedWriter.close();
    }
}