ar
Feedback

لا تقع ضحية للمخادعين! تيليمتريو يكتشف ويُميّز هذه القنوات 👉 إذا كنت تريد رؤية العلامة، اشترك

ACCENTURE EXAM SOLUTIONS

ACCENTURE EXAM SOLUTIONS

الذهاب إلى القناة على 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

إظهار المزيد

📈 نظرة تحليلية على قناة تيليجرام ACCENTURE EXAM SOLUTIONS

تُعد قناة ACCENTURE EXAM SOLUTIONS (@coding_are) في القطاع اللغوي الإنكليزية لاعباً نشطاً. يضم المجتمع حالياً 13 821 مشتركاً، محتلاً المرتبة 14 764 في فئة التعليم والمرتبة 28 191 في منطقة الهند.

📊 مؤشرات الجمهور والحراك

منذ تأسيسه في невідомо، حقق المشروع نمواً سريعاً وجمع 13 821 مشتركاً.

بحسب آخر البيانات بتاريخ 21 نوفمبر, 2026، تحافظ القناة على نشاط مستقر. خلال آخر 30 يوماً تغيّر عدد الأعضاء بمقدار -183، وفي آخر 24 ساعة بمقدار -13، مع بقاء الوصول العام مرتفعاً.

  • حالة التحقق: غير موثّقة
  • معدل التفاعل (ER): يبلغ متوسط تفاعل الجمهور 3.52‎%. وخلال أول 24 ساعة من النشر يحصد المحتوى عادةً 1.18‎% من ردود الفعل نسبةً إلى إجمالي المشتركين.
  • وصول المنشورات: يحصل كل منشور على متوسط 487 مشاهدة. وخلال اليوم الأول يجمع عادةً 163 مشاهدة.
  • التفاعلات والاستجابة: يتفاعل الجمهور بانتظام؛ متوسط التفاعلات لكل منشور يبلغ 1.
  • الاهتمامات الموضوعية: يركز المحتوى على مواضيع رئيسية مثل placement, gaurntee, suree, capgemini, infosy.

📝 الوصف وسياسة المحتوى

يصف المؤلف القناة بأنها مساحة للتعبير عن الآراء الذاتية:
“🔥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...”

بفضل وتيرة التحديث المرتفعة (أحدث البيانات بتاريخ 22 نوفمبر, 2026) تحافظ القناة على حداثتها ومستوى وصول مرتفع. وتُظهر التحليلات تفاعلاً نشطاً من الجمهور، ما يجعلها نقطة تأثير مهمة ضمن فئة التعليم.

13 821
المشتركون
-1324 ساعات
-487 أيام
-18330 أيام
أرشيف المشاركات
Follow the Codeing_area( Srksvk) channel on WhatsApp: https://whatsapp.com/channel/0029VaicY2a65yD2YNehWP2j
Follow the Codeing_area( Srksvk) channel on WhatsApp: https://whatsapp.com/channel/0029VaicY2a65yD2YNehWP2j
04 سبتمبر 2025, 14:29

Flipkart assistant manager Hr round successfully completed by remote access 👍👍👍 All questions answer provided on time with
+5
Flipkart assistant manager Hr round successfully completed by remote access 👍👍👍 All questions answer provided on time with 💯 correct answer ✅ Contact for placement exam @srksvk
04 سبتمبر 2025, 05:23

Flipkart assistant manager 2nd round interview CLEARED 🎉🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳 Got mail for next round 🔥 Helped p
Flipkart assistant manager 2nd round interview CLEARED 🎉🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳 Got mail for next round 🔥 Helped proof 👇👇👇
04 سبتمبر 2025, 00:33

Cisco exam successfully completed by remote access 👍👍👍👍 2/2 code done with all tests case's passed 🔥 Contact for placeme
+1
Cisco exam successfully completed by remote access 👍👍👍👍 2/2 code done with all tests case's passed 🔥 Contact for placement exam @srksvk
03 سبتمبر 2025, 11:39

