@@ -0,0 +1,783 @@
+package leetcode;%0A%0Aimport java.util.HashMap;%0Aimport java.util.Map;%0A%0A/**%0A * https://leetcode.com/problems/check-if-all-the-integers-in-a-range-are-covered/%0A */%0Apublic class Problem1893 %7B%0A    public boolean isCovered(int%5B%5D%5B%5D ranges, int left, int right) %7B%0A        Map%3CInteger, Boolean%3E coveredMap = new HashMap%3C%3E();%0A        for (int i = left; i %3C= right; i++) %7B%0A            coveredMap.put(i, false);%0A        %7D%0A        for (int%5B%5D range : ranges) %7B%0A            for (int i = range%5B0%5D; i %3C= range%5B1%5D; i++) %7B%0A                if (coveredMap.containsKey(i)) %7B%0A                    coveredMap.put(i, true);%0A                %7D%0A            %7D%0A        %7D%0A        boolean answer = true;%0A        for (boolean c : coveredMap.values()) %7B%0A            answer &= c;%0A        %7D%0A        return answer;%0A    %7D%0A%7D%0A

Solve problem 1893