Added test

Author: javadev

src/main/java/g3101_3200/s3161_block_placement_queries/Solution.java

@@ -68,9 +68,7 @@ private void refresh() {
         }
 
         public void max(int n, int[] t) {
-            if (start > n) {
-                return;
-            } else if (end <= n) {
+            if (end <= n) {
                 t[0] = Math.max(t[0], len);
                 if (obstacle) {
                     t[1] = max;

src/test/java/g3101_3200/s3161_block_placement_queries/SolutionTest.java

@@ -21,4 +21,13 @@ void getResults2() {
                         .getResults(new int[][] {{1, 7}, {2, 7, 6}, {1, 2}, {2, 7, 5}, {2, 7, 6}}),
                 equalTo(List.of(true, true, false)));
     }
+
+    @Test
+    void getResults3() {
+        assertThat(
+                new Solution()
+                        .getResults(
+                                new int[][] {{1, 4}, {1, 9}, {2, 15, 4}, {2, 11, 6}, {2, 13, 10}}),
+                equalTo(List.of(true, false, false)));
+    }
 }