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 835 obunachidan iborat bo'lib, Taʼlim toifasida 14 761-o'rinni va Hindiston mintaqasida 28 197-o'rinni egallagan.

📊 Auditoriya ko‘rsatkichlari va dinamika

невідомо sanasidan buyon loyiha tez o‘sib, 13 835 obunachiga ega bo‘ldi.

19 Noyabr, 2026 dagi oxirgi ma’lumotlarga ko‘ra kanal barqaror faollikka ega. Oxirgi 30 kunda obunachilar soni -179 ga, so‘nggi 24 soatda esa -11 ga o‘zgardi va umumiy qamrov yuqori darajada qolmoqda.

  • Tasdiqlash holati: Tasdiqlanmagan
  • Jalb etish (ER): Auditoriya o‘rtacha 3.43% darajada jalb etiladi. Nashrdan keyingi dastlabki 24 soatda kontent odatda umumiy obunachilar sonining 1.12% ini tashkil etuvchi reaksiyalarni to‘playdi.
  • Post qamrovi: Har bir post o‘rtacha 474 marta ko‘riladi; birinchi sutkada odatda 155 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 20 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 835
Obunachilar
-1124 soatlar
-467 kun
-17930 kun
Postlar arxiv
26 April Infosys exam successfully completed by remote access 👍👍👍👍 5/5 slot done with all tests cases passed ✅✅ Contact f
+8
26 April Infosys exam successfully completed by remote access 👍👍👍👍 5/5 slot done with all tests cases passed ✅✅ Contact for placement exam @srksvk
30 Apr, 02:50

Next code in 5 min
26 Apr, 05:20

Everyone
26 Apr, 05:17

Now share this group
26 Apr, 05:17

https://t.me/coding_are Share this group ✅
26 Apr, 05:16

import sys input = sys.stdin.readline def solve(N: int, C1: int, C2: int, C3: int, penalties: list) -> int: INF = 10**30 dp = [INF] * (N + 1) dp[0] = 0 for i in range(1, N + 1): dp[i] = min(dp[i], dp[i - 1] + C1 + penalties[i - 1]) if i >= 2: dp[i] = min(dp[i], dp[i - 2] + C2 + penalties[i - 2]) if i >= 3: dp[i] = min(dp[i], dp[i - 3] + C3 + penalties[i - 3]) return dp[N]
26 Apr, 05:16

import java.util.*;

class Main {

public static int solve(int n,int k,int[] v,int[] w){

long sumA=0,sumB=0;
ArrayList<Integer> list=new ArrayList<>();

for(int i=0;i<n;i++){
if(v[i]==1)sumA+=w[i];
else sumB+=w[i];
list.add(w[i]);
}

if(sumA>sumB)return 0;

Collections.sort(list,Collections.reverseOrder());

int ops=0;

for(int x:list){
if(ops==k)break;
sumA+=x;
sumB-=x;
ops++;
if(sumA>sumB)return ops;
}

return -1;
}

public static void main(String[] args){
Scanner sc=new Scanner(System.in);

int n=sc.nextInt();
int k=sc.nextInt();

int[] v=new int[n];
for(int i=0;i<n;i++)v[i]=sc.nextInt();

int[] w=new int[n];
for(int i=0;i<n;i++)w[i]=sc.nextInt();

System.out.println(solve(n,k,v,w));
}
}
26 Apr, 05:16

Go through function name
26 Apr, 05:16

long long solve(int n,int low,int high,vector<int>& arr){ long long res=0,cur=0,MOD=1000000007; for(int i=0;i<n;i++){ if(arr[i]>=low && arr[i]<=high){ cur++; }else{ res=(res + (cur*(cur+1))/2)%MOD; cur=0; } } res=(res + (cur*(cur+1))/2)%MOD; return res; }
26 Apr, 05:15

Ready ♥️
26 Apr, 04:05

2pm slot available Contact @srksvk
26 Apr, 03:37

https://t.me/coding_are Share this group ✅
26 Apr, 01:38

