INFOSYS EXAM SOLUTIONS

Deloitte exam successfully completed by remote access 👍👍👍👍👍👍 65/65 MCQ done with 💯 correct answer ✅✅✅ 2/2 code done with all tests cases passed ✅✅ Contact for placement exam @srksvk

Qualcomm exam successfully completed by remote ✅✅✅✅ 60/60 MCQ done with all tests case's passed ✅✅ Contact for placement exam @srksvk

Infosys on campus exams Adobe Accenture on campus Accolite IBM Amazon Capgemini Any off campus or on campus exam  help available Contact fast and book your slots Contact @srksvk 200% suree clearance gaurntee 🔥   Remote access available All company interview help available with sure clearance

Infosys on campus exams Adobe Accenture on campus Accolite IBM Amazon Capgemini Any off campus or on campus exam  help available Contact fast and book your slots Contact @srksvk 200% suree clearance grauntee 🔥   Remote access available All company interview help available with sure clearance gaurntee

Accenture on campus exam successfully completed by remote access 👍👍👍👍👍👍👍 All round cleared ✅✅✅✅ 2/2 code done also passed ✅ Contact for placement exam @srksvk

Infosys exam help available Contact fast and book your slots Contact @srksvk 200% suree clearance gaurntee

Amazon 2nd round help successfully completed by remote access 👍👍👍👍👍👍👍 All questions answer provided on time with all 💯% correct answer ✅ Contact for placement @srksvk

Amazon exam successfully completed by remote access 👍👍👍👍👍 2/2 code done with all tests case's passed ✅✅ Contact for placement @srksvk

Amazon interview help successfully completed by remote access 👍👍👍👍👍 All questions answer provided on time with 💯 correct answer ✅✅ Contact for placement exam @srksvk

Hi

Infosys exam help available Contact fast and book your slots Contact @srksvk 200% suree clearance gaurntee ✅

Micron exam successfully completed by remote access 👍👍👍👍👍👍👍 2/2 code done with all tests case's passed ✅✅ Contact for placement exam @srksvk

https://ibmglobal.avature.net/en_US/careers/JobDetail/Associate-System-Engineer/66789 Ibm apply fast

#include <bits/stdc++.h> using namespace std; static int min_ops(const vector<int>& a) { int n = (int)a.size(); string s(n, '\0'), g(n, '\0'); for (int i = 0; i < n; ++i) s[i] = char(a[i]); for (int i = 0; i < n; ++i) g[i] = char(i); if (s == g) return 0; vector<array<int, 3>> mv; mv.reserve(n * n * n); for (int i = 0; i < n; ++i) { for (int j = i + 1; j <= n; ++j) { int ln = j - i; for (int k = 0; k <= n - ln; ++k) { if (k == i) continue; mv.push_back({i, j, k}); } } } deque<string> q1, q2; unordered_map<string, int> d1, d2; q1.push_back(s); d1.emplace(s, 0); q2.push_back(g); d2.emplace(g, 0); auto expand = [&](deque<string>& q, unordered_map<string, int>& dself, unordered_map<string, int>& dother) -> int { int m = (int)q.size(); while (m--) { string x = q.front(); q.pop_front(); int dx = dself[x]; for (auto& t : mv) { int i = t[0], j = t[1], k = t[2]; int ln = j - i; string b = x.substr(i, ln); string r = x.substr(0, i) + x.substr(j); string y = r.substr(0, k) + b + r.substr(k); if (dself.find(y) != dself.end()) continue; int nd = dx + 1; auto it = dother.find(y); if (it != dother.end()) return nd + it->second; dself.emplace(y, nd); q.push_back(y); } } return -1; }; while (!q1.empty() && !q2.empty()) { if (q1.size() <= q2.size()) { int ans = expand(q1, d1, d2); if (ans != -1) return ans; } else { int ans = expand(q2, d2, d1); if (ans != -1) return ans; } } return 0; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; if (!(cin >> n)) return 0; string line; getline(cin, line); // consume endline after n getline(cin, line); // blank line vector<string> sh(n), og(n); for (int i = 0; i < n; ++i) getline(cin, sh[i]); getline(cin, line); // blank line for (int i = 0; i < n; ++i) getline(cin, og[i]); unordered_map<string, int> mp; mp.reserve(n * 2); for (int i = 0; i < n; ++i) mp[og[i]] = i; vector<int> a(n); for (int i = 0; i < n; ++i) a[i] = mp[sh[i]]; cout << min_ops(a) << "\n"; return 0; } Order it (cpp)

