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

Sort 1863 Discussions, By:

  • pokedev8
     + 91 comments

    I'm not sure if it was just me, but my problem was with the way the question was phrased?

    "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 <= 1."

    So, if our array was 4, 6, 5, 3, 3, 1

    I assumed from the question that we would check every integer for the absolute difference. For example:

    Check 4 - 6, 4 - 5, 4 - 3, 4 - 3, 4 - 1. Then: Check 6 - 5, 6 - 3, 6 - 3, 6 - 1. So on and so forth.

    I realised at the end I interpreted the question incorrectly, but is it just me who misread the question?

  • karthickaravind1
     + 79 comments

    Python code:

    n=int(input())
l=[int(i) for i in input().split()]
maximum=0
for i in l:
    c=l.count(i)
    d=l.count(i-1)
    c=c+d
    if c > maximum:
        maximum=c
print(maximum)

  • rishabhrajjha
     + 55 comments
    #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int main() {
   int n,k,max = 0;
    cin>>n;
    int a[100]={0};
    for(int i = 0;i<n;i++){
        cin>>k;
        a[k]++;
    }
    for(int i = 0;i<n-1;i++){
        if(a[i]+a[i+1]> max) max = a[i]+a[i+1];
    }
    cout<<max;
    return 0;
}

  • Kanahaiya
     + 9 comments

    Hello friends,

    Today, I have solved Picking Number hackerrank problem in O(N) time.

    In this video tutorial, I have explained the technique to come up with easy algorithm which will pass all the test cases in O(n) time.

    click here for the video explanation of generic algorithm with complexity analysis.

    or you can click on the image too to follow youtube tutorial.

    Here is the 100% working solution:-

    source code :

    public static int pickingNumbers(List<Integer> a) {
	int frequency[] = new int[101];
	int result = Integer.MIN_VALUE;

	for (int i = 0; i < a.size(); i++) {
		int index=a.get(i);
		frequency[index]++; //frequency[index]=frequency[index]+1
	}

	for (int i = 1; i <= 100; i++) {
		result = Math.max(result, frequency[i] + frequency[i - 1]);
	}
	return result;

}

    Would really appreciate your feedback like, dislike , comment etc. on my video.

    Do not forget to upvote, if you find it useful.

  • somendra_raj5
     + 13 comments
    import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] a = new int[n];
        for(int a_i=0; a_i < n; a_i++){
            a[a_i] = in.nextInt();
        }
        int x = getMaxSet(a, n);
        System.out.println(x);
    }
    
    static int getMaxSet(int arr[], int n){
        Arrays.sort(arr);
        int cnt =0;
        int max=0;
        for(int i=0;i<n;i++){
            for(int j=i;j<n;j++){
                if(arr[j]-arr[i]<=1){
                    cnt++;
                }
            }
            if(cnt>max)
                max=cnt;
            cnt=0;
        }
        return max;
    }
}
Load more conversations