Leetcode, Interval, Interview Questions, Google, Meta.
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 [max start(I, J), min end (I, J)] if only min end (I, J) > max start(I, J). If both I and J have same end, then advance both the list to I+1