Code With Virus
前往频道在 Telegram
Coding channel @codewithvirus. 👈 Main group @avirustech 👈 Accenture @Accenturavirustech 👈 IBM. @IBMavirustech 👈 Tech Mahindra. @TechMavirustech 👈
显示更多📈 Telegram 频道 Code With Virus 的分析概览
频道 Code With Virus (@codewithvirus) 英语 语言赛道中的 是活跃参与者。目前社区聚集了 10 559 名订阅者，在 技术与应用 类别中位列第 10 501，并在 印度 地区排名第 43 593 位。
📊 受众指标与增长动态
自 невідомо 创建以来，项目保持高速增长，吸引了 10 559 名订阅者。
根据 04 十二月, 2025 的最新数据，频道保持稳定运转。过去 30 天订阅人数变化为 -87，过去 24 小时变化为 0，整体触达仍然可观。
- 认证状态： 未认证
- 互动率 (ER)： 平均受众互动率为 0%。内容发布后 24 小时内通常能获得 N/A% 的反应，占订阅者总量。
- 帖子覆盖： 每篇帖子平均可获得 0 次浏览，首日通常累积 0 次浏览。
- 互动与反馈： 受众积极参与，单帖平均反应数为 0。
📝 描述与内容策略
作者将该频道定位为表达主观观点的平台：
“Coding channel @codewithvirus. 👈
Main group @avirustech 👈
Accenture @Accenturavirustech 👈
IBM. @IBMavirustech 👈
Tech Mahindra. @TechMavirustech 👈”
凭借高频更新（最新数据采集于 05 十二月, 2025），频道始终保持新鲜度与高覆盖。分析显示受众积极互动，使其成为 技术与应用 类别中的关键影响点。
10 559
订阅者
无数据24 小时
-227 天
-8730 天
帖子存档
10 559
You have TCS exam 🤔
You need help in coding 🤔
Don't Worry I'm here ✌️
Drop your coding question in our Main group make sure your coding question proper and visible 👍
🔥🔥 @avirustech. 🔥🔥
🔥🔥 @avirustech. 🔥🔥
🔥🔥 @avirustech. 🔥🔥
🔥🔥 @avirustech. 🔥🔥
🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴
10 559
You have TCS exam tomorrow 🤔
You need help in coding 🤔
Don't Worry I'm here ✌️
Drop your coding question in our Main group make sure your coding question proper and visible 👍
🔥🔥 @avirustech. 🔥🔥
🔥🔥 @avirustech. 🔥🔥
🔥🔥 @avirustech. 🔥🔥
🔥🔥 @avirustech. 🔥🔥
🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴
10 559
You have TCS exam tomorrow 🤔
You need help in coding 🤔
Don't Worry I'm here ✌️
Drop your coding question in our Main group make sure your coding question proper and visible 👍
🔥🔥 @avirustech. 🔥🔥
🔥🔥 @avirustech. 🔥🔥
🔥🔥 @avirustech. 🔥🔥
🔥🔥 @avirustech. 🔥🔥
🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴
10 559
You have Infosys SP and DSE exam on Monday ?? 🤔
You need help in coding then join our Infosys group
🔥🔥. @Infosyavirustech. 🔥🔥
🔥🔥. @Infosyavirustech. 🔥🔥
🔥🔥. @Infosyavirustech. 🔥🔥
🔥🔥. @Infosyavirustech. 🔥🔥
And drop your coding question in Infosys group make sure your coding question is visible and proper then I will help you 👍
10 559
You have joining on 27 January in TCS ?? 🤔
Then you should Join 27 January TCS group
🔥🔥. @tcs27Jan 🔥🔥
If you have joining on 27 January then you should Join otherwise please don't Join 👍
10 559
"Capgemini Off Campus Drives for 2019 and 2020 graduates in India" https://www.capgemini.com/in-en/careers/capgemini-exceller-off-campus-drive-for-2019-2020-graduates/
10 559
Codeforces 2.0’s directory - LeetCode PDFs
> Microsoft
> A Way to Practice Competitive Programming
> Adobe
> Amazon
> Apple
> Array
> C++
> DS & Algo
> Expedia
> Facebook
> Math
> Oracle
> Twitter
> Visa
> VMware
> Walmart
https://drive.google.com/folderview?id=1B6pRzacEGqjnVS3B8cglBvaLGfCdgLnl
10 559
Coding channel @codewithvirus. 👈
Main group @avirustech 🔴 👈
Accenture. @Accenturavirustech👈
IBM. @IBMavirustech 👈
Tech Mahindra. @TechMavirustech 👈
Infosys. @Infosyavirustech 👈
TCS. @TCSavirustech 👈
10 559
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static void main(String args[] ) throws Exception {
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
Scanner s = new Scanner(System.in);
int num = s.nextInt();
Fabric itte[] = new Fabric[num];
for(int i=0;i<num;i++)
{
int id = s.nextInt();
s.nextLine();
String name = s.nextLine();
int avlSt = s.nextInt();
double price = s.nextDouble();
itte[i] = new Fabric(id, name, avlSt,price);
}
s.nextLine();
String n = s.nextLine();
Fabric ans1 = findFabricWithMaximumPrice(itte);
Fabric ans2 = searchFabricByName(itte, n);
if(ans1!=null)
{
System.out.println("Id:"+ans1.getId());
System.out.println("name:"+ans1.getName());
System.out.println("availableStock:"+ans1.getStock());
System.out.println("price:"+ans1.getPrice());
}
else
System.out.println("No Fabric found with mentioned attribute.");
if(ans2!=null)
{
System.out.println("Id:"+ans2.getId());
System.out.println("name:"+ans2.getName());
System.out.println("availableStock:"+ans2.getStock());
System.out.println("price:"+ans2.getPrice());
}
else
System.out.println("No Fabric found with mentioned attribute.");
}
public static Fabric findFabricWithMaximumPrice(Fabric[] fabrics)
{
Fabric l=null;
double m=0;
for(int i=0;i<fabrics.length;i++)
{
if(fabrics[i].getPrice()>m)
{
m= fabrics[i].getPrice();
l=fabrics[i];
}
}
return l;
}
public static Fabric searchFabricByName(Fabric[] fabrics, String name)
{
Fabric b = null;
for(int i=0;i<fabrics.length;i++)
{
if(fabrics[i].getName().equalsIgnoreCase(name))
{
b= fabrics[i];
}
}
return b;
}
}
class Fabric
{
int id,stock;
String name;
double price;
public Fabric(int id,String name,int stock,double price)
{
this.id = id;
this.name = name;
this.stock = stock;
this.price = price;
}
public int getId()
{ return id; }
public String getName()
{ return name; }
public int getStock()
{ return stock; }
public double getPrice()
{ return price; }
}
10 559
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static void main(String args[] ) throws Exception {
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
Scanner s = new Scanner(System.in);
int num = s.nextInt();
Fabric itte[] = new Fabric[num];
for(int i=0;i<num;i++)
{
int id = s.nextInt();
s.nextLine();
String name = s.nextLine();
int avlSt = s.nextInt();
double price = s.nextDouble();
itte[i] = new Fabric(id, name, avlSt,price);
}
s.nextLine();
String n = s.nextLine();
Fabric ans1 = findFabricWithMaximumPrice(itte);
Fabric ans2 = searchFabricByName(itte, n);
if(ans1!=null)
{
System.out.println("Id:"+ans1.getId());
System.out.println("name:"+ans1.getName());
System.out.println("availableStock:"+ans
