Day 12 streak

Author: prajwal714

Interview Bit/Binary Search/Search for range.cpp

@@ -0,0 +1,52 @@
+vector<int> Solution::searchRange(const vector<int> &A, int B) {
+    
+    int firstOcc=-1;
+    int lastOcc=-1;
+    
+    int start=0;
+    int end=A.size()-1;
+    
+    while(start<=end)
+    {
+        int mid=start+(end-start)/2;
+        
+        if(A[mid]==B)
+        {
+            firstOcc=mid;
+            end=mid-1;
+        }
+        else if(B<A[mid])
+        {
+            end=mid-1;
+        }
+        else
+        start=mid+1;
+    }
+    
+    start=0; end=A.size()-1;
+    
+    while(start<=end)
+    {
+        int mid=start+(end-start)/2;
+        
+        if(A[mid]==B)
+        {
+            lastOcc=mid;
+            start=mid+1;
+        }
+        else if(B<A[mid])
+        {
+            end=mid-1;
+        }
+        else
+        start=mid+1;
+    }
+    
+    vector<int> sol;
+    sol.push_back(firstOcc);
+    sol.push_back(lastOcc);
+    
+    return sol;
+    
+}
+

Interview Bit/Strings/Longest common prefix.cp

@@ -0,0 +1,25 @@
+string Solution::longestCommonPrefix(vector<string> &A) {
+    
+  string current=A[0];
+  int min=INT_MAX;
+  
+  int i,j;
+  
+      for(j=1;j<A.size();j++)
+     {
+         int k=0;
+         while(current[k]==A[j][k] && k<current.length()&&k<A[j].length())
+         {
+             k++;
+         }
+         
+         if(k<min)
+         min=k;
+         
+     }
+     
+     string res=current.substr(0,min);
+     return res;
+ 
+}
+