Question

View site information Pevchometric testing is designed to find JUDICIO VAIT mormation about an applicant that the traditional interview process would not uncover. It typically includes a combination of online aptitude and personality tests that measure cognitive ability and personality traits. A company has psychometric scores for n candidates, and it will only extend job offers to candidates with scores in the inclusive range given by [lowerLimit, upperLimit). Given the list of scores and a sequence of score ranges, determine how many candidates the company will extend offers to for each range of scores. For example, if the scores are scores = [1,2,2,3,4) and the limits are 2 and 4, there are 4 candidates, i.e. those with scores [2,2,3,4] that match the conditions. Function Description Complete the jobOffers function in the editor below. The function must return an array of q integers where the value at each index i denotes the number of candidates in the inclusive range flowerLimits[i]. upperLimits[i]] that the company will extend offers to

Language: Java

Answer 1

import java.util.*;
import java.lang.*;
import java.io.*;

class Main
{
public static int[] jobOffers(int scores[],int lowerLimit[],int upperLimit[]){
int offers[] = new int[lowerLimit.length];
HashMap<Integer,Integer> hm = new HashMap<>();
  
for(int i=0;i<scores.length;i++){
Integer count = (hm.get(scores[i])==null ? 0 : hm.get(scores[i]));
count++;
hm.put(scores[i],count);

}
  
for(int i=0;i<lowerLimit.length;i++){
  
int ll=lowerLimit[i];
int up= upperLimit[i];
int count =0;
if(ll!=up){
for(int j=ll;j<=up;j++){
int addcount = (hm.get(j)==null ? 0 : hm.get(j));
count = count + addcount;
  
}
}
else{
int addcount1 = (hm.get(ll)==null ? 0 : hm.get(ll));
count = addcount1;
}
offers[i]= count;
}
  
return offers;
}
   public static void main (String[] args) throws java.lang.Exception
   {
       // your code goes here
       int n,q;
       Scanner sc = new Scanner(System.in);
       n= sc.nextInt();
       q= sc.nextInt();
       int[] scores = new int[n];
       int[] upperLimit = new int[q];
       int[] lowerLimit = new int[q];
       int[] offers = new int[q];
       for(int i=0;i<n;i++){
       scores[i]=sc.nextInt();
       }
       for(int i=0;i<q;i++){
       lowerLimit[i]=sc.nextInt();
       }
       for(int i=0;i<q;i++){
       upperLimit[i]=sc.nextInt();
       }
       offers = jobOffers(scores,lowerLimit,upperLimit);
       for(int i=0;i<q;i++){
       System.out.println(offers[i]);
       }
   }
}

//code:

W NP import java.util.*; import java.lang. *; import java.io.*; class Main { public static int[] jobOffers(int scores[], int lowerLimit[], int upperLimit[]){ int offers[] = new int[lowerLimit.length]; HashMap<Integer, Integer> hm = new HashMap<>(); 2 3 4 5 6 7- 8- 9 10 11 12 - 13 14 15 16 17 18 19 - 20 21 22 23 24 - 25 for(int i=0;i<scores.length;i++){ Integer count = (hm.get(scores[i])==null ? 0 : hm.get (scores[i])); count++; hm.put(scores[i], count); سہا for(int i=0;i<lowerlimit.length;i++){ int 11=lowerLimit[i]; int up= upperlimit[i]; int count =0; if(11!=up) { for(int j=11;j<=up; j++){ int addcount = (hm.get(i)==null ? 0 : hm.get(j)); count = count + addcount; 27 فسا } else{ int addcount1 = (hm.get(11)==null ? 0 : hm.get(11)); count = addcount1; 29 30 31 - 32 33 34 35 36 37 38 39 } offers[i]= count; ههه return offers; }

{ 40 41 42 43 44 45 46 47 48 49 50 51 - 52 53 54 - 55 56 57 - 58 public static void main (String[] args) throws java.lang. Exception // your code goes here int n,9; Scanner sc = new Scanner(System.in); n= sc.nextInt(); q= sc.nextInt(); int[] scores = new int[n]; int[] upperLimit = new int[q]; int[] lowerLimit = new int[q]; int[] offers = new int[9]; for(int i=0;i<n;i++){ scores[i]=sc.nextInt(); B for(int i=0;i<q;i++){ lowerLimit[i]=sc.nextInt(); } for(int i=0;i<q;i++){ upperLimit[i]=sc.nextInt(); 59 } 60 61 - 62 63 64 65 offers = jobOffers(scores, lowerLimit, upperlimit); for(int i=0;i<q;i++){ System.out.println(offers[i]); هه } }

//sample execution:

Custom Input 5 2 1 2 2 3 4 2 1 3 1 Status Successfully executed Date 2020-07-31 19:26:55 Time 0.12 sec Mem 2184.192 kB X Input 5 2 1 2 2 3 4 2 1 31 Output 3 1