Question

Hi, I have Java programming problem:

In the army, each soldier has an assigned rank. A soldier of rank X has to report to (any) soldier of rank X + 1. Many soldiers can report to the same superior. Write a function: class Solution { public int solution(int[] ranks); } that, given an array ranks consisting of soldiers' ranks, returns the number of soldiers who can report to some superior. Examples: 1. Given ranks = [3, 4, 3,0, 2, 2, 3, 0, 0], your function should return 5, because • Three soldiers of rank 3 (ranks[0], ranks[2], ranks[6]) may report to a soldier of rank 4 (ranks[1]). • Two soldiers of rank 2 may report to any soldier of rank 3. 2. Given ranks = [4, 2, 0], your function should return 0. 3. Given ranks = [4, 4, 3, 3, 1, 0), your function should return 3, because • A soldier of rank 0 can report to a soldier of rank 1. • Two soldiers of rank 3 can report to any soldier of rank 4.

Please solve using Java.

Thanks.

Best Regards.

Answer 1

Program Code Screenshot :

1 import java.util.HashSet; import java.util.Set; 2 3 4 class Solution 5 6 a 7 00 public int solution (int[] ranks){ //store all the elements in the set Set<Integer> set = new HashSet<Integer>(); for(int i=0;i<ranks.length;i++){ set.add(ranks[i]); 9 19 11 } 12 13 14 D // Loop through all elements in the array int ans = 0; for(int x : ranks) { //Check if x+1 is present if(set.contains(x+1)){ ans++; 15 16 17 18 } 19 } 20 return ans; 21 } 22 23 24 public static void main(String[] args) { int ranks[] = {3,4,3,0,2,2,3,0,@}; System.out.println(new Solution().solution (ranks)); 25 26 نہا 27

Sample Output :

Run: Solution 个 "C:\Program Files\Java\jdk-13\bin\java.exe" 5 UI Process finished with exit code o =

Program Code to Copy

import java.util.HashSet;
import java.util.Set;

class Solution{

    public int solution(int[] ranks){
        //store all the elements in the set
        Set<Integer> set = new HashSet<Integer>();
        for(int i=0;i<ranks.length;i++){
            set.add(ranks[i]);
        }
        //Loop through all elements in the array
        int ans = 0;
        for(int x : ranks){
            //Check if x+1 is present
            if(set.contains(x+1)){
                ans++;
            }
        }
        return ans;
    }

    public static void main(String[] args) {
        int ranks[] = {3,4,3,0,2,2,3,0,0};
        System.out.println(new Solution().solution(ranks));
    }
}