You are given N intervals and Q ranges. For each range you have to count number of intervals lying completely inside the range.
How can we do this query per range in O(log n)?
Count intervals in a given range
You are given N intervals and Q ranges. For each range you have to count number of intervals lying completely inside the range.
How can we do this query per range in O(log n)?