uz
Feedback

Firibgarlarga uchmang! Telemetrio bunday kanallarni topadi va belgilaydi πŸ‘‰ Belgini koβ€˜rmoqchi boβ€˜lsangiz, obuna boβ€˜ling

ACCENTURE EXAM SOLUTIONS

ACCENTURE EXAM SOLUTIONS

Kanalga Telegram’da oβ€˜tish

πŸ”₯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

Ko'proq ko'rsatish

πŸ“ˆ Telegram kanali ACCENTURE EXAM SOLUTIONS analitikasi

ACCENTURE EXAM SOLUTIONS (@coding_are) Ingliz til segmentidagi kanali faol ishtirokchi. Hozirda hamjamiyat 13 833 obunachidan iborat bo'lib, TaΚΌlim toifasida 14 760-o'rinni va Hindiston mintaqasida 28 177-o'rinni egallagan.

πŸ“Š Auditoriya koβ€˜rsatkichlari va dinamika

Π½Π΅Π²Ρ–Π΄ΠΎΠΌΠΎ sanasidan buyon loyiha tez oβ€˜sib, 13 833 obunachiga ega boβ€˜ldi.

20 Noyabr, 2026 dagi oxirgi ma’lumotlarga koβ€˜ra kanal barqaror faollikka ega. Oxirgi 30 kunda obunachilar soni -171 ga, soβ€˜nggi 24 soatda esa 0 ga oβ€˜zgardi va umumiy qamrov yuqori darajada qolmoqda.

  • Tasdiqlash holati: Tasdiqlanmagan
  • Jalb etish (ER): Auditoriya oβ€˜rtacha 3.50% darajada jalb etiladi. Nashrdan keyingi dastlabki 24 soatda kontent odatda umumiy obunachilar sonining 1.07% ini tashkil etuvchi reaksiyalarni toβ€˜playdi.
  • Post qamrovi: Har bir post oβ€˜rtacha 484 marta koβ€˜riladi; birinchi sutkada odatda 148 ta koβ€˜rish yigβ€˜iladi.
  • Reaksiyalar va oβ€˜zaro ta’sir: Auditoriya faol: har bir postga oβ€˜rtacha 1 ta reaksiya keladi.
  • Tematik yoβ€˜nalishlar: Kontent placement, gaurntee, suree, capgemini, infosy kabi asosiy mavzularga jamlangan.

πŸ“ Tavsif va kontent siyosati

Muallif resursni shaxsiy fikrni ifoda etish maydoni sifatida ta’riflaydi:
β€œπŸ”₯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...”

Yuqori yangilanish chastotasi (oxirgi ma’lumot 21 Noyabr, 2026 da olingan) sababli kanal doimo dolzarb va katta qamrovli boβ€˜lib qoladi. Analitika auditoriya kontent bilan faol hamkorlik qilishini, uni TaΚΌlim toifasidagi muhim ta’sir nuqtasiga aylantirishini koβ€˜rsatadi.

13 833
Obunachilar
Ma'lumot yo'q24 soatlar
-397 kun
-17130 kun
Postlar arxiv
Those who want help in Capgemini exam Accenture communication Cognizant cis role Accenture exam Amazon's Any off campus or on campus exam help available, Contact fast and book your slots Contact @srksvk 200% sure clearance grauntee πŸ”₯ Remote access also available all exams
20 Noy 2024, 12:34
20 Noy 2024, ~14:48

Got selected in capgemini πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯ Ctc- 7.5lpa Congratulations brooo πŸŽ‰ πŸŽ‰ πŸŽ‰ πŸŽ‰ πŸŽ‰ πŸŽ‰ πŸŽ‰
+1
Got selected in capgemini πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯ Ctc- 7.5lpa Congratulations brooo πŸŽ‰ πŸŽ‰ πŸŽ‰ πŸŽ‰ πŸŽ‰ πŸŽ‰ πŸŽ‰ πŸŽ‰ πŸŽ‰ Helped proof πŸ‘‡ πŸ‘‡ πŸ‘‡ πŸ‘‡ πŸ‘‡ πŸ‘‡ πŸ‘‡ https://t.me/codeing_are/11104?single Contact for placement exam @srksvk
20 Noy 2024, 11:03

Kickdrum exam successfully completed by Remote access πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯ 2/2 code with all tests caes passed πŸ”₯πŸ”₯πŸ”₯πŸ”₯ 15/15 MCQ don
+1
Kickdrum exam successfully completed by Remote access πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯ 2/2 code with all tests caes passed πŸ”₯πŸ”₯πŸ”₯πŸ”₯ 15/15 MCQ done with πŸ’―correct answer Slot 1
20 Noy 2024, 09:50

