valid perfect square

Author: geeky01adarsh

README.md

@@ -5,4 +5,4 @@
 | S.No. | Topic | Status |
 |---|--------------|-----|
 |01. | [Array](https://github.com/geeky01adarsh/DSA-Interview-Questions/tree/main/Arrays) | 24/28 |
-|02. | [Searching](/Searching)|3/38|
+|02. | [Searching](/Searching)|4/38|

Searching/README.md

@@ -6,7 +6,7 @@
 |1|[Square Root](https://leetcode.com/problems/sqrtx/)|[Solution](sqrt.cpp)|
 |2| [First Bad Version](https://leetcode.com/problems/first-bad-version/)|[Solution](first_bad_version.cpp)|
 |3| [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)|[Solution](two_sum_ii_input_array_is_sorted.cpp)|
-|4| [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/)|Pending|
+|4| [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/)|[Solution](valid_perfect_square.cpp)|
 |5| [Arranging Coins(Easy)](https://leetcode.com/problems/arranging-coins/)|Pending|
 |6| [Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target/)|Pending|
 |7| [Kth Missing Positive Number](https://leetcode.com/problems/kth-missing-positive-number/)|Pending|

Searching/valid_perfect_square.cpp

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