2nd (python 3)
03 سبتمبر 2025, 11:24

from collections import deque from typing import List, Dict, Tuple, Set class InputData: def init(self): self.connections: List[Tuple[int, int]] = [] self.costs: Dict[int, int] = {} self.values: Dict[int, int] = {} self.budget: int = 0 self.depth: int = 0 self.seed_order: List[int] = [] def read_input() -> InputData: data = InputData() n = int(input()) num_connections = int(input()) for _ in range(num_connections): u, v = map(int, input().split()) data.connections.append((u, v)) num_seeds = int(input()) for _ in range(num_seeds): user_id, cost = map(int, input().split()) data.costs[user_id] = cost data.seed_order.append(user_id) for i in range(1, n + 1): value = int(input()) data.values[i] = value data.budget, data.depth = map(int, input().split()) return data def bfs_reach(start: int, adj: List[List[int]], d: int) -> List[int]: visited: Set[int] = set() q = deque([(start, 0)]) visited.add(start) reach = [] while q: u, dist = q.popleft() reach.append(u) if dist == d: continue for v in adj[u]: if v not in visited: visited.add(v) q.append((v, dist + 1)) return reach def solve_campaign( connections: List[Tuple[int, int]], costs: Dict[int, int], values: Dict[int, int], seed_order: List[int], budget: int, d: int ) -> Tuple[List[int], int, int]: n = len(values) adj = [[] for _ in range(n + 1)] for u, v in connections: adj[u].append(v) adj[v].append(u) reach_map: Dict[int, List[int]] = {} for s in costs: reach_map[s] = bfs_reach(s, adj, d) chosen: List[int] = [] total_value = 0 total_cost = 0 covered: Set[int] = set() remaining = seed_order.copy() while True: best_eff = -1 best_seed = -1 best_gain = 0 best_cost = 0 for s in remaining: c = costs[s] if total_cost + c > budget: continue gain = 0 for u in reach_map[s]: if u not in covered: gain += values[u] if gain == 0: continue eff = gain / c if ( eff > best_eff or (eff == best_eff and seed_order.index(s) < seed_order.index(best_seed)) ): best_eff = eff best_seed = s best_gain = gain best_cost = c if best_seed == -1: break chosen.append(best_seed) total_cost += best_cost total_value += best_gain for u in reach_map[best_seed]: covered.add(u) remaining.remove(best_seed) return chosen, total_value, total_cost def main(): data = read_input() chosen, total_value, total_cost = solve_campaign( data.connections, data.costs, data.values, data.seed_order, data.budget, data.depth, ) print(" ".join(map(str, chosen))) print(total_value) print(total_cost) if name == "main": main()
03 سبتمبر 2025, 11:24

Puzzle Python 3 All tests caes passed ✅
03 سبتمبر 2025, 11:11

from typing import List, Set class Trie: def init(self): self.end = False self.next = {} def insert_word(root: Trie, word: str) -> None: cur = root for c in word: if c not in cur.next: cur.next[c] = Trie() cur = cur.next[c] cur.end = True dirs = [(1,0), (-1,0), (0,1), (0,-1), (1,1), (1,-1), (-1,1), (-1,-1)] def dfs(board: List[List[str]], x: int, y: int, node: Trie, path: List[str], res: Set[str]): c = board[x][y] if c not in node.next: return node = node.next[c] path.append(c) if node.end: res.add("".join(path)) board[x][y] = "#" for dx, dy in dirs: nx, ny = x + dx, y + dy if 0 <= nx < len(board) and 0 <= ny < len(board[0]) and board[nx][ny] != "#": dfs(board, nx, ny, node, path, res) board[x][y] = c path.pop() def solve_problem(rows: int, cols: int, board: List[List[str]], words: List[str]) -> None: root = Trie() for w in words: insert_word(root, w) found = set() path = [] for i in range(rows): for j in range(cols): dfs(board, i, j, root, path, found) if not found: print(0) return ans = sorted(found) print(len(ans)) for w in ans: print(w) if name == "main": R, C = map(int, input().split()) board = [list(input().strip().replace(" ", "")) for _ in range(R)] n = int(input()) words = [input().strip() for _ in range(n)] solve_problem(R, C, board, words)
03 سبتمبر 2025, 11:11

