solves #702: Search in sorted array of unknown size in java

Author: anishLearnsToCode

README.md

@@ -398,6 +398,7 @@
 | 696  | [Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings)                                                                                       |                                                   [![Java](assets/java.png)](src/CountBinarySubstrings.java) [![Python](assets/python.png)](python/count_binary_substrings.py)                                                   |                                                                                                                                   |
 | 697  | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array)                                                                                                 |                                                        [![Java](assets/java.png)](src/DegreeOfAnArray.java) [![Python](assets/python.png)](python/degree_of_an_array.py)                                                         |                                                                                                                                   |
 | 700  | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree)                                                                         |                                               [![Java](assets/java.png)](src/SearchInBinarySearchTree.java) [![Python](assets/python.png)](python/search_in_binary_search_tree.py)                                               |                                                                                                                                   |
+| 702  | [Search In A Sorted Array of Unknown Size](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size)                                                     |                                                                              [![Java](assets/java.png)](src/SearchInSortedArrayOfUnknownSize.java)                                                                               |                                                                                                                                   |
 | 703  | [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream)                                                                       |                                            [![Java](assets/java.png)](src/KthLargestElementInAStream.java) [![Python](assets/python.png)](python/k_th_largest_element_in_a_stream.py)                                            |                                                                                                                                   |
 | 704  | [Binary Search](https://leetcode.com/problems/binary-search)                                                                                                           |                                                            [![Java](assets/java.png)](src/BinarySearch.java) [![Python](assets/python.png)](python/binary_search.py)                                                             |                                                                                                                                   |
 | 705  | [Design HashSet](https://leetcode.com/problems/design-hashset)                                                                                                         |                                                           [![Java](assets/java.png)](src/DesignHashSet.java) [![Python](assets/python.png)](python/design_hash_set.py)                                                           |                                                                                                                                   |

src/SearchInSortedArrayOfUnknownSize.java

@@ -0,0 +1,26 @@
+// https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size
+// T: O(logN)
+// S: O(1)
+
+public class SearchInSortedArrayOfUnknownSize {
+    public interface ArrayReader {
+        int get(int index);
+    }
+
+    public int search(ArrayReader reader, int target) {
+        int left = 0, right = 1, middle;
+
+        while (reader.get(right) < target) {
+            left = right;
+            right *= 2;
+        }
+
+        while (left <= right) {
+            middle = left + (right - left) / 2;
+            if (reader.get(middle) == target) return middle;
+            else if (reader.get(middle) < target) left = middle + 1;
+            else right = middle - 1;
+        }
+        return -1;
+    }
+}