Searching algorithms milestone

Santushti/1d_Array_milestone/Hackerearth_Questions/2arrays.cpp

@@ -0,0 +1,68 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main()
+{ 
+    long long t=0,k=0,n,s1=0,s2=0 ;
+
+    cin>>n;
+
+    long long a[n],b[n];
+
+    for(int i=0;i<n;i++)
+   {
+       cin>>a[i];
+      if(a[i]==-1)
+      t++;
+
+      else
+      s1+=a[i];
+   }
+
+      for(int i=0;i<n;i++)
+    {
+        cin>>b[i];
+
+      if(b[i]==-1)
+      k++;
+
+      else
+      s2+=b[i];
+    }
+
+if(t==k )
+cout<<"Infinite";
+
+else if(t==1 || k==1)
+{
+    if(t==1 && s1>s2)
+    cout<<"0";
+
+     else if(k==1 && s2>s1)
+     cout<<"0";
+
+     else
+     cout<<"1";
+}
+else 
+{
+    if(t==2 && s1>s2)
+    cout<<"0";
+
+    else if(k==2 && s2>s1)
+    cout<<"0";
+
+    else
+    {
+
+    if(s1==s2)       
+    cout<<"1";
+
+    else
+    cout<<abs(s1-s2)+1; 
+    }
+
+}
+
+    return 0;
+}
+

Santushti/1d_Array_milestone/Hackerearth_Questions/Acche_Din.cpp

@@ -0,0 +1,50 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main() {
+
+    long long t;
+
+    cin>>t;
+
+    while(t--) {
+
+        long long n;
+
+        cin>>n;
+
+        long long a[n], k[n];
+
+        for(int i = 0; i < n; ++i) {
+
+            cin>>a[i];
+        }
+
+        multiset<int> s(a,a+n);
+
+        for(int i = 0; i < n; ++i) {
+
+            k[i] = s.count(a[i]);
+
+            if(k[i] == 1) {
+
+                cout<<a[i]<<"\n";
+                break;
+            }
+        }        
+    }
+    return 0;
+}
+/*
+
+SAMPLE INPUT
+------------
+1
+7
+1 2 2 1 2 1 4
+
+SAMPLE OUTPUT
+-------------
+4
+
+*/

Santushti/1d_Array_milestone/Hackerearth_Questions/Charged_Up_Array.cpp

@@ -0,0 +1,39 @@
+#include<iostream>
+#include<cmath>
+using namespace std;
+int main()
+{
+          long long int t,n,m=1000000007;
+
+             cin>>t;
+
+            for(int i=0;i<t;i++)
+{
+            cin>>n;
+
+           long long int a[n];
+
+           for(int j=0;j<n;j++)
+           cin>>a[j];
+
+         long long int charge=0;
+          long long int p=pow(2,n-1);
+
+          if(n>=64)
+          cout<<"0\n";
+
+        else
+        {
+          for(int j=0;j<n;j++)
+    {
+           if(a[j]>=p)
+           charge=(a[j]%m+charge)%m;
+    }
+
+         cout<<charge%m<<"\n";
+        }
+} 
+
+
+return 0;
+}

Santushti/1d_Array_milestone/Hackerearth_Questions/Hamiltonian_and_Lagrangian.cpp

@@ -0,0 +1,38 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+
+        long long n,h[1000000],max;
+
+
+         cin>>n;
+
+            for(long long i=0;i<n;i++)
+             cin>>h[i];
+
+             max=h[n-1];
+
+    long long g[n],c=1;
+
+    for(int i=0;i<n;i++)
+       g[i]=-1;
+
+       g[0]=max;
+
+       for(int i=n-2;i>=0;i--)
+       {
+           if(h[i]>=max)
+           {
+               g[c]=h[i];
+               c++;
+               max=h[i];
+
+           }
+       }
+
+       for(int i=c-1;i>=0;i--)
+         cout<<g[i]<<" ";
+
+     return 0;
+}

Santushti/1d_Array_milestone/Hackerearth_Questions/Long_ATM_Queue.cpp

@@ -0,0 +1,26 @@
+#include<iostream>
+using namespace std;
+int main()
+{    
+    long long n,h[1000000];
+    int x=1;
+
+    cin>>n;
+
+    for(int i=0;i<n;i++)
+    cin>>h[i];
+
+   for(int i=0;i<n-1;i++)
+{
+       if(h[i]>h[i+1])         
+         x++;
+
+
+}
+
+      cout<<x<<endl;
+
+      return 0;
+}
+
+

Santushti/1d_Array_milestone/Hackerearth_Questions/Mark_The_Answer.cpp

@@ -0,0 +1,50 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main() {
+
+    int n, k, a[100000];
+
+    int x = 0;
+
+    int t = 0;
+
+    cin>>n>>k;
+
+    for(int i = 0; i < n; ++i) {
+
+        cin>>a[i];
+    }
+
+    for(int i = 0; i < n; ++i) {
+
+        if(a[i] <= k) {
+
+            t++;
+        }
+        else {
+
+            x++;
+
+            if(x > 1) {
+
+                break;
+            }
+        }
+    }
+    cout<<t;
+
+    return 0;
+}
+/*
+
+SAMPLE INPUT
+------------
+7 6
+4 3 7 6 7 2 2
+
+SAMPLE OUTPUT
+-------------
+3
+
+*/

Santushti/1d_Array_milestone/Hackerearth_Questions/Maximise_the_earning

@@ -0,0 +1,34 @@
+#include<iostream>
+using namespace std;
+int main()
+{long long s,r,n,h[10000001];
+    cin>>s;
+for(int i=0;i<s;i++)
+    {  
+        cin>>n>>r;  
+     int c=1;
+      int t=1;
+    int l=0;
+     int sum=0;
+        for(int j=0;j<n;j++)
+             cin>>h[j];
+     while(l+t<n)
+{
+    if(h[l]<h[l+t])
+    {   
+        c++;
+        l+=t;
+        t=1;
+    }
+
+else
+    t++;
+}
+
+sum=(r*c);
+cout<<sum<<endl;
+
+}
+return 0;
+
+}

Santushti/1d_Array_milestone/Hackerearth_Questions/Maximum_Of_K-size_subarrays.cpp

@@ -0,0 +1,27 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+long long k,n,a[1000000],max;
+
+cin>>n>>k;
+
+for(int i=0;i<n;i++)
+cin>>a[i];
+
+for(int i=0;i<n-k+(1);i++)
+{ 
+     max=a[i];
+
+    for(int j=i;j<k+i;j++)
+    {
+           if(max<a[j])
+           max=a[j];
+    }
+
+    cout<<max<<" ";
+}
+
+return 0;
+
+}

Santushti/1d_Array_milestone/Hackerearth_Questions/Micro_and_Array_Update.cpp

@@ -0,0 +1,35 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+
+   long long t,min,n,k,str[n];
+
+cin>>t;
+if(t>=1&&t<=5)
+{
+    for(long long int i=0;i<t;i++)
+{  
+         cin>>n>>k;
+
+   for(long long int j=0;j<n;j++)
+    cin>>str[j];
+
+      min=str[0];
+
+      for(long long int j=0;j<n;j++)
+      {
+          if(min>=str[j])
+          min=str[j];
+      }
+
+      if(min>=k)
+      cout<<"0"<<endl;
+
+      else
+      cout<<k-min<<endl;
+}
+}
+
+  return 0;
+    }