Given interval list, and a number k
The degree of the overlap intervals should be smaller and equal to k
If we want to insert a new interval, is there a method that we can check it with complexity smaller than O(n) ?
Comments (1)
Given interval list, and a number k
The degree of the overlap intervals should be smaller and equal to k
If we want to insert a new interval, is there a method that we can check it with complexity smaller than O(n) ?