I will send Cisco code here https://t.me/coding_are Share your frd this group
03 سبتمبر 2025, 10:24

Cisco 8pm slots available Contact fast and book your SLOT Contact @srksvk 200% suree clearance gaurntee
03 سبتمبر 2025, 07:37

Flipkart assistant manager round 2 interview help successfully completed by remote access 👍👍👍♿♿ All answers provided on ti
+5
Flipkart assistant manager round 2 interview help successfully completed by remote access 👍👍👍♿♿ All answers provided on time with 💯 correct answer ✅ Contact for placement exam @srksvk
03 سبتمبر 2025, 06:53

Mitel Communications Private interview successfully completed by remote access 👍👍👍 All answers provided on time with 💯% c
+5
Mitel Communications Private interview successfully completed by remote access 👍👍👍 All answers provided on time with 💯% correct answer ✅✅ Contact for placement exam @srksvk
03 سبتمبر 2025, 05:25

Amazon sde exam successfully completed by remote access 👍👍👍♿♿♿ 2/2 code passed with all tests caes passed ✅✅ Contact for p
+2
Amazon sde exam successfully completed by remote access 👍👍👍♿♿♿ 2/2 code passed with all tests caes passed ✅✅ Contact for placement exam @srksvk
03 سبتمبر 2025, 05:19

Flipkart assistant manager first round interview CLEARED 🎉🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳 Helped proof 👇👇👇👇 https Contact for
Flipkart assistant manager first round interview CLEARED 🎉🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳 Helped proof 👇👇👇👇 https Contact for placement exam @srksvk
03 سبتمبر 2025, 01:22

Uber Cisco, Amazon Any off campus or on campus exam  help available Contact fast and book your slots Contact @srksvk 200% suree clearance grauntee 🔥   Remote access available All company interview help available with sure clearance gaurntee
02 سبتمبر 2025, 14:00

2pm Wipro interview help successfully completed by remote access 👍👍👍👍👍 All answers provided on time with 💯% correct ans
+5
2pm Wipro interview help successfully completed by remote access 👍👍👍👍👍 All answers provided on time with 💯% correct answer ✅✅ Contact for placement exam @srksvk 200% suree clearance gaurntee ✅
02 سبتمبر 2025, 06:42

Flipkart assistant manager exam successfully completed by remote access 👍👍👍👍 All answers provided on time with 💯% correc
+5
Flipkart assistant manager exam successfully completed by remote access 👍👍👍👍 All answers provided on time with 💯% correct answer ✅ Contact for placement exam @srksvk
02 سبتمبر 2025, 01:57

Apple Cisco, Amazon
Any off campus or on campus exam  help available
Contact fast and book your slots Contact @srksvk
200% suree clearance grauntee
🔥   Remote access available All company interview help available with sure clearance gaurntee
01 سبتمبر 2025, 23:54

Amazon wow exam successfully completed by remote access 👍👍👍👍👍 All MCQ done with 💯% correct answer ✅✅.. 1/1 code done wi
+1
Amazon wow exam successfully completed by remote access 👍👍👍👍👍 All MCQ done with 💯% correct answer ✅✅.. 1/1 code done with all tests caes passed ✅ Contact for placement exam @srksvk
01 سبتمبر 2025, 12:18

Apple Cisco COGNIZANT, Amazon Wipro Principal global services Capgemini Microsoft Any off campus or on campus exam  help available Contact fast and book your slots Contact @srksvk 200% suree clearance grauntee 🔥   Remote access available All company interview help available with sure clearance gaurntee
01 سبتمبر 2025, 05:44