#278.First Bad Version [LeetCode Grind 75 in Java]
[Problem Link] https://leetcode.com/problems/first-bad-version/
public class Solution extends VersionControl {
//Binary Search implementation
public int firstBadVersion(int n) {
int ans = 0;
int l = 1;
int r = n;
while(l <= r){
int mid = l + (r - l) / 2;
if(isBadVersion(mid)){
ans = mid;
r = mid - 1;
}
else l = mid + 1;
}
return ans;
}
}