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

Given an array intervals where intervals[i] = [li, ri] represent the interval [li, ri), remove all intervals that are covered by another interval in the list.
The interval [a, b) is covered by the interval [c, d) if and only if c <= a and b <= d.
Return the number of remaining intervals.
 
Please complete the following python code precisely:
```python
class Solution:
    def removeCoveredIntervals(self, intervals: List[List[int]]) -> int:
```