include using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int N, M; cin >> N >> M; vector grid(N); for (int i = 0; i < N; i++) { grid[i].resize(M); for (int j = 0; j < M; j++) { cin >> grid[i][j]; } } vector horizontal_rods, vertical_rods; for (int i = 0; i < N; i++) { if (all_of(grid[i].begin(), grid[i].end(), [](char c){ return c != '.'; })) horizontal_rods.push_back(i); } for (int j = 0; j < M; j++) { bool full = true; for (int i = 0; i < N; i++) if (grid[i][j] == '.') full = false; if (full) vertical_rods.push_back(j); } vector> is_cross(N, vector(M, false)); for (int c : vertical_rods) { for (int i = 0; i < N; i++) { int left = c - 1, right = c + 1; if (left >= 0 && right < M && grid[i][left] == 'C' && grid[i][right] == 'C') is_cross[i][c] = true; } } for (int r : horizontal_rods) { for (int j = 0; j < M; j++) { int up = r - 1, down = r + 1; if (up >= 0 && down < N && grid[up][j] == 'C' && grid[down][j] == 'C') is_cross[r][j] = true; } } vector> cable(N, vector(M, false)); for (int i = 0; i < N; i++) for (int j = 0; j < M; j++) if (grid[i][j] == 'C' || is_cross[i][j]) cable[i][j] = true; vector> adj(N * M); int di[4] = {-1, 0, 1, 0}; int dj[4] = {0, 1, 0, -1}; for (int i = 0; i < N; i++) { for (int j = 0; j < M; j++) { if (!cable[i][j]) continue; int id = i * M + j; for (int d = 0; d < 4; d++) { int ni = i + di[d], nj = j + dj[d]; if (ni >= 0 && ni < N && nj >= 0 && nj < M && cable[ni][nj]) adj[id].push_back(ni * M + nj); } } } int start = -1; for (int i = 0; i < N && start == -1; i++) for (int j = 0; j < M; j++) if (cable[i][j] && adj[i * M + j].size() == 1) { start = i * M + j; break; } vector visited(N * M, false); vector sum_h(N, 0), sum_v(M, 0); int curr = start, prevv = -1; visited[curr] = true; while (true) { int cr = curr / M, cc = curr % M; int nextt = -1; for (int nb : adj[curr]) if (nb != prevv && !visited[nb]) { nextt = nb; break; } if (is_cross[cr][cc] && prevv != -1) { int pr = prevv / M, pc = prevv % M; int sign = (grid[cr][cc] == 'C') ? 1 : -1; if (pr == cr) sum_v[cc] += ((pc < cc) ? 1 : -1) * sign; else sum_h[cr] += ((pr < cr) ? 1 : -1) * sign; } if (nextt == -1) break; prevv = curr; curr = nextt; visited[curr] = true; } long long answer = 0; for (int r : horizontal_rods) answer += abs(sum_h[r]) / 2; for (int c : vertical_rods) answer += abs(sum_v[c]) / 2; cout << answer; return 0; } Cable (c++)

Zoobin cpp

include using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int a; cin >> a; vector> b(a), c(a); set d; for (int i = 0; i < a; i++) { cin >> b[i].first >> b[i].second; d.insert(b[i].first); d.insert(b[i].second); } for (int i = 0; i < a; i++) cin >> c[i].first >> c[i].second; vector e(d.begin(), d.end()); auto f = [](vector> g) { for (auto& [h, i] : g) if (h > i) swap(h, i); sort(g.begin(), g.end()); return g; }; auto j = [](const vector>& k) { string l; for (auto [m, n] : k) l += to_string(m) + "-" + to_string(n) + ","; return l; }; vector> o = f(c); string p = j(o); vector> q = f(b); string r = j(q); if (r == p) { cout << 0; return 0; } map s; queue>,int>> t; t.push({q,0}); s[r] = 0; while (!t.empty()) { auto [u,v] = t.front(); t.pop(); map> w; for (auto [x,y] : u) { w[x].push_back(y); w[y].push_back(x); } set> z; for (int aa : e) { function&,set&)> ab = [&](int ac,int ad,vector& ae,set& af) { ae.push_back(ac); af.insert(ac); for (int ag : w[ac]) { if (ag == ad) continue; if (af.count(ag)) { auto ah = find(ae.begin(), ae.end(), ag); if (ah != ae.end()) { vector ai(ah, ae.end()); if (ai.size() >= 3) { int aj = min_element(ai.begin(), ai.end()) - ai.begin(); rotate(ai.begin(), ai.begin() + aj, ai.end()); z.insert(ai); } } } else if (ae.size() < e.size()) ab(ag, ac, ae, af); } ae.pop_back(); af.erase(ac); }; vector ak; set al; ab(aa, -1, ak, al); } for (const auto& am : z) { map an; for (int ao : e) an[ao] = ao; int ap = am.size(); for (int aq = 0; aq < ap; aq++) an[am[aq]] = am[(aq + 1) % ap]; vector> ar; for (auto [as, at] : u) ar.push_back({an[as], an[at]}); ar = f(ar); string au = j(ar); if (au == p) { cout << v + 1; return 0; } if (!s.count(au)) { s[au] = v + 1; t.push({ar, v + 1}); } } } cout << -1; return 0; }