guess no higher lower

Author: geeky01adarsh

README.md

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

Searching/guess_no_higher_lower.cpp

@@ -0,0 +1,38 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+// api call will be different
+int guess(int n)
+{
+    if (n > 6)
+        return -1;
+    else if (n == 6)
+        return 0;
+    else
+        return 1;
+}
+
+int guessNumber(int n)
+{
+    int maxNumber = n, minNumber = 1;
+    while (minNumber<=maxNumber)
+    {
+        int meanNumber = (maxNumber - minNumber) / 2 + minNumber;
+        int res = guess(meanNumber);
+        if (res == 0)
+            return meanNumber;
+        else if (res == 1)
+            minNumber = meanNumber + 1;
+        else
+            maxNumber = meanNumber - 1;
+    }
+    return -1;
+}
+
+int main()
+{
+    int n;
+    cin >> n;
+    cout<<guessNumber(n)<<endl;
+    return 0;
+}

Sorting/README.md

@@ -29,7 +29,7 @@
 |24.| [Make Two Arrays Equal by Reversing Sub-arrays](https://leetcode.com/problems/make-two-arrays-equal-by-reversing-sub-arrays/)|Pending|
 |25.| [Can Make Arithmetic Progression From Sequence](https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/)|Pending|
 |26.| [Sort Array by Increasing Frequency](https://leetcode.com/problems/sort-array-by-increasing-frequency/)|Pending|
-|27.| [Special Array With X Elements Greater Than or Equal X](https://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x/)|Pending|
+|27.| [Special Array With X Elements Greater Than or Equal X](https://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x/)|[Solution](guess_no_higher_lower.cpp)|
 |28.| [Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/) |Pending|