Merge pull request larissalages#131 from d2Anubis/master

added interview bit

Author: larissalages

InterviewBit/All_Factors.cpp

@@ -0,0 +1,16 @@
+vector<int> Solution::allFactors(int A) {
+    vector<int>v;
+    for(int i=1;i<=sqrt(A);i++)
+    {
+        if(A%i==0)
+        {
+            v.push_back(i);
+            if(i!=sqrt(A))
+            {
+                v.push_back(A/i);
+            }
+        }
+    }
+    sort(v.begin(),v.end());
+    return v;
+}

InterviewBit/Binary_Representation.cpp

@@ -0,0 +1,15 @@
+string Solution::findDigitsInBinary(int A) {
+    if(A==0)
+    {
+        return "0";
+    }
+    string num;
+    while(A>0)
+    {
+        string i=to_string(A%2);
+        num+=i;
+        A=A/2;
+    }
+    reverse(num.begin(),num.end());
+    return num;
+}

InterviewBit/Find_Duplicate_in_Array.cpp

@@ -0,0 +1,17 @@
+int Solution::repeatedNumber(const vector<int> &A) {
+    int res=0;
+    int n=A.size();
+    for(int i=0;i<n;i++)
+    {
+        res=res^A[i];
+    }
+    for(int i=1;i<=n-1;i++)
+    {
+        res=res^i;
+    }
+    if(res>0)
+    {
+        return res;
+    }
+    return -1;
+}

InterviewBit/First_Missing_Integer.cpp

@@ -0,0 +1,22 @@
+int Solution::firstMissingPositive(vector<int> &A) {
+    sort(A.begin(),A.end());
+    int m=0;
+    while(A[m]<1)
+    {
+        m+=1;
+    }
+    if(A[m]!=1)
+    {
+        return 1;
+    }
+    int num=A[m];
+    for(int i=m+1;i<A.size();i++)
+    {
+        if(A[i]!=(num+1))
+        {
+            return num+1;
+        }
+        num+=1;
+    }
+    return num+1;
+}

InterviewBit/FizzBuzz.cpp

@@ -0,0 +1,31 @@
+vector<string> Solution::fizzBuzz(int A) {
+    vector<string>v;
+    for(int i=1;i<=A;i++)
+    {
+        if(i%15==0)
+        {
+            v.push_back("FizzBuzz");
+        }
+        else
+        {
+            if(i%5==0)
+            {
+                v.push_back("Buzz");
+            }
+            else
+            {
+                if(i%3==0)
+                {
+                    v.push_back("Fizz");
+                }
+                else
+                {
+                    
+                    v.push_back(to_string(i));
+                }
+                
+            }
+        }
+    }
+    return v;
+}

InterviewBit/Greatest_Common_Divisor.cpp

@@ -0,0 +1,10 @@
+int Solution::gcd(int A, int B) {
+    if(B==0)
+    {
+        return A;
+    }
+    else
+    {
+        return gcd(B,A%B);
+    }
+}

InterviewBit/Large_Factorial.cpp

@@ -0,0 +1,25 @@
+string Solution::solve(int A) {
+    string res;
+    int arr[10000];
+    arr[0]=1;
+    int carry=0;
+    int num;
+    int arr_size=1;
+    for(int i=2;i<=A;i++)
+    {
+        for(int j=0;j<arr_size;j++)
+        {
+            num=arr[j]*i+carry;
+            arr[j]=num%10;
+            carry=num/10;
+        }
+        while(carry>0)
+        {
+            arr[arr_size++]=carry%10;
+            carry=carry/10;
+        }
+    }
+    for(int i = arr_size-1; i >= 0 ; i--)
+        res+=to_string(arr[i]);
+    return res;
+}

InterviewBit/Matrix_Median.cpp

@@ -0,0 +1,13 @@
+int Solution::findMedian(vector<vector<int> > &A) {
+    for(int i=A.size()-1;i>0;i--){
+    for(int j=0;j<A[i].size();j++) A[0].push_back(A[i][j]);
+    A[i].clear();
+}
+sort(A[0].begin(),A[0].end());
+int n=A[0].size();
+if(n%2==0)
+{
+    return (A[0][n/2]+A[0][(n/2)-1]);
+}
+return A[0][(n/2)];
+}

InterviewBit/Max_Min.cpp

@@ -0,0 +1,6 @@
+int Solution::solve(vector<int> &A) {
+    sort(A.begin(),A.end());
+    int s=A.size();
+    int sum=A[0]+A[s-1];
+    return sum;
+}

InterviewBit/Max_Sum_Contiguous_Subarray.cpp

@@ -0,0 +1,15 @@
+int Solution::maxSubArray(const vector<int> &A) {
+    
+    int max_so_far = INT_MIN, max_ending_here = 0; 
+  
+    for (int i = 0; i < A.size(); i++) 
+    { 
+        max_ending_here = max_ending_here + A[i]; 
+        if (max_so_far < max_ending_here) 
+            max_so_far = max_ending_here; 
+  
+        if (max_ending_here < 0) 
+            max_ending_here = 0; 
+    } 
+    return max_so_far; 
+}