add 1893

fishercoder1534 · fishercoder1534 · commit b3eb2c4bbb2b · 2021-07-05T16:22:49.000-07:00
diff --git a/README.md b/README.md
@@ -15,6 +15,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1904|[The Number of Full Rounds You Have Played](https://leetcode.com/problems/the-number-of-full-rounds-you-have-played/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1904.java) ||Medium|String, Greedy|
 |1903|[Largest Odd Number in String](https://leetcode.com/problems/largest-odd-number-in-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1903.java) |[:tv:](https://youtu.be/IIt_ARZzclY)|Easy|Greedy|
 |1897|[Redistribute Characters to Make All Strings Equal](https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1897.java) ||Easy|String, Greedy|
+|1893|[Check if All the Integers in a Range Are Covered](https://leetcode.com/problems/check-if-all-the-integers-in-a-range-are-covered/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1893.java) ||Easy|Array, HashTable, Prefix Sum|
 |1886|[Determine Whether Matrix Can Be Obtained By Rotation](https://leetcode.com/problems/determine-whether-matrix-can-be-obtained-by-rotation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1886.java) ||Easy|Array|
 |1880|[Check if Word Equals Summation of Two Words](https://leetcode.com/problems/check-if-word-equals-summation-of-two-words/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1880.java) ||Easy|String|
 |1877|[Minimize Maximum Pair Sum in Array](https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1877.java) ||Medium|Greedy, Sort|
diff --git a/src/main/java/com/fishercoder/solutions/_1893.java b/src/main/java/com/fishercoder/solutions/_1893.java
@@ -0,0 +1,18 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+
+public class _1893 {
+    public static class Solution1 {
+        public boolean isCovered(int[][] ranges, int left, int right) {
+            Arrays.sort(ranges, (a, b) -> a[0] != b[0] ? a[0] - b[0] : a[1] - b[1]);
+            int checked = left;
+            for (int[] range : ranges) {
+                while (checked >= range[0] && checked <= range[1]) {
+                    checked++;
+                }
+            }
+            return checked >= (right + 1);
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1893Test.java b/src/test/java/com/fishercoder/_1893Test.java
@@ -0,0 +1,68 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1893;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1893Test {
+    private static _1893.Solution1 solution1;
+    private static int[][] ranges;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1893.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        ranges = new int[][]{
+                {1, 10},
+                {10, 20}
+        };
+        assertEquals(false, solution1.isCovered(ranges, 21, 21));
+    }
+
+    @Test
+    public void test2() {
+        ranges = new int[][]{
+                {50, 50}
+        };
+        assertEquals(false, solution1.isCovered(ranges, 1, 50));
+    }
+
+    @Test
+    public void test3() {
+        ranges = new int[][]{
+                {1, 10},
+                {10, 20}
+        };
+        assertEquals(false, solution1.isCovered(ranges, 21, 25));
+    }
+
+    @Test
+    public void test4() {
+        ranges = new int[][]{
+                {1, 50}
+        };
+        assertEquals(true, solution1.isCovered(ranges, 1, 50));
+    }
+
+    @Test
+    public void test5() {
+        ranges = new int[][]{
+                {1, 2}, {3, 4}, {5, 6}
+        };
+        assertEquals(true, solution1.isCovered(ranges, 2, 5));
+    }
+
+    @Test
+    public void test6() {
+        ranges = new int[][]{
+                {50, 50}
+        };
+        assertEquals(false, solution1.isCovered(ranges, 49, 49));
+    }
+
+}
