ACCENTURE EXAM HELP | ACCENTURE TEST HELP

Goldman Sachs ✅ Channel Subsecuence DONE ✅

If you need help in any OA(coding round) in any company DM @codemaster07

Infosys Slot Done ✅✅ Dm for solution @codemaster07

Count Co- Prime Paths Done ✅

Maximum Subsequence Length DONE ✅

RGB Colouring ✅

#include <bits/stdc++.h> using namespace std; const int m = 1e9 + 7; int main() {     int numElements, divisor;     cin >> numElements >> divisor;     vector<int> elements(numElements);     for (int i = 0; i < numElements; i++)     {         cin >> elements[i];     }     vector<vector<vector<long long>>> dp(divisor, vector<vector<long long>>(divisor, vector<long long>(divisor, 0)));     dp[0][0][0] = 1;     for (int value : elements)     {         vector<vector<vector<long long>>> newDp(divisor, vector<vector<long long>>(divisor, vector<long long>(divisor, 0)));         for (int rSum = 0; rSum < divisor; rSum++)         {             for (int gSum = 0; gSum < divisor; gSum++)             {                 for (int bSum = 0; bSum < divisor; bSum++)                 {                     if (dp[rSum][gSum][bSum] > 0)                     {                         newDp[(rSum + value) % divisor][gSum][bSum] = (newDp[(rSum + value) % divisor][gSum][bSum] + dp[rSum][gSum][bSum]) % m;                         newDp[rSum][(gSum + value) % divisor][bSum] = (newDp[rSum][(gSum + value) % divisor][bSum] + dp[rSum][gSum][bSum]) % m;                         newDp[rSum][gSum][(bSum + value) % divisor] = (newDp[rSum][gSum][(bSum + value) % divisor] + dp[rSum][gSum][bSum]) % m;                     }                 }             }         }         dp = newDp;     }     long long ass = 0;     for (int rSum = 0; rSum < divisor; rSum++)     {         for (int gSum = 0; gSum < divisor; gSum++)         {             int bSum = (divisor - rSum - gSum) % divisor;             if (bSum < 0)                 bSum += divisor;             ass = (ass + dp[rSum][gSum][bSum]) % m;         }     }     cout << ass << endl;     return 0; }

Distributing Book's ✅

#include <iostream> #include <vector> #include <numeric> #define MOD 1000000007 using namespace std; long long mod_inv(long long x, long long mod) { long long result = 1; long long power = mod - 2; while (power) { if (power % 2) { result = result * x % mod; } x = x * x % mod; power /= 2; } return result; } vector<long long> factorial(int n, long long mod) { vector<long long> fact(n + 1, 1); for (int i = 2; i <= n; ++i) { fact[i] = fact[i - 1] * i % mod; } return fact; } long long binomial_coeff(int n, int k, const vector<long long>& fact, long long mod) { if (k > n || k < 0) { return 0; } return fact[n] * mod_inv(fact[k], mod) % mod * mod_inv(fact[n - k], mod) % mod; } long long count_ways(int N, int K, const vector<int>& A) { int sum_A = accumulate(A.begin(), A.end(), 0); int M = K - sum_A; vector<long long> fact = factorial(M + N - 1, MOD); return binomial_coeff(M + N - 1, N - 1, fact, MOD); } int main() { int N, K; cin >> N >> K; vector<int> A(N); for (int i = 0; i < N; ++i) { cin >> A[i]; } cout << count_ways(N, K, A) << endl; return 0; }

Maximum Triplate Sun ✅

#include <bits/stdc++.h> using namespace std; int maxTripletSum(int arr[], int n) { int maxA = INT_MIN, maxB = INT_MIN, maxC = INT_MIN; for (int i = 0; i < n; i++) { if (arr[i] > maxA) { maxC = maxB; maxB = maxA; maxA = arr[i]; } else if (arr[i] > maxB) { maxC = maxB; maxB = arr[i]; } else if (arr[i] > maxC) { maxC = arr[i]; } } return (maxA + maxB + maxC); } int main() { int arr[] = {10, 20, 4, 1, 100, 70}; int n = sizeof(arr) / sizeof(arr[0]); cout << "Maximum triplet sum is " << maxTripletSum(arr, n) << endl; return 0; }

Count Subtree Factors DONE ✅ Dm for solution @codemaster07

Ready For Infosys SP ✔️

Infosys ✅ MasterCard ✅ Limited Slots Available ◀️◀️ Dm @codemaster07

Oracle Slot Done Successfully 💯 35 MCQ + Coding question ✅ Dm for solution @codemaster07

Oracle ✅ Rearranges Students DONE ✅

Infosys ✅ Oracle ✅ Slot Available ◀️ @codemaster07

Schlumberger Slot Done Successfully ✅

Q2 DONE ✅