leetcode

Author: ayoubzulfiqar

GuessNumberHigherOrLower/guess_number_higher_or_lower.dart

@@ -0,0 +1,102 @@
+/*
+
+
+-* 374. Guess Number Higher or Lower *-
+
+We are playing the Guess Game. The game is as follows:
+
+I pick a number from 1 to n. You have to guess which number I picked.
+
+Every time you guess wrong, I will tell you whether the number I picked is higher or lower than your guess.
+
+You call a pre-defined API int guess(int num), which returns three possible results:
+
+-1: Your guess is higher than the number I picked (i.e. num > pick).
+1: Your guess is lower than the number I picked (i.e. num < pick).
+0: your guess is equal to the number I picked (i.e. num == pick).
+Return the number that I picked.
+
+
+
+Example 1:
+
+Input: n = 10, pick = 6
+Output: 6
+Example 2:
+
+Input: n = 1, pick = 1
+Output: 1
+Example 3:
+
+Input: n = 2, pick = 1
+Output: 1
+
+
+Constraints:
+
+1 <= n <= 231 - 1
+1 <= pick <= n
+Accepted
+416,581
+Submissions
+815,531
+
+*/
+
+int guess(int number) => number;
+
+class A {
+  int guessNumber(int n) {
+    int low = 1;
+    int high = n;
+    while (low <= high) {
+      int mid = low + (high - low) ~/ 2;
+      int g = guess(mid);
+      if (g == 0) {
+        return mid;
+      } else if (g == -1) {
+        high = mid - 1;
+      } else {
+        low = mid + 1;
+      }
+    }
+    return -1;
+  }
+}
+
+class B {
+  int guessNumber(int n) {
+    int i = 1, mid = n ~/ 2, k, l = 0;
+    if (guess(mid) == 0)
+      return mid;
+    else if (guess(mid) == -1) {
+      k = mid;
+      l = 0;
+    } else
+      k = n;
+    l = mid;
+    for (i = l; i < k; i++) {
+      if (guess(i) == 0) break;
+    }
+    return i;
+  }
+}
+
+class C {
+  int guessNumber(int n) {
+    return binarySearch(0, n);
+  }
+
+  int binarySearch(int start, int end) {
+    if (start > end) return -1;
+    int mid = start + (end - start) ~/ 2;
+    switch (guess(mid)) {
+      case -1:
+        return binarySearch(start, mid - 1);
+      case 1:
+        return binarySearch(mid + 1, end);
+      default:
+        return mid;
+    }
+  }
+}

GuessNumberHigherOrLower/guess_number_higher_or_lower.go

@@ -0,0 +1,46 @@
+package main
+
+//* Forward declaration of guess API.
+//* @param  num   your guess
+//* @return 	     -1 if num is higher than the picked number
+//*			      1 if num is lower than the picked number
+//*               otherwise return 0
+func guess(num int) int
+
+// func guessNumber(n int) int {
+// 	var low int = 1
+// 	var high int = n
+// 	for low <= high {
+// 		var mid int = low + (high-low)/2
+// 		var g int = guess(mid)
+// 		if g == 0 {
+// 			return mid
+// 		} else if g == -1 {
+// 			high = mid - 1
+// 		} else {
+// 			low = mid + 1
+// 		}
+// 	}
+
+// 	return -1
+// }
+
+func guessNumber(n int) int {
+	return binarySearch(0, n)
+}
+
+func binarySearch(start, finish int) int {
+	if start > finish {
+		return -1
+	}
+	dot := (finish-start)/2 + start
+
+	switch guess(dot) {
+	case -1:
+		return binarySearch(start, dot-1)
+	case 1:
+		return binarySearch(dot+1, finish)
+	default:
+		return dot
+	}
+}

GuessNumberHigherOrLower/guess_number_higher_or_lower.md

@@ -0,0 +1,89 @@
+# 🔥 Guess Number Higher or Lower 🔥 || 3 Approaches || Simple Fast and Easy || with Explanation
+
+## Guess API
+
+```dart
+ Forward declaration of guess API.
+ @param  number   your guess
+ @return 	     -1 if number is higher than the picked number
+			      1 if number is lower than the picked number
+               otherwise return 0
+```
+
+```dart
+int guess(int number) => number;
+```
+
+## Solution - 1
+
+```dart
+class Solution {
+  int guessNumber(int n) {
+    int low = 1;
+    int high = n;
+    while (low <= high) {
+      int mid = low + (high - low) ~/ 2;
+      int g = guess(mid);
+      if (g == 0) {
+        return mid;
+      } else if (g == -1) {
+        high = mid - 1;
+      } else {
+        low = mid + 1;
+      }
+    }
+    return -1;
+  }
+}
+```
+
+## Solution - 2
+
+```dart
+class Solution {
+  int guessNumber(int n) {
+    int i = 1, mid = n ~/ 2, k, l = 0;
+    if (guess(mid) == 0)
+      return mid;
+    else if (guess(mid) == -1) {
+      k = mid;
+      l = 0;
+    } else
+      k = n;
+    l = mid;
+    for (i = l; i < k; i++) {
+      if (guess(i) == 0) break;
+    }
+    return i;
+  }
+}
+```
+
+## Solution - 3
+
+```dart
+class Solution {
+  int guessNumber(int n) {
+    return binarySearch(0, n);
+  }
+
+  int binarySearch(int start, int end) {
+    if (start > end) return -1;
+    int mid = start + (end - start) ~/ 2;
+    switch (guess(mid)) {
+      case -1:
+        return binarySearch(start, mid - 1);
+      case 1:
+        return binarySearch(mid + 1, end);
+      default:
+        return mid;
+    }
+  }
+}
+```
+
+### 😈 Disclaimer 😈 :-
+
+This Solution is not available in DART Programing language with is a bummer. Hurts my feeling. But as a man we should implement it no matter what. We are not bunch of wussies who gonna skip it if it's not available in one language we love. Instead we will conquer the sea and rivers and cross the mountains so see what's lies beyond our horizons.
+
+### [GitHub Link](https://github.com/ayoubzulfiqar/leetcode)

README.md

@@ -129,6 +129,7 @@ This repo contain leetcode solution using DART and GO programming language. Most
 - [**222.** Count Complete Tree Nodes](CountCompleteTreeNodes/count_complete_tree_nodes.dart)
 - [**326.** Power of Three](PowerOfThree/power_of_three.dart)
 - [**338.** Counting Bits](CountingBits/counting_bits.dart)
+- [**374.** Guess Number Higher or Lower](GuessNumberHigherOrLower/guess_number_higher_or_lower.dart)
 
 ## Reach me via