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

πŸ“ˆ 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 11 Noyabr, 2026 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
Amazon Music Runtime @codewithvirus Java
Amazon Music Runtime @codewithvirus Java
04 Iyul 2021, 13:03

photo content
+1
04 Iyul 2021, 13:03

photo content
+1
04 Iyul 2021, 13:02

Amazon Prime order prioritisation @codewithvirus Java
+1
Amazon Prime order prioritisation @codewithvirus Java
04 Iyul 2021, 13:02

Code plz
+2
Code plz
04 Iyul 2021, 13:02

04 Iyul 2021, 10:42

photo content
+2
04 Iyul 2021, 10:10

@codewithvirus Vacation distribution C++ language Siemens
@codewithvirus Vacation distribution C++ language Siemens
03 Iyul 2021, 15:00

photo content
03 Iyul 2021, 13:59

photo content
03 Iyul 2021, 13:59

C++ language @codewithvirus
+1
C++ language @codewithvirus
03 Iyul 2021, 09:33

photo content
+1
03 Iyul 2021, 09:32

Java all test case passed @codewithvirus
Java all test case passed @codewithvirus
03 Iyul 2021, 08:56

photo content
03 Iyul 2021, 08:56

01 Iyul 2021, 23:34

01 Iyul 2021, 23:34

IBM Find the Running Distance πŸƒπŸƒπŸƒπŸƒπŸƒπŸƒ @codewithvirus https://github.com/aakash416/CPP/blob/main/IBM_Find_the_Running_Distance.cpp
01 Iyul 2021, 23:34

IBM hollow cylinder coding question solution. πŸ›’οΈπŸ›’οΈπŸ›’οΈπŸ›’οΈ C++ language @codewithvirus https://github.com/aakash416/CPP/blob/main/IBM_hollow_cylinder.cpp
01 Iyul 2021, 23:34

#include<bits/stdc++.h> using namespace std; #define ll long long int vector<int> g[1001]; vector<pair<ll,vector<ll>>> pt; void dfs(ll st,ll e,ll vis[],vector<ll> rs,ll w){ rs.push_back(st); if(st == e){ pt.push_back({w*(rs.size()-1),rs}); return; } for(auto u : g[st]){ if(vis[u] == 0){ vis[st] = 1; dfs(u,e,vis,rs,w); vis[st] = 0; } } } int main() { ll n,m,t,c,u,v; cin>>n>>m>>t>>c; while(m--){ cin>>u>>v; g[u].push_back(v); g[v].push_back(u); } vector<ll> rs; ll w = c; ll vis[n+1] = {0}; dfs(1,n,vis,rs,w); sort(pt.begin(),pt.end()); vector<ll> rt[n+1]; for(int i=0;i<pt.size();i++){ ll nes = pt[i].second.size(); for(auto u : pt[i].second){ rt[u].push_back(nes); } } ll trt[n+1] = {0}; trt[1] = 1; trt[n] = 1; for(int i=2;i<=n-1;i++){ if(rt[i].size() > 0){ ll tm = rt[i][0]; ll up = upper_bound(rt[i].begin(),rt[i].end(),tm) - rt[i].begin(); trt[i] = up; } } for(int i=1;i<=n;i++) cout<<trt[i]<<" "; return 0; } @codewithvirus
30 Iyun 2021, 03:56

Juspay round 2 coding question solution Python @codewithvirus
+1
Juspay round 2 coding question solution Python @codewithvirus
30 Iyun 2021, 02:11