ATS resume help

#include<bits/stdc++.h> int max(int a, int b); /* Returns length of LCS for X[0..m-1], Y[0..n-1] */ int lcs( char *X, char *Y, int m, int n ) { if (m == 0 || n == 0) return 0; if (X[m-1] == Y[n-1]) return 1 + lcs(X, Y, m-1, n-1); else return max(lcs(X, Y, m, n-1), lcs(X, Y, m-1, n)); } /* Utility function to get max of 2 integers */ int max(int a, int b) { return (a > b)? a : b; } /* Driver program to test above function */ int main() { char X[] = "AGGTAB"; char Y[] = "GXTXAYB"; int m = strlen(X); int n = strlen(Y); printf("Length of LCS is %d", lcs( X, Y, m, n ) ); return 0; } C++ Longest Special Subsequences Telegram -✅ @examsAssistance

C++ Build road code Telegram - @examsAssistance

Share our channel Join ✅ @examsAssistance

#include <bits/stdc++.h> using namespace std; // Utility method to check whether a character // is operator or not bool isOperator(char op) { return (op == '+' || op == '*'); } // method prints minimum and maximum value // obtainable from an expression void printMinAndMaxValueOfExp(string exp) { vector<int> num; vector<char> opr; string tmp = ""; // store operator and numbers in different vectors for (int i = 0; i < exp.length(); i++) {   if (isOperator(exp[i]))   {    opr.push_back(exp[i]);    num.push_back(atoi(tmp.c_str()));    tmp = "";   }   else   {    tmp += exp[i];   } } // storing last number in vector num.push_back(atoi(tmp.c_str())); int len = num.size(); int minVal[len][len]; int maxVal[len][len]; // initializing minval and maxval 2D array for (int i = 0; i < len; i++) {   for (int j = 0; j < len; j++)   {    minVal[i][j] = INT_MAX;    maxVal[i][j] = 0;    // initializing main diagonal by num values    if (i == j)     minVal[i][j] = maxVal[i][j] = num[i];   } } // looping similar to matrix chain multiplication // and updating both 2D arrays for (int L = 2; L <= len; L++) {   for (int i = 0; i < len - L + 1; i++)   {    int j = i + L - 1;    for (int k = i; k < j; k++)    {     int minTmp = 0, maxTmp = 0;     // if current operator is '+', updating tmp     // variable by addition     if(opr[k] == '+')     {      minTmp = minVal[i][k] + minVal[k + 1][j];      maxTmp = maxVal[i][k] + maxVal[k + 1][j];     }     // if current operator is '*', updating tmp     // variable by multiplication     else if(opr[k] == '*')     {      minTmp = minVal[i][k] * minVal[k + 1][j];      maxTmp = maxVal[i][k] * maxVal[k + 1][j];     }     // updating array values by tmp variables     if (minTmp < minVal[i][j])      minVal[i][j] = minTmp;     if (maxTmp > maxVal[i][j])      maxVal[i][j] = maxTmp;    }   } } // last element of first row will store the result cout << "Minimum value : " << minVal[0][len - 1]   << ", Maximum value : " << maxVal[0][len - 1]; } // Driver code to test above methods int main() { string expression = "1+2*3+4*5"; printMinAndMaxValueOfExp(expression); return 0; } C++ Minimum Value Expression Telegram - @examsAssistance

#include <bits/stdc++.h> using namespace std; // Utility method to check whether a character // is operator or not bool isOperator(char op) { return (op == '+' || op == '*'); } // method prints minimum and maximum value // obtainable from an expression void printMinAndMaxValueOfExp(string exp) { vector<int> num; vector<char> opr; string tmp = ""; // store operator and numbers in different vectors for (int i = 0; i < exp.length(); i++) {   if (isOperator(exp[i]))   {    opr.push_back(exp[i]);    num.push_back(atoi(tmp.c_str()));    tmp = "";   }   else   {    tmp += exp[i];   } } // storing last number in vector num.push_back(atoi(tmp.c_str())); int len = num.size(); int minVal[len][len]; int maxVal[len][len]; // initializing minval and maxval 2D array for (int i = 0; i < len; i++) {   for (int j = 0; j < len; j++)   {    minVal[i][j] = INT_MAX;    maxVal[i][j] = 0;    // initializing main diagonal by num values    if (i == j)     minVal[i][j] = maxVal[i][j] = num[i];   } } // looping similar to matrix chain multiplication // and updating both 2D arrays for (int L = 2; L <= len; L++) {   for (int i = 0; i < len - L + 1; i++)   {    int j = i + L - 1;    for (int k = i; k < j; k++)    {     int minTmp = 0, maxTmp = 0;     // if current operator is '+', updating tmp     // variable by addition     if(opr[k] == '+')     {      minTmp = minVal[i][k] + minVal[k + 1][j];      maxTmp = maxVal[i][k] + maxVal[k + 1][j];     }     // if current operator is '*', updating tmp     // variable by multiplication     else if(opr[k] == '*')     {      minTmp = minVal[i][k] * minVal[k + 1][j];      maxTmp = maxVal[i][k] * maxVal[k + 1][j];     }     // updating array values by tmp variables     if (minTmp < minVal[i][j])      minVal[i][j] = minTmp;     if (maxTmp > maxVal[i][j])      maxVal[i][j] = maxTmp;    }   } } // last element of first row will store the result cout << "Minimum value : " << minVal[0][len - 1]   << ", Maximum value : " << maxVal[0][len - 1]; } // Driver code to test above methods int main() { string expression = "1+2*3+4*5"; printMinAndMaxValueOfExp(expression); return 0; } C++ Minimum Value Expression Telegram - @examsAssistance

#include<bits/stdc++.h> int max(int a, int b); /* Returns length of LCS for X[0..m-1], Y[0..n-1] */ int lcs( char *X, char *Y, int m, int n ) { if (m == 0 || n == 0) return 0; if (X[m-1] == Y[n-1]) return 1 + lcs(X, Y, m-1, n-1); else return max(lcs(X, Y, m, n-1), lcs(X, Y, m-1, n)); } /* Utility function to get max of 2 integers */ int max(int a, int b) { return (a > b)? a : b; } /* Driver program to test above function */ int main() { char X[] = "AGGTAB"; char Y[] = "GXTXAYB"; int m = strlen(X); int n = strlen(Y); printf("Length of LCS is %d", lcs( X, Y, m, n ) ); return 0; } C++ Longest Special Subsequences Telegram - @examsAssistance

Soti exam help available ❤️✌️ Only few slots 600/- rupees only full exam✅❤️ 100 % clearance garenteee 😎 Contact - @examsAdmin

Pangram code Python Soti code ❤️✅

Only two slots left for soti ✅

Soti exam help available ❤️✌️ Only few slots 600/- rupees only full exam✅❤️ 100 % clearance garenteee 😎 Contact - @examsCoder

HEXAWARE exam help available ❤️✌️ Only few slots 600/- rupees only full exam✅❤️ 100 % clearance garenteee Contact - @examsAdmin

Virtusa 2nd Round Raghu code C++ @examsAssistance

patel code-python virtusa @examsAdmin

irfan code -python @examsCoder

taj code @examsCoder virtusa exam

Guy's for virtusa 2nd Round codes contact @examsAdmin 100Rupees per code

Soti exam help available ❤️✌️ Only few slots Very reasonable price ✅ Contact - @examsAdmin

Those who needs help to clear HEXAWARE,MINDTREE, ACCENTURE,CAPGEMINI,HCL,LTI or any other placement papers can contact fast nd book your slots 100% clearance guarantee Telegram @examsAdmin Note : it's paid 100% clearance