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 loded πŸ‘‡πŸ‘‡πŸ‘‡πŸ‘‡πŸ‘‡ Join fast guys
15 Nov 2024, 12:40

Only share my group everyone βœ…πŸ˜žπŸ˜žπŸ˜ž https://t.me/codeing_are
15 Nov 2024, 12:38

I will upload only correct answer πŸ”₯πŸ”₯πŸ”₯πŸ”₯
15 Nov 2024, 12:37

Please share my group for free answer
15 Nov 2024, 12:37

Hiii everyone If you want more TCS code vitaa free answer Then share my answer in big groups https://t.me/codeing_are Join the group I will upload each every answer in free
15 Nov 2024, 12:37

Changes variable
15 Nov 2024, 12:32

Full accepted ☺️
15 Nov 2024, 12:32

photo content
15 Nov 2024, 12:32

photo content
15 Nov 2024, 12:32

\#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) ((int)a.size()) #define YES cout << "YES"; #define NO cout << "NO"; #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 game { int start; int end; string type; }; bool solve(vector<int>& dieRolls, unordered_map<int, int>& board, int finalPos) { int position = 1; for (int roll : dieRolls) { if (position + roll <= 100) { position += roll; } while (board.find(position) != board.end()) { position = board[position]; } } if (board.find(position) != board.end()) { return false; } return position == finalPos; } void solve() { int N; cin >> N; vector<game> snakesLadders; unordered_map<int, int> board; for (int i = 0; i < N; ++i) { int start, end; cin >> start >> end; game sl; sl.start = start; sl.end = end; if (start > end) { sl.type = "Snake"; } else { sl.type = "Ladder"; } snakesLadders.push_back(sl); board[start] = end; } vector<int> remainingInput; int num; while (cin >> num) { remainingInput.push_back(num); } if (remainingInput.empty()) { cout << "Not reachable"; return; } int finalPos = remainingInput.back(); remainingInput.pop_back(); vector<int> dieRolls = remainingInput; if (solve(dieRolls, board, finalPos)) { cout << "Not affected"; return; } for (size_t i = 0; i < snakesLadders.size(); ++i) { game& sl = snakesLadders[i]; board.erase(sl.start); int newStart = sl.end; int newEnd = sl.start; string newType = (sl.type == "Snake") ? "Ladder" : "Snake"; if (newStart == 1 || board.find(newStart) != board.end()) { board[sl.start] = sl.end; continue; } board[newStart] = newEnd; if (solve(dieRolls, board, finalPos)) { cout << newType << " " << newStart << " " << newEnd; return ; } board.erase(newStart); board[sl.start] = sl.end; } cout << "Not reachable"; return ; } int32_t main() { int tc = 1; // cin >> tc; while (tc--) { solve(); } return 0; }
15 Nov 2024, 12:32

All fully accepted
15 Nov 2024, 12:29

from collections import defaultdict import sys def parse_recipes(n, recipes): graph = defaultdict(list) for recipe in recipes: potion, ingredients = recipe.split('=') graph[potion].append(ingredients.split('+')) return graph def min_orbs(target, graph, cache): if target in cache: return cache[target] if target not in graph: cache[target] = 0 return 0 min_cost = sys.maxsize for recipe in graph[target]: cost = len(recipe) - 1 for ingredient in recipe: cost += min_orbs(ingredient, graph, cache) min_cost = min(min_cost, cost) cache[target] = min_cost return min_cost n = int(input()) recipes = [input().strip() for _ in range(n)] target_potion = input().strip() graph = parse_recipes(n, recipes) cache = {} result = min_orbs(target_potion, graph, cache) print(result, end="") Frenkitsen wala Codevita
15 Nov 2024, 12:29

