Second task of HackerRank

Solution.java

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

public class Solution {

    public static int[] counts(int[] nums, int[] maxes) {
        Arrays.sort(nums);
        List<Integer> result = new ArrayList<>();
        for (int m : maxes) {
            int num = searchIteratively(nums, m);
            result.add(num);
        }

        return result.stream()
                .mapToInt(i -> i)
                .toArray();
    }

    private static int searchIteratively(int[] arr, int key) {
        int low = 0;
        int high = arr.length - 1;

        while (low <= high) {
            int mid = low + ((high - low) / 2);

            if (arr[mid] == key) {
                low = mid + 1;
            }
            if (key < arr[mid]) {
                high = mid - 1;
            } else {
                low = mid + 1;
            }
        }
        return low;
    }
}