Implement function countNumbers that accepts a sorted array of unique integers and, efficiently with respect to time used, counts the number of array elements that are less than the parameter lessThan.

For example, SortedSearch.countNumbers(new int[] { 1, 3, 5, 7 }, 4) should return 2 because there are two array elements less than 4.

  •   Example case: java.lang.UnsupportedOperationException at SortedSearch.countNumbers(
  •   Various small arrays: java.lang.UnsupportedOperationException at SortedSearch.countNumbers(
  •   Performance test when sortedArray contains lessThan: java.lang.UnsupportedOperationException at SortedSearch.countNumbers(
  •   Performance test when sortedArray doesn't contain lessThan: java.lang.UnsupportedOperationException at SortedSearch.countNumbers(

Java Algorithmic Thinking Binary Search Public


Would you like to see our other questions?

We have 1000+ premium hand-crafted questions for 160+ job skills and 20+ coding languages. We prefer questions with small samples of actual work over academic problems or brain teasers.

Visit our question library
Private Concierge

Send us an email with an explanation of your testing needs and a list of candidates. We will create an appropriate test, invite your candidates, review their results, and send you a detailed report.

Contact Private Concierge

On the TestDome Blog

Screening Applicants: The Good, the Bad and the Ugly

Since we’re all biased and we use incorrect proxies, why not just outsource hiring to experts or recruitment agencies? After all, they’ve been screening people for many years, so they must know how to do it right?

Not really. I was surprised to discover that many experts disagree with each other. Everybody praises their pet method and criticizes the others. Many of these methods look legitimate, but are based on...

Dashboard Start Trial Sign In Home Tour Tests Questions Pricing