Algo Practice in Go
- DoubleBooked Question implemented using Balanced Tree
- Questions Description: Given a sequence of events, each having a start and end time, write a program that will return the sequence of all pairs of overlapping events. Assume half-open intervals, e.g. [0,2) & [2,3) are not overlapped.
- Reference: https://en.wikipedia.org/wiki/Interval_tree