added more codes

Author: abhijhacodes

apartments.cpp

@@ -0,0 +1,37 @@
+#include "bits/stdc++.h"
+using namespace std;
+#define ll long long
+#define mod 1000000007
+
+void solve()
+{
+   ll n,m,k;
+   cin >> n >> m >> k;
+   vector<ll> a(n), b(m);
+   for(ll i=0; i<n; i++) cin >> a[i];
+   for(ll i=0; i<m; i++) cin >> b[i];
+   sort(a.begin(), a.end());
+   sort(b.begin(), b.end());
+ 
+   ll cnt = 0, i = 0, j = 0;
+   
+   while(i<n and j<m){
+          if(abs(a[i]-b[j]) <= k){
+               cnt++;
+               i++; j++;
+          }
+          else{
+               if(a[i]-b[j] > k) j++;
+               else i++;
+          }
+   }
+   cout << cnt << "\n";
+}
+
+int main()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    cout.tie(NULL);
+    solve();
+}

distinctNumbers.cpp

@@ -0,0 +1,24 @@
+#include "bits/stdc++.h"
+using namespace std;
+#define ll long long
+#define mod 1000000007
+
+void solve()
+{
+    ll n; cin >> n;
+    set<ll> s;
+    for (ll i = 0; i < n; ++i)
+    {
+        ll x; cin >> x;
+        s.insert(x);
+    }
+    cout << s.size() << "\n";
+}
+
+int main()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    cout.tie(NULL);
+    solve();
+}

editDistance.cpp

@@ -0,0 +1,42 @@
+#include "bits/stdc++.h"
+using namespace std;
+#define ll long long
+#define mod 1000000007
+
+ll editDistance(string s1, string s2, ll m, ll n)
+{
+    ll dp[m+1][n+1];
+    
+    for(ll i=0;i<=m;i++)
+        dp[i][0]=i;
+ 
+    for(ll j=0;j<=n;j++)
+        dp[0][j]=j;
+ 
+    for(ll i=1;i<=m;i++)
+    {
+        for(ll j=1;j<=n;j++)
+        {
+            if(s1[i-1] == s2[j-1])
+                dp[i][j] = dp[i-1][j-1];
+            else
+                dp[i][j] = 1 + min(dp[i-1][j], min(dp[i][j-1], dp[i-1][j-1]));
+        }
+    }
+    return dp[m][n];
+}
+
+void solve()
+{
+    string s1; cin>>s1;
+    string s2; cin>>s2;
+    cout<<editDistance(s1,s2,s1.length(),s2.length())<<endl;
+}
+
+int main()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    cout.tie(NULL);
+    solve();
+}

exponentiation.cpp

@@ -0,0 +1,35 @@
+#include "bits/stdc++.h"
+using namespace std;
+#define ll long long
+#define mod 1000000007
+
+ll power(ll a, ll b)
+{
+    if(b == 0) return 1;
+ 
+    a = a % mod;
+    ll temp = power(a, b/2);
+    if(b&1)
+        return (((temp * temp) % mod) * a) % mod;
+    else
+        return (temp * temp) % mod;
+}
+
+void solve()
+{
+    ll n; cin>>n;
+    while(n--)
+    {
+        ll a,b;
+        cin >> a >> b;
+        cout << power(a,b) << "\n";
+    }
+}
+
+int main()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    cout.tie(NULL);
+    solve();
+}

maximumSubarraySum.cpp

@@ -0,0 +1,26 @@
+#include "bits/stdc++.h"
+using namespace std;
+#define ll long long
+#define mod 1000000007
+
+void solve()
+{
+    ll n; cin>>n;
+    vector<ll> v(n);
+    for(ll i=0; i<n; ++i) cin>>v[i];
+
+    ll curSum = v[0], ans = v[0];
+    for(ll i=1; i<n; ++i){
+        curSum = max(curSum+v[i], v[i]);
+        ans = max(ans, curSum);
+    }
+    cout<<ans<<endl;
+}
+
+int main()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    cout.tie(NULL);
+    solve();
+}

staticRangeSum.cpp

@@ -0,0 +1,32 @@
+#include "bits/stdc++.h"
+using namespace std;
+#define ll long long
+#define mod 1000000007
+
+void solve()
+{
+   ll n,q;
+   cin >> n >> q;
+   vector<ll> x(n+1);
+   for(ll i=1; i<=n; i++) cin >> x[i];
+
+   vector<ll> prefix(n+1);
+   prefix[1] = x[1];
+   for(ll i=2; i<=n; i++){
+        prefix[i] = prefix[i-1] + x[i];
+   }
+   
+   while(q--){
+        ll a,b;
+        cin >> a >> b;
+        cout << (prefix[b]-prefix[a-1]) <<"\n";
+   }
+}
+
+int main()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    cout.tie(NULL);
+    solve();
+}