Count X in Range of Sorted Array | GFG POTD | Binary Search | Java

In this video, we solve GeeksforGeeks Problem of the Day – *Count X in Range of a Sorted Array* using *Binary Search* (Lower Bound & Upper Bound) in Java.

🔹 *Problem Statement*
*You are given:*
* A sorted array arr[]
* Multiple queries queries[i] = [l, r, x]
* For each query, count how many times the number x appears in the subarray arr[l…r] (inclusive).

🔹 *Optimized Approach Used*
* Use Lower Bound to find the first occurrence of x
* Use Upper Bound to find the last occurrence of x
* Clamp the range to [l, r]
* Count = max(0, min(upper, r) - max(lower, l) + 1)

📌 *Time Complexity:* *O(log n)* per query
📌 *Space Complexity:* *O(1)* (excluding output)

🔹 *Resources*
* *Problem Link:* https://www.geeksforgeeks.org/problems/count-x-in-range-of-a-sorted-array/1
* *Code Link:* https://github.com/sibasundarj8/java-DSA/blob/main/BinarySearch/Searching_Count_X_in_Range_of_a_Sorted_Array.java

👍 *Like* | 💬 *Comment* | 🔔 *Subscribe* for daily GFG POTD solutions

#gfgpotd #geeksforgeekspotd #countinrange#gfgproblemoftheday #gfgdailyproblem #javadsa #dsainjava #sorting #greedyalgorithm #minimummovesproblem #gfgjavasolution #codinginterview #arrayproblems #javacodinginterview #competitiveprogramming #dailydsapractice #codinginterview #gfgpractice #codinginterview #problemoftheday #gfgpotd #java #binarysearch #interviewpreparation

Видео Count X in Range of Sorted Array | GFG POTD | Binary Search | Java канала The Optimal Approach