You are given an array of intervals where each interval is represented by a pair $[start_i, end_i]$. The $start_i$ values are unique, meaning no two intervals begin at the same time.

The task is to find the right interval for each interval in the list. The right interval for an interval $i$ is an interval $j$ such that $start_j >= end_i$ and $start_j$ is minimized (i.e., it is the smallest start ...