Merge pull request #505 from himanshu30-max/leetcode

leetcode problems

Author: Sirajmolla

LeetCode/Max_consequtive_one.cpp

@@ -0,0 +1,36 @@
+#include <iostream>
+#include<bits/stdc++.h>
+using namespace std;
+
+
+int findMaxConsecutiveOnes(int nums[],int n) {
+        // sort(nusm.begin(),nums.end());
+        int count =0,maxi=0;
+        for(int i=0;i<n;i++){
+            if(nums[i]==1){
+                count++;
+            }
+            else{
+                count=0;
+            }
+            maxi=max(count,maxi);
+        }
+        return maxi;
+    }
+
+//driver code
+int main(){
+    int n;
+    cout<<"Enter the size of array";
+    cin>>n;
+    int arr[n];
+    //taking input in the array
+    for(int i=0;i<n;i++){
+        cin>>arr[i];
+    }
+   int ans= findMaxConsecutiveOnes(arr,n);
+   cout<<ans<<endl;
+
+    return 0;
+
+}

LeetCode/Max_consequtive_one.exe

@@ -0,0 +1,35 @@
+//This program will return the peak element index in a mountain array
+#include <iostream>
+using namespace std;
+
+// function code
+int peakIndexInMountainArray(int arr[],int size){
+    int start=0;
+    int end=size-1;
+    int mid=start+(end-start)/2;
+    while(start<end){
+        if(arr[mid]<arr[mid+1])
+            start=mid+1;
+        else
+            end=mid;
+        mid=start+(end-start)/2;
+        }
+    return start;
+}
+
+//driver code
+int main(){
+    int n;
+    cout<<"Enter the size of array";
+    cin>>n;
+    int arr[n];
+    //taking input in the array
+    for(int i=0;i<n;i++){
+        cin>>arr[i];
+    }
+   int ans= peakIndexInMountainArray(arr,n);
+   cout<<ans<<endl;
+
+    return 0;
+
+}