leetcode

Author: ayoubzulfiqar

FirstBadVersion/first_bad_version.dart

@@ -0,0 +1,52 @@
+/*
+
+-* First Bad Version *-
+
+You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on the previous version, all the versions after a bad version are also bad.
+
+Suppose you have n versions [1, 2, ..., n] and you want to find out the first bad one, which causes all the following ones to be bad.
+
+You are given an API bool isBadVersion(version) which returns whether version is bad. Implement a function to find the first bad version. You should minimize the number of calls to the API.
+
+
+
+Example 1:
+
+Input: n = 5, bad = 4
+Output: 4
+Explanation:
+call isBadVersion(3) -> false
+call isBadVersion(5) -> true
+call isBadVersion(4) -> true
+Then 4 is the first bad version.
+Example 2:
+
+Input: n = 1, bad = 1
+Output: 1
+
+
+Constraints:
+
+1 <= bad <= n <= 231 - 1
+
+*/
+
+bool isBadVersion(int version) {
+  return false;
+}
+
+class Solution {
+  int firstBadVersion(int n) {
+    int start = 1;
+    int end = n;
+    while (start <= end) {
+      int mid = end + (end - start) ~/ 2;
+      if (isBadVersion(mid)) {
+        end = mid + 1;
+      } else {
+        start = mid - 1;
+      }
+    }
+    return start;
+  }
+}

FirstBadVersion/first_bad_version.go

@@ -0,0 +1,20 @@
+package main
+
+func isBadVersion(version int) bool
+
+func firstBadVersion(n int) int {
+	var start int = 1
+	var end int = n
+	for start <= end {
+		var mid int = start + (end-start)/2
+
+		if isBadVersion(mid) {
+			end = mid - 1
+		} else {
+			start = mid + 1
+		}
+
+	}
+	return start
+
+}

FirstBadVersion/first_bad_version.md

@@ -0,0 +1,46 @@
+# 🔥 First Bad Version 🔥 || Simple Fast and Easy || with Explanation
+
+## Solution - 1 Binary Search
+
+```dart
+class Solution {
+  int firstBadVersion(int n) {
+    int start = 1;
+    int end = n;
+    while (start <= end) {
+      int mid = end + (end - start) ~/ 2;
+      if (isBadVersion(mid)) {
+        end = mid + 1;
+      } else {
+        start = mid - 1;
+      }
+    }
+    return start;
+  }
+}
+```
+
+### 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.
+
+## Solution - 2
+
+```go
+func firstBadVersion(n int) int {
+	var start int = 1
+	var end int = n
+	for start <= end {
+		var mid int = start + (end-start)/2
+
+		if isBadVersion(mid) {
+			end = mid - 1
+		} else {
+			start = mid + 1
+		}
+
+	}
+	return start
+
+}
+```

README.md

@@ -115,6 +115,7 @@ This repo contain leetcode solution using DART and GO programming language. Most
 - [Shortest Path in a Grid with Obstacles Elimination](ShortestPathInAGridWithObstaclesElimination/shortest_path_in_a_grid_with_obstacles_elimination.dart)
 - [Toeplitz Matrix](ToeplitzMatrix/toeplitz_matrix.dart)
 - [Missing Number](MissingNumber/missing_number.dart)
+- [First Bad Version](FirstBadVersion/first_bad_version.dart)
 
 ## Reach me via