(1) Binary Search: First Bad Version

Question Link and Solution Link Difficulty: Easy Problem Statement: Given n we need to find a first bad version from 1 to n. Here we are given bool isBadVersion(version) this returns true if the version is bad and false if the version is good. Obs...