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 833 subscribers, ranking 14 760 in the Education category and 28 177 in the India region.

πŸ“Š Audience metrics and dynamics

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

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

  • Verification status: Not verified
  • Engagement rate (ER): The average audience engagement rate is 3.50%. Within the first 24 hours after publication, content typically collects 1.07% reactions from the total number of subscribers.
  • Post reach: On average, each post receives 484 views. Within the first day, a publication typically gains 148 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 21 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 833
Subscribers
No data24 hours
-397 days
-17130 days
Posts Archive
Next code ( string obsession) πŸ‘‡πŸ‘‡πŸ‘‡πŸ‘‡
29 Nov 2024, 07:39
30 Nov 2024, ~11:03

Now share group Everyone's please πŸ₯ΊπŸ₯ΊπŸ₯ΊπŸ₯Ί
29 Nov 2024, 07:28
30 Nov 2024, ~11:03

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 ☺️
29 Nov 2024, 07:25
30 Nov 2024, ~11:03

After 16k i will upload one more code answer with all tets caes passed πŸ”₯πŸ₯³πŸ₯³πŸ₯³ https://t.me/codeing_are Show share fast guys
29 Nov 2024, 07:17
30 Nov 2024, ~11:03

After 16k i will upload one more code answer with all tets caes passed πŸ”₯πŸ₯³πŸ₯³πŸ₯³ https://t.me/codeing_are Show share fast guys
29 Nov 2024, 07:00
29 Nov 2024, ~07:17

String of session
29 Nov 2024, 07:00
30 Nov 2024, ~11:03

See
29 Nov 2024, 07:00
30 Nov 2024, ~11:03

photo content
+1
29 Nov 2024, 07:00
30 Nov 2024, ~11:03

After 16k i will share code
29 Nov 2024, 06:57
30 Nov 2024, ~11:03

Arrange map done πŸ‘βœ…βœ…
Arrange map done πŸ‘βœ…βœ…
29 Nov 2024, 06:57
30 Nov 2024, ~11:03

Fast guys
29 Nov 2024, 06:46
30 Nov 2024, ~11:03

After 16k i will upload one more code answer with all tets caes passed πŸ”₯πŸ₯³πŸ₯³πŸ₯³ https://t.me/codeing_are Show share fast guys
29 Nov 2024, 06:35
30 Nov 2024, ~11:03

Next answer ready ☺️😊☺️☺️☺️
29 Nov 2024, 06:35
30 Nov 2024, ~11:03

Remove all given code then types with change some variable
29 Nov 2024, 06:33
30 Nov 2024, ~11:03

#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 ☺️
29 Nov 2024, 06:29
30 Nov 2024, ~11:03

After 16k i will upload one more code answer with all tets caes passed πŸ”₯πŸ₯³πŸ₯³πŸ₯³ Show share fast guys
29 Nov 2024, 06:20
30 Nov 2024, ~11:03

Fast guy's next answer are ready
29 Nov 2024, 06:19
30 Nov 2024, ~11:03

Guys now you turn to share my group So, share group and add your friend Please guy's https://t.me/codeing_are
29 Nov 2024, 06:18
30 Nov 2024, ~11:03

All are correct code with verified ☺️ So do correctly everyone
29 Nov 2024, 06:16
30 Nov 2024, ~11:03

using System; using System.Collections.Generic; class Program { static void Main() { int N = int.Parse(Console.ReadLine()); var graph = new Dictionary>(); var indegrees = new Dictionary(); for (int i = 0; i < N; i++) { var edge = Console.ReadLine().Split(); string from = edge[0]; string to = edge[1]; if (!graph.ContainsKey(from)) graph[from] = new List(); graph[from].Add(to); if (!indegrees.ContainsKey(from)) indegrees[from] = 0; if (!indegrees.ContainsKey(to)) indegrees[to] = 0; indegrees[to]++; } var words = Console.ReadLine().Split(); var levels = new Dictionary(); var queue = new Queue(); foreach (var node in indegrees.Keys) { if (indegrees[node] == 0) { levels[node] = 1; // Root level is 1 queue.Enqueue(node); } } while (queue.Count > 0) { var current = queue.Dequeue(); int currentLevel = levels[current]; if (graph.ContainsKey(current)) { foreach (var neighbor in graph[current]) { if (!levels.ContainsKey(neighbor)) { levels[neighbor] = currentLevel + 1; queue.Enqueue(neighbor); } indegrees[neighbor]--; if (indegrees[neighbor] == 0 && !levels.ContainsKey(neighbor)) { queue.Enqueue(neighbor); } } } } int totalValue = 0; foreach (var word in words) { if (levels.ContainsKey(word)) { totalValue += levels[word]; } else { totalValue += -1; } } Console.Write(totalValue); } } String Puzzle C+
29 Nov 2024, 06:15
30 Nov 2024, ~11:03