Create README - LeetHub

Author: devxoshakya

0704-binary-search/README.md

@@ -1,18 +1,20 @@
-<h2><a href="https://leetcode.com/problems/binary-search/">704. Binary Search</a></h2><h3>Easy</h3><hr><div><p>Given an array of integers <code>nums</code> which is sorted in ascending order, and an integer <code>target</code>, write a function to search <code>target</code> in <code>nums</code>. If <code>target</code> exists, then return its index. Otherwise, return <code>-1</code>.</p>
+<h2><a href="https://leetcode.com/problems/binary-search">792. Binary Search</a></h2><h3>Easy</h3><hr><p>Given an array of integers <code>nums</code> which is sorted in ascending order, and an integer <code>target</code>, write a function to search <code>target</code> in <code>nums</code>. If <code>target</code> exists, then return its index. Otherwise, return <code>-1</code>.</p>
 
 <p>You must write an algorithm with <code>O(log n)</code> runtime complexity.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
 
-<pre><strong>Input:</strong> nums = [-1,0,3,5,9,12], target = 9
+<pre>
+<strong>Input:</strong> nums = [-1,0,3,5,9,12], target = 9
 <strong>Output:</strong> 4
 <strong>Explanation:</strong> 9 exists in nums and its index is 4
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>
 
-<pre><strong>Input:</strong> nums = [-1,0,3,5,9,12], target = 2
+<pre>
+<strong>Input:</strong> nums = [-1,0,3,5,9,12], target = 2
 <strong>Output:</strong> -1
 <strong>Explanation:</strong> 2 does not exist in nums so return -1
 </pre>
@@ -26,4 +28,3 @@
 	<li>All the integers in <code>nums</code> are <strong>unique</strong>.</li>
 	<li><code>nums</code> is sorted in ascending order.</li>
 </ul>
-</div>