en
Feedback

Don't get caught by a cheater! Telemetrio finds and tags such channels πŸ‘‰ If you want to see the tag, subscribe

Code With Virus

Code With Virus

Open in Telegram

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

Show more

πŸ“ˆ Analytical overview of Telegram channel Code With Virus

Channel Code With Virus (@codewithvirus) in the English language segment is an active participant. Currently, the community unites 10 559 subscribers, ranking 10 501 in the Technologies & Applications category and 43 593 in the India region.

πŸ“Š Audience metrics and dynamics

Since its creation on Π½Π΅Π²Ρ–Π΄ΠΎΠΌΠΎ, the project has demonstrated rapid growth, gathering an audience of 10 559 subscribers.

According to the latest data from 04 December, 2025, the channel demonstrates stable activity. Although there has been a change in the number of participants by -87 over the last 30 days and by 0 over the last 24 hours, overall reach remains high.

  • Verification status: Not verified
  • Engagement rate (ER): The average audience engagement rate is 0%. Within the first 24 hours after publication, content typically collects N/A% reactions from the total number of subscribers.
  • Post reach: On average, each post receives 0 views. Within the first day, a publication typically gains 0 views.
  • Reactions and interaction: The audience actively supports content: the average number of reactions per post is 0.

πŸ“ Description and content policy

The author describes the resource as a platform for expressing subjective opinions:
β€œCoding channel @codewithvirus. πŸ‘ˆ Main group @avirustech πŸ‘ˆ Accenture @Accenturavirustech πŸ‘ˆ IBM. @IBMavirustech πŸ‘ˆ Tech Mahindra. @TechMavirustech πŸ‘ˆβ€

Thanks to the high frequency of updates (latest data received on 11 November, 2026), the channel maintains relevance and a high level of publication reach. Analytics show that the audience actively interacts with content, making it an important point of influence in the Technologies & Applications category.

10 559
Subscribers
No data24 hours
-227 days
-8730 days
Posts Archive
Amazon Music Runtime @codewithvirus Java
Amazon Music Runtime @codewithvirus Java
04 Jul 2021, 13:03

photo content
+1
04 Jul 2021, 13:03

photo content
+1
04 Jul 2021, 13:02

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

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

04 Jul 2021, 10:42

photo content
+2
04 Jul 2021, 10:10

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

photo content
03 Jul 2021, 13:59

photo content
03 Jul 2021, 13:59

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

photo content
+1
03 Jul 2021, 09:32

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

photo content
03 Jul 2021, 08:56

01 Jul 2021, 23:34

01 Jul 2021, 23:34

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

IBM hollow cylinder coding question solution. πŸ›’οΈπŸ›’οΈπŸ›’οΈπŸ›’οΈ C++ language @codewithvirus https://github.com/aakash416/CPP/blob/main/IBM_hollow_cylinder.cpp
01 Jul 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 Jun 2021, 03:56

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