@@ -9,7 +9,7 @@ LeetCode
 | # | Title | Solution | Difficulty |
 |---| ----- | -------- | ---------- |
 |285|[Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst/) &hearts; | [Java](./algorithms/java/src/inorderSuccessorInBST/inorderSuccessorInBST.java)|Medium|
-|278|[First Bad Version](https://leetcode.com/problems/first-bad-version/)| [Java](./algorithms/java/src/firstBadVersion/firstBadVersion.java)|Easy|
+|278|[First Bad Version](https://leetcode.com/problems/first-bad-version/)| [C++](./algorithms/cpp/firstBadVersion/FirstBadVersion.cpp), [Java](./algorithms/java/src/firstBadVersion/firstBadVersion.java)|Easy|
 |258|[Add Digits](https://leetcode.com/problems/add-digits/)| [C++](./algorithms/cpp/addDigits/addDigits.cpp)|Easy|
 |226|[Valid Anagram](https://leetcode.com/problems/valid-anagram/)| [C++](./algorithms/cpp/anagrams/ValidAnagram.cpp)|Easy|
 |225|[Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses/)|[C++](./algorithms/cpp/differentWaysToAddParentheses/DifferentWaysToAddParentheses.cpp)|Medium|
 
@@ -0,0 +1,45 @@
+// Source : https://leetcode.com/problems/first-bad-version/
+// Author : Hao Chen
+// Date   : 2015-10-19
+
+/*************************************************************************************** 
+ *
+ * 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 will return whether version is 
+ * bad. Implement a function to find the first bad version. You should minimize the 
+ * number of calls to the API.
+ * 
+ * Credits:Special thanks to @jianchao.li.fighter for adding this problem and creating 
+ * all test cases.
+ *               
+ ***************************************************************************************/
+
+// Forward declaration of isBadVersion API.
+bool isBadVersion(int version);
+
+class Solution {
+public:
+    //Binary search
+    int firstBadVersion(int n) {
+        int low=1, high=n;
+        while(low <= high) {
+            int mid = low + (high - low)/2;
+            if (isBadVersion(mid) && !isBadVersion(mid-1)){
+                return mid;
+            }
+            if (isBadVersion(mid)) {
+                high = mid - 1;
+            }else{
+                low = mid + 1;
+            }
+        }
+        return -1;
+    }
+};