IBM | AMAZON | ACCENTURE OA Exams SOLUTIONS

Amazon apply link: https://amazonvirtualhiring.hirepro.in/registration/incta/ju0f4/apply/?j=57736&e=13720

💢 IBM EXAM done successfully ❤ Contact @UrTrusty 💯 clearance Remote mode ♥

💢  IBM and any exam help available 100% clearance will be provided Full exam help will be provided To book slot contact @UrTrusty

💢 NPCI 10AM slot done successfully ❤ Contact @UrTrusty 💯 clearance

💢 IBM Exam cleared and got next round mail ♥ who took help on 3rd September Contact @UrTrusty for help 💯% clearance✅

IBM EXAM DONE

💢 IBM 6:30PM 10th August slot Done ♥ Contact @UrTrusty for help 💯% clearance✅ 6pm slot helping contact fast ✅

💢  IBM and any exam help available 100% clearance will be provided Full exam help will be provided To book slot contact @UrTrusty

X from Y Code C++ Language ✅ Done TCS Codevita #include <bits/stdc++.h> using namespace std; typedef long long ll; #define freakperson vector<int> #define all(a) (a).begin() , (a).end() #define sz(a) ((int)((a).size())) const ll INF = 4e18; vector<freakperson> dp(1e4+1 , freakperson(1e4+1 , -1)); int f(int i , int j , int s , int r , string &x , string &y , string &y1) {     if(i>j)return 0;     if(dp[i][j] != -1)return dp[i][j];     int mini = 1e9;     for(int k=i; k<=j; k++)     {                 if(y1.find(x.substr(i , k-i+1)) != string::npos)mini = min(mini , r+f(k+1 , j , s , r , x , y , y1));         if(y.find(x.substr(i , k-i+1)) != string::npos)mini = min(mini , s+f(k+1 , j , s , r , x , y , y1));     }     return mini; } int solve(int s , int r , string x, string y) {     string y1 = y;     reverse(all(y1));     return f(0 , sz(x)-1 , s, r , x , y , y1); } int32_t main(){     ios_base::sync_with_stdio(false);      cin.tie(NULL);     string x , y;     cin >> x >> y;     int s, r;     cin >> s >> r;     int ans = solve(s , r, x , y);     cout << ans;     return 0; } X from Y C++ Language 100% Working ✅ TCS Codevita

💢  IBM CODEKNACK exam help available 100% clearance will be provided Full exam help will be provided To book slot contact @UrTrusty

C++ Problem of the Day 3 December Geeks for Geeks class Solution { public: void inorder(Node *root,vector&v){ if(!root)return; inorder(root->left,v); v.push_back(root->data); inorder(root->right,v); } int countPairs(Node* root1, Node* root2, int x) { vectorv1,v2; inorder(root1,v1); inorder(root2,v2); unordered_set s(v1.begin(),v1.end()); int ct = 0; for(int i = 0; i < v2.size(); i++){ if(s.find(x - v2[i]) != s.end()) ct++; } return ct; } }; C++ Problem of the Day 3 December Geeks for Geeks

Slots will close at 11AM for IBM exam @UrTrusty

💢  IBM CODEKNACK exam help available 100% clearance will be provided Full exam help will be provided To book slot contact @UrTrusty

💢 IBM Exam cleared and got next round mail ♥ who took help on 3rd September Contact @UrTrusty for help 💯% clearance✅

IBM EXAM DONE

💢 IBM 6:30PM 10th August slot Done ♥ Contact @UrTrusty for help 💯% clearance✅ 6pm slot helping contact fast ✅

IBM EXAM CLEARED ❤💯 @UrTrusty