๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.62K subscribers
5.59K photos
3 videos
95 files
10.2K links
๐ŸšฉMain Group - @SuperExams
๐Ÿ“Job Updates - @FresherEarth

๐Ÿ”ฐAuthentic Coding Solutions(with Outputs)
โš ๏ธDaily Job Updates
โš ๏ธHackathon Updates & Solutions

Buy ads: https://telega.io/c/cs_algo
Download Telegram
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll maxcoins(ll A[], ll siz) {
    ll nums[siz + 2];
    ll n = 1;
    for (ll i = 0; i < siz; i++) {
    if (A[i] > 0) {
    nums[n] = A[i];
    n++;
    }
    }
    nums[0] = nums[n] = 1;
    n++;
    ll dp[n][n] = {};
    for (ll j = 2; j < n; j++) {
    for (ll left = 0; left < n - j; left++) {
    ll right = left + j;
    for (ll i = left + 1; i < right; i++) {
    if (left == 0 && right == n - 1)
    dp[left][right] = max(nums[left] * nums[i] * nums[right] + dp[left][i] + dp[i][right], dp[left][right]);
    else
    dp[left][right] = max(nums[left] * nums[right] + dp[left][i] + dp[i][right], dp[left][right]);
            }
        }
    }

    return dp[0][n - 1];
}

int main() {
    ll T;
    cin >> T;
    for (ll t = 1; t <= T; t++) {
    ll siz;
    cin >> siz;
    ll A[siz];
    for (ll i = 0; i < siz; i++) {
    cin >> A[i];
    }
    ll ans = maxcoins(A, siz);
    cout << "#" << t << ans << endl;
    }

    return 0;
}


Samsung โœ…
int sameSubstring(string s, string t, int K){
    int n = s.size();
    int cost = 0, len = 0, res = 0;

    for(int i = 0; i < n; i++){
        cost += abs(s[i] - t[i]);
        len++;

        while(cost > K){
            cost -= abs(s[i - len + 1] - t[i - len + 1]);
            len--;
        }
        res = max(res, len);
    }
    return res;
}

RoundGlass โœ…
const int MOD = 1e9 + 7;
int solve (int N, const vector<int>& rollMax) {
    vector<vector<vector<int>>> dp(N, vector<vector<int>>(6, vector<int>(61, 0)));

    for (int j = 0; j < 6; ++j) {
        dp[0][j][1] = 1;
    }
    for (int i = 1; i < N; ++i) {
        for (int j = 0; j < 6; ++j) { 
            for (int k = 1; k <= rollMax[j]; ++k) { 
                if (k > 1) {
                    dp[i][j][k] = dp[i - 1][j][k - 1];
                }
                for (int m = 0; m < 6; ++m) {
                    if (m != j) {
                        dp[i][m][1] = (dp[i][m][1] + dp[i - 1][j][k]) % MOD;
                    }
                }
            }
        }
    }
    int total = 0;
    for (int j = 0; j < 6; ++j) {
        for (int k = 1; k <= rollMax[j]; ++k) {
            total = (total + dp[N - 1][j][k]) % MOD;
        }
    }

    return total;
}

RoundGlass โœ…
Hiring Alert for Freshers ๐Ÿš€

Netlink Software Group America Inc is seeking talented Frontend Freshers!

๐Ÿ”ธ๏ธLocation - Bhopal
๐Ÿ”ธ๏ธQualification- Bachelors degree in IT, CS or related field
๐Ÿ”ธ๏ธSkills Required- HTML, CSS, JavaScript and React

Interested ones can share their CV at shikhav@netlink.com