MTHREE exam help ! Infosys exam help ! Cognizant exam help ! Amazon exam answer

Share fast group

After 16k I will upload so shared fas everyone

Fastt

.

Next code ( string obsession) 👇👇👇👇

Now share group Everyone's please 🥺🥺🥺🥺

from collections import deque import itertools def get_shortest_path(grid, N): start = None end = None for i in range(N): for j in range(N): if grid[i][j] == 'S': start = (i, j) elif grid[i][j] == 'D': end = (i, j) queue = deque([(start, 0)]) visited = {start} while queue: (x, y), dist = queue.popleft() if grid[x][y] == 'D': return dist for nx, ny in [(x+1,y), (x-1,y), (x,y+1), (x,y-1)]: if (0 <= nx < N and 0 <= ny < N and (nx,ny) not in visited and grid[nx][ny] in 'TD'): visited.add((nx,ny)) queue.append(((nx,ny), dist + 1)) return float('inf') def get_sheets(grid, N, M): sheets = [] for i in range(0, N, M): for j in range(0, N, M): sheet = [] for x in range(M): row = [] for y in range(M): row.append(grid[i+x][j+y]) sheet.append(row) sheets.append(sheet) return sheets def make_grid(arrangement, sheets, N, M): grid = [['' for _ in range(N)] for _ in range(N)] num_sheets = N // M for idx, sheet_idx in enumerate(arrangement): sheet = sheets[sheet_idx] base_i = (idx // num_sheets) * M base_j = (idx % num_sheets) * M for i in range(M): for j in range(M): grid[base_i + i][base_j + j] = sheet[i][j] return grid def solve(): N, M = map(int, input().split()) original_grid = [] for _ in range(N): original_grid.append(list(input().strip())) sheets = get_sheets(original_grid, N, M) num_sheets = (N // M) ** 2 s_sheet = d_sheet = None for i, sheet in enumerate(sheets): for row in sheet: if 'S' in row: s_sheet = i if 'D' in row: d_sheet = i min_dist = float('inf') nums = list(range(num_sheets)) nums.remove(s_sheet) nums.remove(d_sheet) for middle_perm in itertools.permutations(nums): arrangement = [s_sheet] + list(middle_perm) + [d_sheet] grid = make_grid(arrangement, sheets, N, M) min_dist = min(min_dist, get_shortest_path(grid, N)) return min_dist if name == "main": print(solve()) Arranged map full accepted ☺️

After 16k i will upload one more code answer with all tets caes passed 🔥🥳🥳🥳 https://t.me/codeing_are Show share fast guys

After 16k i will upload one more code answer with all tets caes passed 🔥🥳🥳🥳 https://t.me/codeing_are Show share fast guys

String of session

See

After 16k i will share code

Arrange map done 👍✅✅

Fast guys

After 16k i will upload one more code answer with all tets caes passed 🔥🥳🥳🥳 https://t.me/codeing_are Show share fast guys

Next answer ready ☺️😊☺️☺️☺️

Remove all given code then types with change some variable

#include <bits/stdc++.h> using namespace std; #define loop(i, a, n) for (lli i = (a); i < (n); ++i) #define loopD(i, a, n) for (lli i = (a); i >= (n); --i) #define all(c) (c).begin(), (c).end() #define rall(c) (c).rbegin(), (c).rend() #define sz(a) ((lli)a.size()) #define YES cout << "YES" << endl; #define NO cout << "NO" << endl; #define endl '\n' #define fastio std::ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); #define pb push_back #define pp pop_back() #define fi first #define si second #define v(a) vector<int>(a) #define vv(a) vector<vector<int>>(a) #define present(c, x) ((c).find(x) != (c).end()) #define set_bits __builtin_popcountll #define MOD 1000000007 #define int long long typedef long long lli; typedef vector<int> vi; typedef vector<vi> vvi; typedef pair<lli, lli> pll; typedef pair<int, int> pii; typedef unordered_map<int, int> umpi; typedef map<int, int> mpi; typedef vector<pii> vp; typedef vector<lli> vll; typedef vector<vll> vvll; struct Line { int x1, y1, x2, y2; bool vertical() const { return x1 == x2; } bool horizontal() const { return y1 == y2; } bool diagonal() const { return abs(x2 - x1) == abs(y2 - y1); } }; int N, K; vector<Line> lines; map<pair<int, int>, vector<int>> ptsMap; void add(const Line& line, int idx) { int x1 = line.x1, y1 = line.y1; int x2 = line.x2, y2 = line.y2; if (line.vertical()) { int yStart = min(y1, y2); int yEnd = max(y1, y2); for(int y = yStart; y <= yEnd; y++) { ptsMap[{x1, y}].push_back(idx); } } else if (line.horizontal()) { int xStart = min(x1, x2); int xEnd = max(x1, x2); for(int x = xStart; x <= xEnd; x++) { ptsMap[{x, y1}].push_back(idx); } } else if (line.diagonal()) { int steps = abs(x2 - x1); int dx = (x2 - x1) / steps; int dy = (y2 - y1) / steps; for(int i = 0; i <= steps; i++) { int x = x1 + i * dx; int y = y1 + i * dy; ptsMap[{x, y}].push_back(idx); } } } int ff(int x1, int y1, int x2, int y2) { if(x1 == x2) return abs(y1 - y2); if(y1 == y2) return abs(x1 - x2); if(abs(x1 - x2) == abs(y1 - y2)) return abs(x1 - x2); return 0; } int solve(const pair<int, int>& pt, const vector<int>& lst) { vector<int> d; for(auto lIdx : lst) { const Line& ln = lines[lIdx]; bool oneSided = (pt.first == ln.x1 && pt.second == ln.y1) || (pt.first == ln.x2 && pt.second == ln.y2); if(oneSided) { int ex = (pt.first == ln.x1 && pt.second == ln.y1) ? ln.x2 : ln.x1; int ey = (pt.first == ln.x1 && pt.second == ln.y1) ? ln.y2 : ln.y1; d.push_back(ff(pt.first, pt.second, ex, ey)); } else { d.push_back(ff(pt.first, pt.second, ln.x1, ln.y1)); d.push_back(ff(pt.first, pt.second, ln.x2, ln.y2)); } } return d.empty() ? 0 : *min_element(d.begin(), d.end()); } void solve() { cin >> N; lines.resize(N); for(int i = 0; i < N; i++) { cin >> lines[i].x1 >> lines[i].y1 >> lines[i].x2 >> lines[i].y2; add(lines[i], i); } cin >> K; int total = 0; for(auto &[pt, lst] : ptsMap) { if(sz(lst) == K) { total += solve(pt, lst); } } cout << total; } int32_t main() { solve(); return 0; } // magic stars intensity ac Full accepted ☺️

After 16k i will upload one more code answer with all tets caes passed 🔥🥳🥳🥳 Show share fast guys