How should I practice Count Target Occurrences in a Sorted Array?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Bloomberg LP phone screen problems in FastPrep.

Is Count Target Occurrences in a Sorted Array associated with Bloomberg LP?

FastPrep tags this as a Bloomberg LP phone screen coding practice problem when the problem catalog has that company and stage context.

Count Target Occurrences in a Sorted Array

Bloomberg LP● EasyNEW GRADPHONE SCREEN

Learn

Problem statement

Given a nondecreasing integer array nums and integer target, return how many times target occurs.

Your algorithm must run in O(log n) time.

Function

countTarget(nums: int[], target: int) → int

Examples

Example 1

nums = [1,2,2,2,3]target = 2return = 3

Target 2 occupies indices 1 through 3.

Example 2

nums = [1,3,5]target = 2return = 0

Target 2 is absent.

Constraints

0 <= nums.length <= 10^5.
nums is sorted in nondecreasing order.