solved 704. Binary Search

Signed-off-by: rajput-hemant <hemant.rajput_cs20@gla.ac.in>

Author: rajput-hemant

TOPICWISE.md

@@ -22,6 +22,7 @@
 | **0051** |             [N-Queens][51]             |               Array, Backtracking               |  ![][hard]  |        |
 | **0075** |           [Sort Colors][75]            |          Array, Two Pointers, Sorting           | ![][medium] |        |
 | **0283** |           [Move Zeroes][283]           |               Array, Two Pointers               |  ![][easy]  |        |
+| **0704** |          [Binary Search][704]          |              Array, Binary Search               |  ![][easy]  |        |
 | **1232** | [Check If It Is a Straight Line][1232] |              Array, Math, Geometry              |  ![][easy]  |        |
 | **1480** |    [Running Sum of 1d Array][1480]     |                Array, Prefix Sum                |  ![][easy]  |        |
 | **1537** |     [Get the Maximum Score][1537]      | Array, Two Pointer, Dynamic Programming, Greedy |  ![][hard]  |        |
@@ -126,6 +127,7 @@
 | **0222** | [Count Complete Tree Nodes][222] | Binary Search, Tree, DFS, Binary Tree  | ![][medium] |        |
 | **0278** |     [First Bad Version][278]     |       Binary Search, Interactive       |  ![][easy]  |        |
 | **0367** |   [Valid Perfect Square][367]    |          Math, Binary Search           |  ![][easy]  |        |
+| **0704** |       [Binary Search][704]       |          Array, Binary Search          |  ![][easy]  |        |
 
 ## Matrix
 
@@ -572,6 +574,7 @@
 [369]: ./src/0301-0400/369%20-%20Plus%20One%20Linked%20List/
 [543]: ./src/0501-0600/543%20-%20Diameter%20of%20Binary%20Tree/
 [653]: ./src/0601-0700/653%20-%20Two%20Sum%20IV%20-%20Input%20is%20a%20BST/
+[704]: ./src/0701-0800/704%20-%20Binary%20Search/
 [1047]: ./src/1001-1100/1047%20-%20Remove%20All%20Adjacent%20Duplicates%20In%20String/
 [1232]: ./src/1201-1300/1232%20-%20Check%20If%20It%20Is%20a%20Straight%20Line/
 [1461]: ./src/1401-1500/1461%20-%20Check%20If%20a%20String%20Contains%20All%20Binary%20Codes%20of%20Size%20K/

src/0701-0800/704 - Binary Search/BinarySearch.java

@@ -0,0 +1,17 @@
+public class BinarySearch {
+  public int search(int[] nums, int target) {
+    int low = 0,
+        mid = 0,
+        high = nums.length - 1;
+    while (low <= high) {
+      mid = low + (high - low) / 2;
+      if (nums[mid] == target)
+        return mid;
+      else if (nums[mid] < target)
+        low = mid + 1;
+      else
+        high = mid - 1;
+    }
+    return -1;
+  }
+}

src/0701-0800/704 - Binary Search/README.md

@@ -0,0 +1,62 @@
+# 704. Binary Search [![share]](https://leetcode.com/problems/binary-search)
+
+## Problem Statement:
+
+Given an array of integers `nums` which is sorted in ascending order, and an integer `target`, write a function to search `target` in `nums`. If `target` exists, then return its index. Otherwise, return `-1`.
+
+You must write an algorithm with `O(log n)` runtime complexity.
+
+### Example 1:
+
+```Input: nums = [-1,0,3,5,9,12], target = 9
+Output: 4
+Explanation: 9 exists in nums and its index is 4
+```
+
+### Example 2:
+
+```
+Input: nums = [-1,0,3,5,9,12], target = 2
+Output: -1
+Explanation: 2 does not exist in nums so return -1
+```
+
+### Constraints:
+
+- 1 <= nums.length <= 10<sup>4</sup>
+- -10<sup>4</sup> < nums[i], target < 10<sup>4</sup>
+- All the integers in nums are unique.
+- nums is sorted in ascending order.
+
+## Solution:
+
+### [_Java_](./BinarySearch.java)
+
+```java
+public int search(int[] nums, int target) {
+  int low = 0,
+      mid = 0,
+      high = nums.length - 1;
+  while (low <= high) {
+    mid = low + (high - low) / 2;
+    if (nums[mid] == target)
+      return mid;
+    else if (nums[mid] < target)
+      low = mid + 1;
+    else
+      high = mid - 1;
+  }
+  return -1;
+}
+```
+
+### [_..._]()
+
+```
+
+```
+
+<!----------------------------------{ link }--------------------------------->
+
+[share]: https://img.icons8.com/external-anggara-blue-anggara-putra/20/000000/external-share-user-interface-basic-anggara-blue-anggara-putra-2.png
+[easy]: https://img.shields.io/badge/Difficulty-Easy-yellow.svg

src/README.md

@@ -37,6 +37,7 @@
 | **0369** |                  [Plus One Linked List][369]                  |                Linked List, Math                | ![][medium] |   🔒   |
 | **0543** |                [Diameter of Binary Tree][543]                 |             Tree, DFS, Binary Tree              |  ![][easy]  |        |
 | **0653** |              [Two Sum IV - Input is a BST][653]               |           Tree, DFS, BST, Binary Tree           |  ![][easy]  |        |
+| **0704** |                     [Binary Search][704]                      |              Array, Binary Search               |  ![][easy]  |        |
 | **1047** |       [Remove All Adjacent Duplicates In String][1047]        |                  String, Stack                  |  ![][easy]  |        |
 | **1232** |            [Check If It Is a Straight Line][1232]             |              Array, Math, Geometry              |  ![][easy]  |        |
 | **1461** | [Check If a String Contains All Binary Codes of Size K][1461] |      String, Hash Table, Bit Manipulation       | ![][medium] |        |
@@ -68,10 +69,11 @@
 [278]: ./0201-0300/278%20-%20First%20Bad%20Version/
 [283]: ./0201-0300/283%20-%20Move%20Zeroes/
 [344]: ./0301-0400/344%20-%20Reverse%20String/
-[367]:./0301-0400/367%20-%20Valid%20Perfect%20Square/
+[367]: ./0301-0400/367%20-%20Valid%20Perfect%20Square/
 [369]: ./0301-0400/369%20-%20Plus%20One%20Linked%20List/
 [543]: ./0501-0600/543%20-%20Diameter%20of%20Binary%20Tree/
 [653]: ./0601-0700/653%20-%20Two%20Sum%20IV%20-%20Input%20is%20a%20BST/
+[704]: ./0701-0800/704%20-%20Binary%20Search/
 [1047]: ./1001-1100/1047%20-%20Remove%20All%20Adjacent%20Duplicates%20In%20String/
 [1232]: ./1201-1300/1232%20-%20Check%20If%20It%20Is%20a%20Straight%20Line/
 [1461]: ./1401-1500/1461%20-%20Check%20If%20a%20String%20Contains%20All%20Binary%20Codes%20of%20Size%20K/