Frequency in a Sorted Array Problem Statement

Given a sorted array ARR and a number X, your task is to determine the count of occurrences of X within ARR.

Note:

• If X is not found in the array, return 0.
• The array is sorted in non-decreasing order.

Input Format:

The first line contains an integer ‘T’ representing the number of test cases. Each test case includes two subsequent parts:

1. An integer N representing the size of the input array.
2. A line of N integers denoting the elements of the array.
3. A single integer X for which you need to find occurrences.

Output Format:

For each test case, output a single line containing an integer representing the number of times the target element X appears in the array.

Follow Up:

Try to implement a solution with O(log(N)) time complexity and O(1) space complexity.

Constraints:

• 1 ≤ T ≤ 10²
• 1 ≤ N ≤ 10⁴
• 0 ≤ ARR[i], X ≤ 10⁹
• Time Limit: 1 sec

Special Note:

Your task is to implement the specified function, and you are not required to manage any input or output operations.