solves search insert position

Author: anishLearnsToCode

README.md

@@ -22,7 +22,7 @@
 | 26 | [Remove Duplicates From Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/RemoveDuplicatesFromSortedArray.java) |
 | 27 | [Remove Element](https://leetcode.com/problems/remove-element/) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/RemoveElement.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/python/remove_element.py)|
 | 28 | [Needle in Haystack](https://leetcode.com/problems/implement-strstr) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/NeedleInHaystack.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/python/needle_in_haystack.py)|
-| 2 | []() | Easy | |
+| 35 | [Search Inserted Position](https://leetcode.com/problems/search-insert-position/) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)]() |
 | 2 | []() | Easy | |
 | 2 | []() | Easy | |
 | 2 | []() | Easy | |

src/SearchInsertPosition.java

@@ -0,0 +1,19 @@
+public class SearchInsertPosition {
+    public int searchInsert(int[] nums, int target) {
+        return binarySearchNextLargest(nums, target);
+    }
+
+    private int binarySearchNextLargest(int[] array, int val) {
+        if (array == null || array.length == 0) return 0;
+
+        int left = 0, right = array.length - 1, middle;
+        while (left <= right) {
+            middle = left + (right - left) / 2;
+            if (array[middle] == val) return middle;
+            else if (array[middle] > val) right = middle - 1;
+            else left = middle + 1;
+        }
+
+        return left;
+    }
+}