Leetcode, Interval, Interview Questions, Google, Meta.
and J which is [min start(I, J), max end (I, J)] if only min end (I, J) > max start(I, J). If J’s end is longer than I’s, we move to the I+1 interval of 1st list after finding the intersection of I and J which is [min start(I, J), max end (I, J)] if only min end (I, J) > max start(I, J). If both I