Please solve the programming task below using a self-contained code snippet in a markdown code block.

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 >= 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.
 
Please complete the following python code precisely:
```python
class Solution:
    def findRightInterval(self, intervals: List[List[int]]) -> List[int]:
```