Two best non overlapping events
Problem  Recursive approach: leading to TLE TC: O(2^n) exponential, since at every max() call we have...
Tags: leetcode, dsa, dp, binarysearch