sqrt

Author: Dhivffvjofrssxvbitfdesdgj

Searching/README.md

@@ -3,7 +3,7 @@
 ## Easy
 |S.no.|Question|Solution|
 |---|------------|------------|
-|1|[Square Root](https://leetcode.com/problems/sqrtx/)|Pending|
+|1|[Square Root](https://leetcode.com/problems/sqrtx/)|[Solution](sqrt.cpp)|
 |2| [First Bad Version](https://leetcode.com/problems/first-bad-version/)|Pending|
 |3| [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)|Pending|
 |4| [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/)|Pending|

Searching/sqrt.cpp

@@ -0,0 +1,30 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int mySqrt(int x)
+{
+    int low = 0, high = x;
+    long mid;
+    while (low <= high)
+    {
+        mid = low + (high - low) / 2;
+        if (mid * mid <= x)
+            low = mid + 1;
+        else
+            high = mid - 1;
+    }
+    return low - 1;
+}
+
+int main()
+{
+    int t;
+    cin >> t;
+    while (t--)
+    {
+        int n;
+        cin >> n;
+        cout<<mySqrt(n)<<endl;
+    }
+    return 0;
+}