en
Feedback

Don't get caught by a cheater! Telemetrio finds and tags such channels πŸ‘‰ If you want to see the tag, subscribe

ACCENTURE EXAM SOLUTIONS

ACCENTURE EXAM SOLUTIONS

Open in Telegram

πŸ”₯Guys plz Stop fearing for daily exams πŸ“ πŸ‘¨β€πŸ’» @srksvk is here to help you all at lowest cost possible.πŸ’ͺ πŸŒ€ ” Our Only Aim Is To Let Get Placed To You In A Reputed Company πŸ”₯Effort from our side = πŸ’― πŸ“±Main Channel: @coding_are πŸ“±Tel I'd : @srksvk

Show more

πŸ“ˆ Analytical overview of Telegram channel ACCENTURE EXAM SOLUTIONS

Channel ACCENTURE EXAM SOLUTIONS (@coding_are) in the English language segment is an active participant. Currently, the community unites 13 836 subscribers, ranking 14 761 in the Education category and 28 197 in the India region.

πŸ“Š Audience metrics and dynamics

Since its creation on Π½Π΅Π²Ρ–Π΄ΠΎΠΌΠΎ, the project has demonstrated rapid growth, gathering an audience of 13 836 subscribers.

According to the latest data from 19 November, 2026, the channel demonstrates stable activity. Although there has been a change in the number of participants by -179 over the last 30 days and by -11 over the last 24 hours, overall reach remains high.

  • Verification status: Not verified
  • Engagement rate (ER): The average audience engagement rate is 3.43%. Within the first 24 hours after publication, content typically collects 1.12% reactions from the total number of subscribers.
  • Post reach: On average, each post receives 474 views. Within the first day, a publication typically gains 155 views.
  • Reactions and interaction: The audience actively supports content: the average number of reactions per post is 1.
  • Thematic interests: Content is focused on key topics such as placement, gaurntee, suree, capgemini, infosy.

πŸ“ Description and content policy

The author describes the resource as a platform for expressing subjective opinions:
β€œπŸ”₯Guys plz Stop fearing for daily exams πŸ“ πŸ‘¨β€πŸ’» @srksvk is here to help you all at lowest cost possible.πŸ’ͺ πŸŒ€ ” Our Only Aim Is To Let Get Placed To You In A Reputed Company πŸ”₯Effort from our side = πŸ’― πŸ“±Main Channel: @coding_are πŸ“±Tel I'd : @srks...”

Thanks to the high frequency of updates (latest data received on 20 November, 2026), the channel maintains relevance and a high level of publication reach. Analytics show that the audience actively interacts with content, making it an important point of influence in the Education category.

13 836
Subscribers
-1124 hours
-467 days
-17930 days
Posts Archive
photo content
30 Nov 2024, 00:26
30 Nov 2024, ~11:02

14 segment
30 Nov 2024, 00:23
30 Nov 2024, ~11:02

photo content
30 Nov 2024, 00:23
30 Nov 2024, ~11:02

NEED more TCS CODEVITA ANSWERS ? Give heart to this post
30 Nov 2024, 00:20
30 Nov 2024, ~11:02

Next 5 sending with all tets caes passed πŸ”₯
30 Nov 2024, 00:17
30 Nov 2024, ~11:02

First code done βœ…
30 Nov 2024, 00:16
30 Nov 2024, ~11:02

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
30 Nov 2024, 00:16
30 Nov 2024, ~11:02

Ready guy's for next code
30 Nov 2024, 00:07
30 Nov 2024, ~11:02

Fast guys I am wating to upload code with proof Allredy uploaded πŸ‘‡ https://t.me/codeing_are Fastt πŸ˜£βœ…βœ…βœ…βœ…
29 Nov 2024, 23:48
30 Nov 2024, ~11:02

photo content
29 Nov 2024, 23:38
30 Nov 2024, ~11:02

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
29 Nov 2024, 23:37
30 Nov 2024, ~11:02

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)
29 Nov 2024, 23:23
30 Nov 2024, ~11:02

NEED more TCS CODEVITA ANSWERS ? Give heart to this post
29 Nov 2024, 23:18
30 Nov 2024, ~11:02

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βœ…βœ…
29 Nov 2024, 23:15
30 Nov 2024, ~11:02

Next code loded
29 Nov 2024, 23:00
30 Nov 2024, ~11:02

I will upload today only fully passed code so don't worry Just share my group βœ… https://t.me/codeing_are
29 Nov 2024, 22:54
30 Nov 2024, ~11:02

Run in java File name should be same as class name
29 Nov 2024, 22:49
30 Nov 2024, ~11:02

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
29 Nov 2024, 22:48
30 Nov 2024, ~11:02

Coded loaded
29 Nov 2024, 22:43
30 Nov 2024, ~11:02

Ready for code guys
29 Nov 2024, 22:42
29 Nov 2024, ~22:42