Pre-requisites: Segment Tree
Given an array of digits arr. Given a number of range [L, R] and a digit X with each range. The task is to check for each given range [L, R] whether the digit X is present within that range in the array arr.
Input : arr = [1, 3, 3, 9, 8, 7] l1=0, r1=3, x=2 // Range 1 l1=2, r1=5, x=3 // Range 2 Output : NO YES For Range 1: The digit 2 is not present within range [0, 3] in the array. For Range 2: The digit 3 is present within the range [2, 5] at index 2 in the given array.
Naive Approach: A naive approach is to traverse through each of the given range of the digits in the array and check whether the digit is present or not.
Time Complexity: O(N) for each query.
Better Approach: A better approach is to use Segment Tree. Since there are only 10 digits possible from (0-9), so each node of the segment tree will contain all the digits within the range of that node. We will use Set Data Structure at every node to store the digits. Set is a special data structure which removes redundant elements and store them in ascending order. We have used set data structure since it will be easier to merge 2 child nodes to get the parent node in the segment tree. We will insert all the digits present in the children nodes in the parent set and it will automatically remove the redundant digits. Hence at every set(node) there will be at max 10 elements (0-9 all the digits).
Also there are inbuilt count function which returns the count of the element present in the set which will be helpful in the query function to check whether a digit is present at the node or not. If the count will be greater than 0 that means the element is present in the set we will return true else return false.
Below is the implementation of the above approach:
Time Complexity: O(N) once for building the segment tree, then O(logN) for each query.
- Array range queries over range queries
- Binary Indexed Tree : Range Update and Range Queries
- Count of Numbers in Range where first digit is equal to last digit of the number
- Range LCM Queries
- Range sum queries without updates
- Min-Max Range Queries in Array
- Range and Update Sum Queries with Factorial
- Subset Sum Queries in a Range using Bitset
- Sudo Placement | Range Queries
- Range product queries in an array
- Queries on XOR of greatest odd divisor of the range
- Two equal sum segment range queries
- Queries for bitwise OR in the index range [L, R] of the given array
- Queries for bitwise AND in the index range [L, R] of the given array
- Range Queries to Find number of sub-arrays with a given xor
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.