Need help in set.

chef_keshav · January 28, 2018, 5:02am

Given a set of pairs. Each pair represent a range of numbers.

Example : (5, 8) represents {5, 6, 7, 8}.

I want to find in which pair an element x is present, it is sure that element x exits in at least one pair?

Can this be solved in logarithmic time? Thanks in advance!

arnav_mandal · January 28, 2018, 8:58am

There must be some other constraints too else this would be a very easy problem.Just take min and max value of the set.That would be your answer.

harrypotter0 · January 28, 2018, 9:14am

“Can this be solved in logarithmic time?”
This is the constraint I guess.

pk301 · January 28, 2018, 11:15pm

is there are overlapping pairs?

hemanth_1 · January 28, 2018, 11:31pm

Sort, join overlapping pairs, binary search.

bansal1232 · January 29, 2018, 2:45pm

Can you please paste the exact link of question? It will help us to sort out weather it is genuine question or it is not taken from any ongoing contest.