int solve(int N, int A, int B, int C) {
    vector<int> dp(N + 1, INT_MIN);
    dp[0] = 0;
    for (int i = 1; i <= N; ++i) {
        if (i >= A) dp[i] = max(dp[i], dp[i - A] + 1);
        if (i >= B ) dp[i] = max(dp[i], dp[i - B] + 1);
        if (i >= C) dp[i] = max(dp[i], dp[i - C] + 1);
    }
    return dp[N];
}

Memory Distribution ✅

Quest Global is inviting applications from Engineering Graduates of Batch 2023, 2022 in Industrial Domains. Last Date to Apply: 10th January 2024

Click on the below link to register: https://forms.office.com/r/zytvedkhYw

Tata Capital is hiring for Quality Executive.

Experience :- 0 to 2 year's
Location :- Karnataka

Apply Now  - https://cutt.ly/zwHcWs3G

#include<bits/stdc++.h>
using namespace std;

#define MOD 1000000007
#define MAX 250

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    string s;
    cin >> s;

    vector<long long> dp(s.size()+1, 0);
    dp[0] = 1;

    for(int i=1; i<=s.size(); i++) {
        if(s[i-1] != '0') {
            dp[i] = dp[i-1];
        }
        if(i > 1 && s[i-2] != '0' && stoi(s.substr(i-2, 2)) <= 26) {
            dp[i] = (dp[i] + dp[i-2]) % MOD;
        }
    }

    cout << dp[s.size()] << "\n";

    return 0;
}

Alphanumeric combinations✅

#include <bits/stdc++.h>
using namespace std;

bool f(int n) {
    string s = to_string(n);
    return s.find('1') != string::npos && s.find('2') != string::npos && s.find('3') != string::npos;
}

vector<int> solve(vector<int>& nums) {
    vector<int> res;
    for (int n : nums) {
        if (f(n)) {
            res.push_back(n);
        }
    }
    if (res.empty()) {
        return {-1};
    }
    sort(res.begin(), res.end());
    return res;
}

int main() {
    vector<int> nums = {1456, 345671, 43218, 123};
    vector<int> res = solve(nums);
    for (int i = 0; i < res.size(); ++i) {
        if (i > 0) {
            cout << ",";
        }
        cout << res[i];
    }
    cout << endl;
    return 0;
}

Number Checker ✅

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

const int INF = 99;
const int MAXN = 20;
int dist[MAXN][MAXN];
int next_node[MAXN][MAXN];
int path_count[MAXN][MAXN][MAXN];

void solve(int n) {
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (i != j && dist[i][j] != INF) {
                for (int k = 0; k < n; k++) {
                    if (dist[i][k] + dist[k][j] == dist[i][j]) {
                        path_count[i][j][k]++;
                    }
                }
            }
        }
    }

    vector<int> v;
    for (int k = 0; k < n; k++) {
        int count = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (i != j && i != k && j != k) {
                    count += path_count[i][j][k];
                }
            }
        }
        if (count > 0) {
            v.push_back(k);
        }
    }

    sort(v.begin(), v.end());
    for (int node : v) {
        cout << node << endl;
    }
}

int main() {
    int n;
    cin >> n >> n;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cin >> dist[i][j];
            if (dist[i][j] == INF) {
                next_node[i][j] = -1;
            } else {
                next_node[i][j] = j;
            }
        }
    }

    for (int k = 0; k < n; k++) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (dist[i][k] + dist[k][j] < dist[i][j]) {
                    dist[i][j] = dist[i][k] + dist[k][j];
                    next_node[i][j] = next_node[i][k];
                }
            }
        }
    }

    solve(n);

    return 0;
}

int solve(int n, vector<int>& arr) {
    while (arr.size() > 1) {
        int len = INT_MAX;
        int idx = -1;
        for (int i = 0; i < arr.size() - 1; ++i) {
            int d = arr[i + 1];
            if (d == 0 || arr[i] == 0) {
                continue;
            }
            int r = min(arr[i] % d, d % arr[i]);
            if (r < len) {
                len = r;
                idx = i;
            }
        }
        if (idx == -1) {
            break;
        }
        int d = arr[idx + 1];
        if (d != 0) {
            arr[idx] = min(arr[idx] % d, d % arr[idx]);
        }
        arr.erase(arr.begin() + idx + 1);
    }
    return arr.size();
}

Women Day Mathematics Challenge ✅

#include<bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> a(n);
    for(int i=0; i<n; i++) {
        cin >> a[i];
    }
    sort(a.begin(), a.end());
    int ans = 0, count = 1;
    for(int i=1; i<n; i++) {
        if(a[i] > a[i-1]) {
            ans += count;
            count = 1;
        } else {
            count++;
        }
    }
    cout << ans << endl;
    return 0;
}

int findIdleServer(string s, int k) {
    int i = 0, n = s.length();
    for (int j = 0; j < n; ++j, ++i) {
        s[i] = s[j];
        if (i > 0 && s[i - 1] == s[i])
            i -= 2;
    }
    return s.substr(0, i);

UPDATE:
Read the Job Description and Apply only if eligible.

Since it's a remote startup, It's okay if you have less work experience but amazing portfolio.
https://forms.gle/7WyVfmNptZoY8Vhv9

int digitSum(int n) {
    int s = 0;

    while (n > 0) {
        s += n % 10;
        n = n / 10;
    }

    return s;
}

Company Name: Mercedes-Benz

Role: Intern

Batch eligible: 2024 and 2025 passouts

Apply: https://jobs.mercedes-benz.com/en/intern-2023-51169-MER0002CBX

Company Name: Shadowfax

Role: Data Analytics Intern

Batch eligible: 2022, 2023 and 2024 passouts

Apply: https://docs.google.com/forms/d/e/1FAIpQLSem-oto0r0I4mATq2s1mpjsvSaqOD0IS5VZrM2nVVFe8V4COA/viewform

Company Name: Guidewire

Role: Software Engineer

Batch eligible: 2024 and 2025 passouts

Apply: https://jobs.lever.co/guidewire/e3d3df57-f9fb-4e5d-8aea-3692f5a72028