不要被骗子欺骗！Telemetrio 会找到并标记这些频道 👉 如果想查看标记，请订阅

Code With Virus

前往频道在 Telegram

Coding channel @codewithvirus. 👈 Main group @avirustech 👈 Accenture @Accenturavirustech 👈 IBM. @IBMavirustech 👈 Tech Mahindra. @TechMavirustech 👈

显示更多

印度43 593技术与应用10 501...

📈 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 天

无数据

帖子浏览量

无数据24 小时

无数据48 小时

无数据

参与率

无数据

每日帖子数

Ads index

帖子存档

10 559

Or same karo same question

10 559

Don't send question pic guys I Also Don't want to post solution

10 559

During a exam if you faced any error then don't text in group Like I get error Directly show me your error PIC Then i will understand where you get error

10 559

Gus start your exam and fill your all details

10 559

And if you don't know How to pass open test case then don't Worry Send me proper question with input and output make sure your questions is visible for me 🔥

10 559

If you want to qualify IBM coding exam then just try to pass open test case That's it's if you passed all open test case and your at least 3 test case passed then you are eligible for next round 🔥

10 559

How many people today have IBM exam ? 🤔

10 559

You have IBM exam on 18 May 🤔 you need help in coding section Then Join our IBM group 🔥🔥 @IBMavirustech 🔥🔥 🔥🔥 @IBMavirustech 🔥🔥 🔥🔥 @IBMavirustech 🔥🔥 🔥🔥 @IBMavirustech 🔥🔥 🔥🔥 @IBMavirustech 🔥🔥 🔥🔥 @IBMavirustech 🔥🔥 🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴

10 559

Coding channel @codewithvirus. 👈 Main group @avirustech 🔴 👈 Accenture. @Accenturavirustech👈 IBM. @IBMavirustech 👈 Tech Mahindra. @TechMavirustech 👈 Infosys. @Infosyavirustech 👈 TCS. @TCSavirustech 👈 Amazon. @Amazonavirustech 👈

10 559

https://amazonwowindia.splashthat.com/

10 559

https://amazonindiasde.splashthat.com/

10 559

/* There are N people standing in a circle. On every pass, the kth person was killed. This cycle continues till only one person remains alive. Find out the alive person. TC -> o(N) SC -> o(N) */ #include <bits/stdc++.h> using namespace std; void alive_last_person(vector<int> person, int kth_number_killed, int index) { if (person.size() == 1) { cout << person[0]; return; } // finding in vector which person killed first index = ((index + kth_number_killed) % person.size()); // removing first person which personl killed first person.erase(person.begin() + index); // here im using recursive call for number_of_person -1 alive_last_person(person, kth_number_killed, index); } int main() { int number_of_person, kth_number_killed; cin >> number_of_person >> kth_number_killed; kth_number_killed--; // staring porint int index = 0; // in vector im filling all person postion vector<int> person; for (int i = 1; i <= number_of_person; i++) { person.push_back(i); } alive_last_person(person, kth_number_killed, index); }

10 559

https://github.com/aakash416/TCS-CPA-IRA-PRA/blob/master/IRA%2016%2005%202022/src/Solution.java

10 559

Today ira Java solutions https://github.com/aakash416/TCS-CPA-IRA-PRA/blob/master/IRA%2016%2005%202022/src/Solution.

10 559

https://github.com/aakash416/TCS-CPA-IRA-PRA/blob/master/IRA%2016%2005%202022/src/Solution.java