436. Find Right Interval

436. Find Right Interval #leetcode #leetcodequestionandanswers #2darray #amazoninterviewpreparation #microsoftinterview #googleinterview #javainterviewquestions #java #javaprogramming
leetcode.com/problems/find-ri...
You are given an array of intervals, where intervals[i] = [starti, endi] and each starti is unique.
The right interval for an interval i is an interval j such that startj greater than equal endi and startj is minimized. Note that i may equal j.
Return an array of right interval indices for each interval i. If no right interval exists for interval i, then put -1 at index i.

[@bsrayat8200]

❤