CODING SOLUTION - Placement Jobs & Materials

int n=books.size();         vector<vector<int>> cost(n+1,vector<int>(n+1));         for(int i=1;i<=n;i++)         {             int height=books[i-1][1];             int width=books[i-1][0];             cost[i][i]=height;             for(int j=i+1;j<=n;j++)             {                 height=max(height,books[j-1][1]);                 width+=books[j-1][0];                 if(width<=shelfWidth) cost[i][j]=height;                 else cost[i][j]=-1;             }         }         vector<int> ans(n+1);         ans[0]=0;         for(int i=1;i<=n;i++)         {             ans[i]=INT_MAX;             for(int j=1;j<=i;j++)             {                 if(cost[j][i]==-1) continue;                 if(ans[j-1]!=INT_MAX) ans[i]=min(ans[i],ans[j-1]+cost[j][i]);             }         }         return ans[n] Python Murder on book shelf Code Telegram - t.me/codingsolution_IT

Python Distant Palindrome code Telegram - t.me/codingsolution_IT

SOTI & LTI EXAM SOLUTION GROUP: telegram.me/codingsolution_IT 1) telegram.me/+V7_OuuZWqTAwZWZl 2) telegram.me/+wxfAMtYpHoMxZjNl ✅ Share post in ur college Whatsapp grps.

SOTI & LTI EXAM SOLUTION GROUP: telegram.me/codingsolution_IT 1) telegram.me/+V7_OuuZWqTAwZWZl 2) telegram.me/+wxfAMtYpHoMxZjNl ✅ Share post in ur college Whatsapp grps.

Python Minimum swap Code Telegram - t.me/codingsolution_IT

def isPalindrome(s): return s == s[::-1] # Driver code s = "malayalam" ans = isPalindrome(s) if ans: print("Yes") else: print("No") Python Palindrome Code Telegram - t.me/codingsolution_IT

SOTI & LTI EXAM SOLUTION GROUP: telegram.me/codingsolution_IT 1) telegram.me/+V7_OuuZWqTAwZWZl 2) telegram.me/+wxfAMtYpHoMxZjNl ✅ Share post in ur college Whatsapp grps.

C++ Build road code Telegram - t.me/codingsolution_IT

SOTI & LTI EXAM SOLUTION GROUP: telegram.me/codingsolution_IT 1) telegram.me/+V7_OuuZWqTAwZWZl 2) telegram.me/+wxfAMtYpHoMxZjNl ✅ Share post in ur college Whatsapp grps.

#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 - t.me/codingsolution_IT

SOTI & LTI EXAM SOLUTION GROUP: telegram.me/codingsolution_IT 1) telegram.me/+V7_OuuZWqTAwZWZl 2) telegram.me/+wxfAMtYpHoMxZjNl ✅ Share post in ur college Whatsapp grps.

#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 - t.me/codingsolution_IT

SOTI EXAM SOLUTION GROUP: telegram.me/codingsolution_IT telegram.me/+V7_OuuZWqTAwZWZl ✅ Share post in ur college Whatsapp grps.

SOTI EXAM SOLUTION GROUP: telegram.me/codingsolution_IT telegram.me/+V7_OuuZWqTAwZWZl ✅ Share post in ur college Whatsapp grps.

SOTI EXAM SOLUTION GROUP: telegram.me/codingsolution_IT telegram.me/+V7_OuuZWqTAwZWZl ✅ Share post in ur college Whatsapp grps.

SOTI EXAM SOLUTION GROUP: telegram.me/codingsolution_IT 1) telegram.me/+V7_OuuZWqTAwZWZl 2) telegram.me/+wxfAMtYpHoMxZjNl ✅ Share post in ur college Whatsapp grps.

SOTI EXAM SOLUTION GROUP: telegram.me/codingsolution_IT 1) telegram.me/+V7_OuuZWqTAwZWZl 2) telegram.me/+wxfAMtYpHoMxZjNl ✅ Share post in ur college Whatsapp grps.

SOTI EXAM SOLUTION GROUP: telegram.me/codingsolution_IT 1) telegram.me/+V7_OuuZWqTAwZWZl 2) telegram.me/+wxfAMtYpHoMxZjNl ✅ Share post in ur college Whatsapp grps.

SOTI EXAM SOLUTION GROUP: telegram.me/codingsolution_IT 1) telegram.me/+V7_OuuZWqTAwZWZl 2) telegram.me/+wxfAMtYpHoMxZjNl ✅ Share post in ur college Whatsapp grps.

SOTI EXAM SOLUTION GROUP: telegram.me/codingsolution_IT 1) telegram.me/+V7_OuuZWqTAwZWZl 2) telegram.me/+wxfAMtYpHoMxZjNl ✅ Share post in ur college Whatsapp grps.