Share our channel to ur frds . @Coding_000
show some love...and support ❤️😍

who are having IBM at 5pm

Login at 5:07pm✅

https://t.me/exams_discussion
👇👇
IBM share ur questions here...

Amazon sde,IBM, wiley edge, Amcat or Any placements examm help available...

Contact @ILOVEU_143 ✅

Test Clearance Guaranteed ✅

PLAGRISM FREE CODES

Don't miss this opportunity🥹

Team #Love143 @Coding_000

Amazon Sde Help available

contact @ILOVEU_143 ✅

Help available at low rates👍

Final call for 4:30pm slots 😍🤩

Contact @ILOVEU_143✅

How many of u writing INFOSYS today 10am & 3 pm 

Give heart..reactions fast ❤️

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

int main() {
    string S;
    cin >> S;
    int n = S.length();
    int dp[n + 1];
    memset(dp, 0x3f, sizeof dp);
    dp[0] = 0;

    for (int i = 0; i < n; i++) {
        int digit = S[i] - '0';
        for (int j = max(0, i - 2); j < i; j++) {
            int sum = 0;
            for (int k = j; k <= i; k++) {
                sum += S[k] - '0';
            }
            if (sum % 3 == 0) {
                int cost = digit;
                for (int k = j; k <= i; k++) {
                    cost = min(cost, S[k] - '0');
//@Coding_000
                }
                dp[i + 1] = min(dp[i + 1], dp[j] + cost);
            }
        }
    }
    cout << dp[n] << endl;
    return 0;
}


C++


INFOSYS EXAM ANS 10AM

Share @Coding_000✅