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

#include <iostream> #include <vector> #include <set> #include <algorithm> using namespace std; int main() { int n, m, k, days = 1, activeCount = 0; cin >> n >> m; vector<set<int>> connections(n); for (int i = 0, u, v; i < m; ++i) { cin >> u >> v; connections[u].insert(v); connections[v].insert(u); } cin >> k; vector<bool> active(n, true); activeCount = n; while (activeCount < k) { vector<bool> nextState(n, false); for (int i = 0; i < n; ++i) { int neighborCount = 0; for (int neighbor : connections[i]) { neighborCount += active[neighbor]; } if (active[i] && neighborCount == 3) { nextState[i] = true; } else if (!active[i] && neighborCount < 3) { nextState[i] = true; } } active = nextState; activeCount += count(active.begin(), active.end(), true); ++days; } cout << days; return 0; }

Block extraction

#include <bits/stdc++.h> using namespace std; int main() { int x, y; cin >> x >> y; vector<vector<int>> z(x, vector<int>(y)); for (int i = 0; i < x; ++i) { for (int j = 0; j < y; ++j) { cin >> z[i][j]; } } int w; cin >> w; map<int, vector<pair<int, int>>> a; set<int> b; for (int i = 0; i < x; ++i) { for (int j = 0; j < y; ++j) { int c = z[i][j]; a[c].emplace_back(i, j); b.insert(c); } } set<int> d; for (int i = 0; i < x; ++i) { vector<int> e; for (int j = 0; j < y; ++j) { if (z[i][j] == w) { e.push_back(j); } } if (!e.empty()) { int f = *max_element(e.begin(), e.end()); for (int j = f + 1; j < y; ++j) { int g = z[i][j]; if (g != w) { d.insert(g); } } } } set<int> h = b; d.erase(w); int i = 0; for (auto j = d.begin(); j != d.end(); ++j) { if (h.find(*j) != h.end()) { h.erase(*j); i++; } } auto k = [&](const set<int>& l) -> set<int> { set<int> m; for (auto& n : l) { for (auto& [o, p] : a[n]) { if (o == x - 1) { m.insert(n); break; } } } queue<int> q; for (auto& r : m) { q.push(r); } while (!q.empty()) { int s = q.front(); q.pop(); for (auto& t : l) { if (m.find(t) != m.end()) continue; bool u = false; for (auto& [v, w] : a[t]) { if (v + 1 < x) { int x = z[v + 1][w]; if (m.find(x) != m.end()) { u = true; break; } } } if (u) { m.insert(t); q.push(t); } } } return m; }; while (true) { set<int> y = k(h); set<int> z; for (auto& aa : h) { if (y.find(aa) == y.end()) { z.insert(aa); } } if (z.empty()) break; for (auto& bb : z) { h.erase(bb); i++; } } cout << i; return 0; }

Ready for next code 👇👇👇👇👇 https://t.me/codeing_are Share my group only

Buzz Fully accepted 🔥

14 segment

NEED more TCS CODEVITA ANSWERS ? Give heart to this post

Next 5 sending with all tets caes passed 🔥

First code done ✅

import java.util.*; public class DesertPathfinder { static class Cell implements Comparable<Cell> { int row, col, waterCost; Cell(int row, int col, int waterCost) { this.row = row; this.col = col; this.waterCost = waterCost; } @Override public int compareTo(Cell other) { return Integer.compare(this.waterCost, other.waterCost); } } public static int calculateMinWater(char[][] grid, int gridSize) { int[] rowOffsets = {-1, 1, 0, 0}; int[] colOffsets = {0, 0, -1, 1}; int[][] waterUsage = new int[gridSize][gridSize]; boolean[][] isVisited = new boolean[gridSize][gridSize]; for (int[] row : waterUsage) { Arrays.fill(row, Integer.MAX_VALUE); } int startRow = -1, startCol = -1, endRow = -1, endCol = -1; for (int row = 0; row < gridSize; row++) { for (int col = 0; col < gridSize; col++) { if (grid[row][col] == 'S') { startRow = row; startCol = col; } else if (grid[row][col] == 'E') { endRow = row; endCol = col; } } } PriorityQueue<Cell> priorityQueue = new PriorityQueue<>(); priorityQueue.offer(new Cell(startRow, startCol, 0)); waterUsage[startRow][startCol] = 0; while (!priorityQueue.isEmpty()) { Cell current = priorityQueue.poll(); int currentRow = current.row; int currentCol = current.col; if (isVisited[currentRow][currentCol]) { continue; } isVisited[currentRow][currentCol] = true; if (currentRow == endRow && currentCol == endCol) { return waterUsage[currentRow][currentCol]; } for (int i = 0; i < 4; i++) { int nextRow = currentRow + rowOffsets[i]; int nextCol = currentCol + colOffsets[i]; if (nextRow >= 0 && nextCol >= 0 && nextRow < gridSize && nextCol < gridSize && grid[nextRow][nextCol] != 'M' && !isVisited[nextRow][nextCol]) { int newCost = waterUsage[currentRow][currentCol] + (grid[currentRow][currentCol] == 'T' && grid[nextRow][nextCol] == 'T' ? 0 : 1); if (newCost < waterUsage[nextRow][nextCol]) { waterUsage[nextRow][nextCol] = newCost; priorityQueue.offer(new Cell(nextRow, nextCol, newCost)); } } } } return -1; } public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int gridSize = scanner.nextInt(); scanner.nextLine(); char[][] grid = new char[gridSize][gridSize]; for (int row = 0; row < gridSize; row++) { String[] elements = scanner.nextLine().split(" "); for (int col = 0; col < gridSize; col++) { grid[row][col] = elements[col].charAt(0); } } int result = calculateMinWater(grid, gridSize); System.out.print(result); scanner.close(); } } Desert queen 👑👑 https://t.me/codeing_are Fully accepted 200% sure