import sys NEG_INF = -10**18 def solve(N: int, B: int, a: list) -> int: pos = NEG_INF neg = NEG_INF for x in a: if x > 0: pos = max(pos, x, neg + x + B) else: neg = max(neg, x, pos + x + B) return max(0, pos, neg) if name == "main": data = list(map(int, sys.stdin.read().split())) N = data[0] B = data[1] a = data[2:2+N] print(solve(N, B, a))
26 Apr, 01:37

https://t.me/coding_are Share this group with your friends and college group.. I will upload next answer in 5min
26 Apr, 01:34

All passed ✅ import sys from collections import Counter def solve(N: int, C: int, A: list, W: list) -> int: mp = {} comp = [] for x in A: if x not in mp: mp[x] = len(mp) comp.append(mp[x]) A = comp freq = Counter(A) ans = max(W) B = 700 max_light = 1 for f in freq.values(): if f <= B and f > max_light: max_light = f max_len = min(N, 2 * max_light - 1) cnt = [0] * (len(mp) + 1) for l in range(N): total = 0 mx = 0 touched = [] end = min(N, l + max_len) for r in range(l, end): x = A[r] total += W[r] if cnt[x] == 0: touched.append(x) cnt[x] += 1 if cnt[x] > mx: mx = cnt[x] if mx * 2 > r - l + 1 and total > ans: ans = total for x in touched: cnt[x] = 0 heavy = [x for x, f in freq.items() if f > B] size = 2 * N + 5 off = N + 2 INF = 10**30 for cat in heavy: bit = [INF] * (size + 2) def update(i, val): while i <= size: if val < bit[i]: bit[i] = val i += i & -i def query(i): res = INF while i > 0: if bit[i] < res: res = bit[i] i -= i & -i return res bal = 0 pref = 0 update(off, 0) for i in range(N): pref += W[i] if A[i] == cat: bal += 1 else: bal -= 1 best = query(bal + off - 1) if best != INF: val = pref - best if val > ans: ans = val update(bal + off, pref) return ans if name == "main": data = list(map(int, sys.stdin.read().split())) idx = 0 N = data[idx]; idx += 1 C = data[idx]; idx += 1 A = data[idx:idx + N]; idx += N W = data[idx:idx + N] print(solve(N, C, A, W)) All passed ✅
26 Apr, 01:33

import sys from collections import deque input = sys.stdin.readline def solve(N: int, F: int, MAX: int, s: list) -> int: limit = min(N, F + 1) dp = [-10**30] * limit dp[0] = s[0] dq = deque([0]) ans = dp[0] for i in range(1, limit): while dq and dq[0] < i - MAX: dq.popleft() dp[i] = s[i] + dp[dq[0]] ans = max(ans, dp[i]) while dq and dp[dq[-1]] <= dp[i]: dq.pop() dq.append(i) return ans if name == "main": data = list(map(int, sys.stdin.read().split())) idx = 0 N = data[idx]; idx += 1 F = data[idx]; idx += 1 MAX = data[idx]; idx += 1 s = data[idx:idx + N] print(solve(N, F, MAX, s))
26 Apr, 01:32

Next answer in 5min Give ♥️
26 Apr, 01:27

https://t.me/coding_are Share this group with your friends and college group.. I will upload next answer in 5min
26 Apr, 01:24

Check function name then write
26 Apr, 01:21

import sys sys.setrecursionlimit(2000) input = sys.stdin.read def solve(N: int, S: str, w: list) -> int: if N == 0: return 0 dp = [[0] * N for _ in range(N)] for i in range(N): dp[i][i] = w[i] for length in range(2, N + 1): for i in range(N - length + 1): j = i + length - 1 if S[i] == S[j]: if length == 2: dp[i][j] = w[i] + w[j] else: dp[i][j] = dp[i+1][j-1] + w[i] + w[j] else: dp[i][j] = max(dp[i+1][j], dp[i][j-1]) return dp[0][N-1] if name == "main": data = input().split() if data: N = int(data[0]) S = data[1] w = list(map(int, data[2:])) result = solve(N, S, w) print(result)
26 Apr, 01:21