uz
Feedback

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

Code With Virus

Code With Virus

Kanalga Telegram’da oβ€˜tish

Coding channel @codewithvirus. πŸ‘ˆ Main group @avirustech πŸ‘ˆ Accenture @Accenturavirustech πŸ‘ˆ IBM. @IBMavirustech πŸ‘ˆ Tech Mahindra. @TechMavirustech πŸ‘ˆ

Ko'proq ko'rsatish
Hindiston43 593Texnologiyalar & Aralashmalar10 501

πŸ“ˆ Telegram kanali Code With Virus analitikasi

Code With Virus (@codewithvirus) Ingliz til segmentidagi kanali faol ishtirokchi. Hozirda hamjamiyat 10 559 obunachidan iborat bo'lib, Texnologiyalar & Aralashmalar toifasida 10 501-o'rinni va Hindiston mintaqasida 43 593-o'rinni egallagan.

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

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

04 Dekabr, 2025 dagi oxirgi ma’lumotlarga koβ€˜ra kanal barqaror faollikka ega. Oxirgi 30 kunda obunachilar soni -87 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 0% darajada jalb etiladi. Nashrdan keyingi dastlabki 24 soatda kontent odatda umumiy obunachilar sonining N/A% ini tashkil etuvchi reaksiyalarni toβ€˜playdi.
  • Post qamrovi: Har bir post oβ€˜rtacha 0 marta koβ€˜riladi; birinchi sutkada odatda 0 ta koβ€˜rish yigβ€˜iladi.
  • Reaksiyalar va oβ€˜zaro ta’sir: Auditoriya faol: har bir postga oβ€˜rtacha 0 ta reaksiya keladi.

πŸ“ Tavsif va kontent siyosati

Muallif resursni shaxsiy fikrni ifoda etish maydoni sifatida ta’riflaydi:
β€œCoding channel @codewithvirus. πŸ‘ˆ Main group @avirustech πŸ‘ˆ Accenture @Accenturavirustech πŸ‘ˆ IBM. @IBMavirustech πŸ‘ˆ Tech Mahindra. @TechMavirustech πŸ‘ˆβ€

Yuqori yangilanish chastotasi (oxirgi ma’lumot 05 Dekabr, 2025 da olingan) sababli kanal doimo dolzarb va katta qamrovli boβ€˜lib qoladi. Analitika auditoriya kontent bilan faol hamkorlik qilishini, uni Texnologiyalar & Aralashmalar toifasidagi muhim ta’sir nuqtasiga aylantirishini koβ€˜rsatadi.

10 559
Obunachilar
Ma'lumot yo'q24 soatlar
-227 kun
-8730 kun
Postlar arxiv
Code With Virus
Code With Virus
10 559

Code With Virus
Code With Virus
10 559

Code With Virus
Code With Virus
10 559

Code With Virus
Code With Virus
10 559

Code With Virus
Code With Virus
10 559

Code With Virus
Code With Virus
10 559

Code With Virus
Code With Virus
10 559

Code With Virus
Code With Virus
10 559

Code With Virus
Code With Virus
10 559
myCode(str) code in java @codewithvirus. πŸ‘ˆ @codewithvirus. πŸ‘ˆ @codewithvirus. πŸ‘ˆ @codewithvirus. πŸ‘ˆ
+2
myCode(str) code in java @codewithvirus. πŸ‘ˆ @codewithvirus. πŸ‘ˆ @codewithvirus. πŸ‘ˆ @codewithvirus. πŸ‘ˆ

Code With Virus
Code With Virus
10 559
MyCode(str) code in java
+2
MyCode(str) code in java

Code With Virus
Code With Virus
10 559

Code With Virus
Code With Virus
10 559

Code With Virus
Code With Virus
10 559

Code With Virus
Code With Virus
10 559
// jusPay 3rd code int solve(vector& maze) { int n=maze.size(); int maxSum=-1; for(int i=0; i visited; while(node < n && node >= 0 && i!=maze[node] && visited.count(node)==0) { visited.insert(node); sum+=node; node=maze[node]; } if(node>=0 && node < n && i == maze[node]) { maxSum=max(maxSum,sum); } } return maxSum; }

Code With Virus
Code With Virus
10 559
// jusPay 2nd code int solution(vector arr) { int ans = INT_MIN; int result = -1; vector weight(arr.size(), 0); for (int i = 0; i < arr.size(); i++) { int source = i; int dest = arr[i]; if (dest != -1) { weight[dest] += source; if (ans <= weight[dest]) { ans = max(ans, weight[dest]); result = dest; } } } if (ans != INT_MIN) return result; return -1; }

Code With Virus
Code With Virus
10 559
// jusPay 2nd code int solve(vector& maze,int n) { int maxSum=-1; for(int i=0; i visited; while(node < n && node >= 0 && i!=maze[node] && visited.count(node)==0) { visited.insert(node); sum+=node; node=maze[node]; } if(node>=0 && node < n && i == maze[node]) { maxSum=max(maxSum,sum); } } return maxSum; }

Code With Virus
Code With Virus
10 559
// jusPay 1st code public static int Solution(int[] arr, int C1, int C2) { int[] dist = new int[arr.length]; int max = Integer.MAX_VALUE; Arrays.fill(dist, Integer.MAX_VALUE); Queue q = new ArrayDeque<>(); int dis = -1; q.offer(c1); q.offer(max); boolean[] visited = new boolean[arr.length]; while (q.size() > 1) { int vtx = q.poll(); if (vtx == max) { q.offer(vtx); dis++; continue; } visited[vtx] = true; dist[vtx] = Math.min(dis + 1, dist[vtx]); int neigh = arr[vtx]; if (visited[neigh] == false) { q.offer(neigh); } } Arrays.fill(visited, false); q.poll(); q.offer(C2); q.offer(max); int ans = -1; while (q.size() > 1) { int vtx = q.poll(); if (vtx == max) { q.offer(vtx); dis++; continue; } if (visited[vtx] == false && dist[vtx] != max) { ans = vtx; break; } visited[vtx] = true; int neigh = arr[vtx]; if (visited[neigh] == false) { q.offer(neigh); } } return ans; }

Code With Virus
Code With Virus
10 559
You have on campus Juspay exam ?? Tell me which college form you are mm

Code With Virus
Code With Virus
10 559

Code With Virus
Code With Virus
10 559