You are given N segments defined by their starting point a_i and end point b_i. You need to determine the number of points such that at least K segments contain them.
What is the most efficient way to do this task? Thanks in advance.

How do I calculate the length of the path to the farthest node for all nodes in a weighted tree?

Thanks in advance. :)