Ready guy's for next code

Fast guys I am wating to upload code with proof Allredy uploaded 👇 https://t.me/codeing_are Fastt 😣✅✅✅✅

https://t.me/codeing_are Share the group for Next code after 17k I will upload all code with proof 👇👇👇👇👇 https://t.me/codeing_are

import java.util.*; public class ShapeMatcher { public static List<Integer> coordinateShift(List<int[]> shape) { int minX = shape.stream().mapToInt(p -> p[0]).min().orElse(0); int minY = shape.stream().mapToInt(p -> p[1]).min().orElse(0); List<int[]> shifted = new ArrayList<>(); for (int[] point : shape) { shifted.add(new int[]{point[0] - minX, point[1] - minY}); } return convertToSortable(shifted); } public static List<int[]> rotateShape(List<int[]> shape) { List<int[]> rotated = new ArrayList<>(); for (int[] point : shape) { rotated.add(new int[]{-point[1], point[0]}); } return rotated; } public static List<Integer> convertToSortable(List<int[]> shape) { List<Integer> sortable = new ArrayList<>(); for (int[] point : shape) { sortable.add(point[0]); sortable.add(point[1]); } Collections.sort(sortable); return sortable; } public static boolean compareShapes(List<int[]> shape1, List<int[]> shape2) { if (shape1.size() != shape2.size()) return false; List<Integer> base1 = coordinateShift(shape1); List<Integer> base2 = coordinateShift(shape2); for (int i = 0; i < 4; i++) { if (base1.equals(base2)) return true; shape2 = rotateShape(shape2); base2 = coordinateShift(shape2); } return false; } public static void findMatchingShapes(List<List<int[]>> shapes) { int n = shapes.size(); for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { if (compareShapes(shapes.get(i), shapes.get(j))) { System.out.print((i + 1) + " " + (j + 1)); return; } } } } public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int shapeCount = scanner.nextInt(); List<List<int[]>> shapes = new ArrayList<>(); for (int i = 0; i < shapeCount; i++) { int vertexCount = scanner.nextInt(); List<int[]> shape = new ArrayList<>(); for (int j = 0; j < vertexCount; j++) { int x = scanner.nextInt(); int y = scanner.nextInt(); shape.add(new int[]{x, y}); } shapes.add(shape); } findMatchingShapes(shapes); scanner.close(); } } Find pair( java)

NEED more TCS CODEVITA ANSWERS ? Give heart to this post

from collections import deque def count_infected_neighbors(board, x, y): size = len(board) infected_count = 0 for dx in [-1, 0, 1]: for dy in [-1, 0, 1]: if dx == 0 and dy == 0: continue nx, ny = x + dx, y + dy if 0 <= nx < size and 0 <= ny < size and board[nx][ny] == 1: infected_count += 1 return infected_count def plague_simulation(board): size = len(board) new_board = [row[:] for row in board] for x in range(size): for y in range(size): infected_count = count_infected_neighbors(board, x, y) if board[x][y] == 0 and infected_count == 3: new_board[x][y] = 1 elif board[x][y] == 1 and (infected_count < 2 or infected_count > 3): new_board[x][y] = 0 return new_board def find_path(grid_size, initial_board): board = [[1 if cell == '1' else 0 for cell in row] for row in initial_board] start_x, start_y, end_x, end_y = -1, -1, -1, -1 for x in range(grid_size): for y in range(grid_size): if initial_board[x][y] == 's': start_x, start_y = x, y board[x][y] = 0 if initial_board[x][y] == 'd': end_x, end_y = x, y board[x][y] = 0 queue = deque([(start_x, start_y, board, 0)]) visited_states = set() while queue: x, y, current_board, days = queue.popleft() if x == end_x and y == end_y: return days state = (x, y, tuple(map(tuple, current_board))) if state in visited_states: continue visited_states.add(state) next_board = plague_simulation(current_board) for dx, dy in [(0, 0), (-1, 0), (1, 0), (0, -1), (0, 1)]: nx, ny = x + dx, y + dy if 0 <= nx < grid_size and 0 <= ny < grid_size and next_board[nx][ny] == 0: queue.append((nx, ny, next_board, days + 1)) return -1 if name == "main": n = int(input()) grid = [input().strip() for _ in range(n)] print(find_path(n, grid) + 1) Plague 2050 ✅✅ Full passed✅✅

Next code loded