#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) ((int)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 Flight { string src; string to; int dt; int at; int cost; }; int parse_time(const string& time_str) { int hour = stoi(time_str.substr(0, 2)); int minute = stoi(time_str.substr(3, 2)); string am_pm = time_str.substr(5, 2); if (am_pm == "Am") { if (hour == 12) hour = 0; } else if (am_pm == "Pm") { if (hour != 12) hour += 12; } return hour * 60 + minute; } void solve() { int N; cin >> N; vector<Flight> fff(N); unordered_map<string, vector<Flight>> mp; for (int i = 0; i < N; ++i) { string src, to, des, arrival_str; int cost; cin >> src >> to >> des >> arrival_str >> cost; int dt = parse_time(des); int at = parse_time(arrival_str); Flight ff = {src, to, dt, at, cost}; fff[i] = ff; mp[src].push_back(ff); } string src, des; cin >> src >> des; string edes, last; cin >> edes >> last; int earliest_dt = parse_time(edes); int latest_at = parse_time(last); typedef tuple<int, int, string> State; priority_queue<State, vector<State>, greater<State>> pq; for (const auto& ff : mp[src]) { if (ff.dt >= earliest_dt) { if (ff.at <= latest_at) { pq.emplace(ff.cost, ff.at, ff.to); } } } unordered_map<string, int> ans; unordered_map<string, int> at; while (!pq.empty()) { int cost_so_far, current_at; string current_city; tie(cost_so_far, current_at, current_city) = pq.top(); pq.pop(); if (ans.find(current_city) != ans.end()) { if (cost_so_far > ans[current_city]) continue; if (cost_so_far == ans[current_city] && current_at >= at[current_city]) continue; } ans[current_city] = cost_so_far; at[current_city] = current_at; if (current_city == des) { cout << cost_so_far; return ; } for (const auto& ff : mp[current_city]) { if (ff.dt >= current_at) { if (ff.dt >= earliest_dt && ff.at <= latest_at) { int new_cost = cost_so_far + ff.cost; pq.emplace(new_cost, ff.at, ff.to); } } } } cout << "Impossible"; return ; } int32_t main() { int tc = 1; // cin >> tc; while (tc--) { solve(); } return 0; } // Flight Optimization TCS CodeVita accepted
15 Nov 2024, 12:25

Hiii everyone If you want more TCS code vitaa free answer Then share my answer in big groups https://t.me/codeing_are Join the group I will upload each every answer in free
15 Nov 2024, 12:13

TCS code vittaa
15 Nov 2024, 12:04

def minimum_moves(instruct): directions = ["up", "down", "left", "right"] s = len(instruct) dp = [[[float('inf')] * 4 for _ in range(4)] for _ in range(s + 1)] for i in range(4): for j in range(4): dp[0][i][j] = 0 for k in range(1, s + 1): instr_idx = directions.index(instruct[k - 1]) for i in range(4): for j in range(4): if dp[k - 1][i][j] != float('inf'): if instr_idx == i or instr_idx == j: dp[k][i][j] = min(dp[k][i][j], dp[k - 1][i][j]) else: dp[k][i][j] = min(dp[k][i][j], dp[k - 1][instr_idx][j] + 1, dp[k - 1][i][instr_idx] + 1) minimum_moves = float('inf') for i in range(4): for j in range(4): minimum_moves = min(minimum_moves, dp[s][i][j]) return minimum_moves if name == "main": m = int(input().strip()) instruct = [input().strip() for _ in range(m)] result = minimum_moves(instruct) print(result, end="") Dance rev 100% Working
15 Nov 2024, 12:04

7pm Accenture exam successfully completed by Remote access πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯ First' and 2nd round cleared πŸ”₯πŸ”₯πŸŽ‰πŸŽ‰πŸ”₯πŸ”₯πŸŽ‰ 2/2 c
+2
7pm Accenture exam successfully completed by Remote access πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯ First' and 2nd round cleared πŸ”₯πŸ”₯πŸŽ‰πŸŽ‰πŸ”₯πŸ”₯πŸŽ‰ 2/2 code passed with all tests caes passed πŸ”₯πŸ”₯πŸ”₯. Contact for placement exam @srksvk Slot 3
15 Nov 2024, 11:49

7pm Accenture exam successfully completed by Remote access πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯ First' and 2nd round cleared πŸ”₯πŸ”₯πŸŽ‰πŸŽ‰πŸ”₯πŸ”₯πŸŽ‰ 2/2 c
+2
7pm Accenture exam successfully completed by Remote access πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯ First' and 2nd round cleared πŸ”₯πŸ”₯πŸŽ‰πŸŽ‰πŸ”₯πŸ”₯πŸŽ‰ 2/2 code passed with all tests caes passed πŸ”₯πŸ”₯πŸ”₯. Contact for placement exam @srksvk Slot 2
15 Nov 2024, 11:45

7pm Accenture exam successfully completed by Remote access πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯ First' and 2nd round cleared πŸ”₯πŸ”₯πŸŽ‰πŸŽ‰πŸ”₯πŸ”₯πŸŽ‰ 2/2 c
+2
7pm Accenture exam successfully completed by Remote access πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯ First' and 2nd round cleared πŸ”₯πŸ”₯πŸŽ‰πŸŽ‰πŸ”₯πŸ”₯πŸŽ‰ 2/2 code passed with all tests caes passed πŸ”₯πŸ”₯πŸ”₯. Contact for placement exam @srksvk Slot 1
15 Nov 2024, 11:29

7pm one slot available Contact fast and book your slots Contact @srksvk 200% sure clearance grauntee
15 Nov 2024, 07:03