Kickdrum exam successfully completed by Remote access πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯ 2/2 code with all tests caes passed πŸ”₯πŸ”₯πŸ”₯πŸ”₯ 15/15 MCQ don
+1
Kickdrum exam successfully completed by Remote access πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯ 2/2 code with all tests caes passed πŸ”₯πŸ”₯πŸ”₯πŸ”₯ 15/15 MCQ done with πŸ’―correct answer Slot 1
20 Noy 2024, 09:28

Those who want help in Capgemini exam Accenture communication Cognizant cis role Accenture exam Amazon's Any off campus or on campus exam help available, Contact fast and book your slots Contact @srksvk 200% sure clearance grauntee πŸ”₯ Remote access also available all exams
19 Noy 2024, 23:59

Amazon Exam successfully done by Remote access πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯ 2/2 code done with all tests caes passed πŸ”₯πŸ”₯πŸ”₯πŸ”₯ Contact for p
+1
Amazon Exam successfully done by Remote access πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯ 2/2 code done with all tests caes passed πŸ”₯πŸ”₯πŸ”₯πŸ”₯ Contact for placement exam @srksvk
19 Noy 2024, 11:20

Those who want help in Deloitte communication Cognizant cis role Accenture exam Amazon's e Any off campus or on campus exam help available, Contact fast and book your slots Contact @srksvk
200% sure clearance grauntee πŸ”₯
Remote access also available all exams
18 Noy 2024, 22:58

coddle technologies exam help successfully completed by Remote access πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯ 1/1 code done with all tets caes passed
coddle technologies exam help successfully completed by Remote access πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯ 1/1 code done with all tets caes passed πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯ Contact for placement exam @srksvk
18 Noy 2024, 11:56

Microsoft interview successfully completed by Remote access to πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯ All answers provided on time βœ…βœ…βœ… with πŸ’―% corre
+5
Microsoft interview successfully completed by Remote access to πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯ All answers provided on time βœ…βœ…βœ… with πŸ’―% correct answer πŸ”₯πŸ”₯πŸ”₯ Contact for placement exam @srksvk
18 Noy 2024, 04:12

Oracle exam successfully completed by Remote access πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯ 1 code + 1 SQL done with all tets caes passed πŸ”₯πŸ”₯πŸ”₯πŸ”₯ Con
+1
Oracle exam successfully completed by Remote access πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯ 1 code + 1 SQL done with all tets caes passed πŸ”₯πŸ”₯πŸ”₯πŸ”₯ Contact for placement exam @srksvk
17 Noy 2024, 05:49

Oracle exam successfully completed by Remote access πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯ 1 code + 1 SQL done with all tets caes passed πŸ”₯πŸ”₯πŸ”₯πŸ”₯ Con
+1
Oracle exam successfully completed by Remote access πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯ 1 code + 1 SQL done with all tets caes passed πŸ”₯πŸ”₯πŸ”₯πŸ”₯ Contact for placement exam @srksvk
17 Noy 2024, 05:48

IBM exam successfully completed by Remote access πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯ 2/2 code done with all tests caes passed πŸ”₯πŸ”₯πŸ”₯ Contact for p
+1
IBM exam successfully completed by Remote access πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯ 2/2 code done with all tests caes passed πŸ”₯πŸ”₯πŸ”₯ Contact for placement exam @srksvk
17 Noy 2024, 04:46

Accenture communication help successfully done by Remote access πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯ All sections done with πŸ’―% correct answer πŸ”₯πŸ”₯πŸ”₯πŸ”₯
+5
Accenture communication help successfully done by Remote access πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯ All sections done with πŸ’―% correct answer πŸ”₯πŸ”₯πŸ”₯πŸ”₯ Contact for placement exam @srksvk
16 Noy 2024, 12:38

Oracles exam successfully completed by Remote access to πŸ”₯πŸŽ‰πŸŽ‰πŸ”₯πŸŽ‰ 1 code + 35 mcq done with all tests caes passed πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯
Oracles exam successfully completed by Remote access to πŸ”₯πŸŽ‰πŸŽ‰πŸ”₯πŸŽ‰ 1 code + 35 mcq done with all tests caes passed πŸ”₯πŸ”₯πŸ”₯πŸ”₯πŸ”₯ Contact for placement exam @srksvk
16 Noy 2024, 12:35

https://t.me/codeing_are Share the group only .....βœ…βœ…βœ…βœ…βœ…βœ…βœ…
16 Noy 2024, 03:48

