{"push_id":790904249,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"2b4818aa9b2e22706e636460e36cc1665866e018","before":"8801952a59cb1effb1b16a55670f448fb08a2758","commits":[{"sha":"2b4818aa9b2e22706e636460e36cc1665866e018","author":{"email":"07465c984ba434d0265ade889a73a4b534915722@gmail.com","name":"Robert"},"message":"Q278 First Bad Version\n\nYou are a product manager and currently leading a team to develop a new\nproduct. Unfortunately, the latest version of your product fails the\nquality check. Since each version is developed based on the previous\nversion, all the versions after a bad version are also bad.\n\nSuppose you have n versions [1, 2, ..., n] and you want to find out the\nfirst bad one, which causes all the following ones to be bad.\n\nYou are given an API bool isBadVersion(version) which will return\nwhether version is bad. Implement a function to find the first bad\nversion. You should minimize the number of calls to the API.","distinct":true,"url":"https://api.github.com/repos/robertzm/algotest/commits/2b4818aa9b2e22706e636460e36cc1665866e018"}]}