#include<bits/stdc++.h> using namespace std; int k, r, m, res = 0; vector<string> words; void solve(int i, vector<int>& lan, int cnt, const vector<string>& qw) { Β  if (i == (int)qw.size()) { Β Β Β  res = max(res, cnt); Β Β Β  return; Β  } Β  if (cnt + (int)(qw.size() - i) <= res) return; Β  for (int j = 0; j < r; j++) { Β Β Β  if (lan[j] == 0) { Β Β Β Β Β  lan[j] = qw[i].size(); Β Β Β Β Β  solve(i + 1, lan, cnt + 1, qw); Β Β Β Β Β  lan[j] = 0; Β Β Β Β Β  break; Β Β Β  } else if (lan[j] + 1 + (int)qw[i].size() <= m) { Β Β Β Β Β  lan[j] += 1 + qw[i].size(); Β Β Β Β Β  solve(i + 1, lan, cnt + 1, qw); Β Β Β Β Β  lan[j] -= 1 + qw[i].size(); Β Β Β  } Β  } Β  solve(i + 1, lan, cnt, qw); } int main() { Β  ios::sync_with_stdio(false); Β  cin.tie(0); Β  cin >> k; Β  words.resize(k); Β  for (auto& s : words) cin >> s; Β  cin >> r >> m; Β  vector<string> qw; Β  for (auto& s : words) if ((int)s.size() <= m) qw.push_back(s); Β  sort(qw.begin(), qw.end(), [&](const string& a, const string& b) -> bool { Β Β Β  if (a.size() != b.size()) return a.size() > b.size(); Β Β Β  return a < b; Β  }); Β  vector<int> lan(r, 0); Β  solve(0, lan, 0, qw); Β  cout << res; } faulty segment
16 Noy 2024, 03:48

Equation Puzzle Code C++ TCS int main() { string e1, e2; int r; cin >> e1 >> e2 >> r; // @codeing_are int a1, b1, c1, d1, n1, a2, b2, c2, d2, n2; sscanf(e1.c_str(), "%dx+%dy+%dz+%dw<=%d", &a1, &b1, &c1, &d1, &n1); sscanf(e2.c_str(), "%dx+%dy+%dz+%dw<=%d", &a2, &b2, &c2, &d2, &n2); vector<vector<int>> combinations; for (int x = 0; x <= r; x++) { for (int y = 0; y + x <= r; y++) { for (int z = 0; z + x + y <= r; z++) { int w = r - x - y - z; combinations.push_back({x, y, z, w}); } } } set<int> results; for (auto &vars1 : combinations) { int v1 = a1 * vars1[0] + b1 * vars1[1] + c1 * vars1[2] + d1 * vars1[3]; if (v1 > n1) continue; for (auto &vars2 : combinations) { int v2 = a2 * vars2[0] + b2 * vars2[1] + c2 * vars2[2] + d2 * vars2[3]; if (v2 > n2) continue; if (v1 == v2) results.insert(v1); } } cout << results.size() << endl; return 0; } Equation Puzzle Code C++ TCS
16 Noy 2024, 03:43

#include<bits/stdc++.h> using namespace std; using ll = long long; vector<string> read(){ Β Β Β  vector<string> strs; Β Β Β  string line; Β Β Β  getline(cin , line); Β Β Β  istringstream iss(line); Β Β Β  copy(istream_iterator<string>(iss), istream_iterator<string>(), back_inserter(strs)); Β Β Β  return strs; } map<string , vector<string>> graph; map<string , ll> mask , id; map<string , string> open; ll ans = 0; ll dfs1(string &u){ Β Β Β  ll curr = id.count(u) ? 1LL << id[u] : 0; Β Β Β  for(string &v : graph[u]) curr |= dfs1(v); Β Β Β  return mask[u] = curr; } void dfs2(string &u , int bit){ Β Β Β  if(id[u] == bit){ Β Β Β Β Β Β Β  open[u] = u; Β Β Β Β Β Β Β  return; Β Β Β  } Β Β Β  for(string &v : graph[u]){ Β Β Β Β Β Β Β  if(mask[v] >> bit & 1){ Β Β Β Β Β Β Β Β Β Β Β  if(open[u] != v) ans++ , open[u] = v; Β Β Β Β Β Β Β Β Β Β Β  return dfs2(v , bit); Β Β Β Β Β Β Β  } Β Β Β  } } int main(){ Β Β Β  ll N ; cin >> N; Β Β Β  cin.ignore(); Β Β Β  while(N--){ Β Β Β Β Β Β Β  vector<string> children = read(); Β Β Β Β Β Β Β  reverse(children.begin() , children.end()); Β Β Β Β Β Β Β  string parent = children.back(); Β Β Β Β Β Β Β  children.pop_back(); Β Β Β Β Β Β Β  graph[parent] = children; Β Β Β  } Β Β Β  ll cid = 0; Β Β Β  vector<string> colors = read(); Β Β Β  for(string &color : colors) if(!id.count(color)) id[color] = ++cid; Β Β Β  string u = "source"; Β Β Β  dfs1(u); Β Β Β  for(string &color : colors) dfs2(u , id[color]); Β Β Β  cout << ans; Β Β Β  return 0; } Route the balls
16 Noy 2024, 03:41

photo content
16 Noy 2024, 03:34

https://t.me/codeing_are Share the group only .....βœ…βœ…βœ…βœ…βœ…βœ…βœ…
16 Noy 2024, 03:32