Code With Virus

Open in Telegram

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

India43 593 Technologies & Applications10 501...

📈 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 05 December, 2025), 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

No data

Post views

No data24 hours

No data48 hours

No data

Engagement rate

No data

Posts per day

Ads index

beta

Posts Archive

10 559

https://leetcode.com/problems/move-pieces-to-obtain-a-string/discuss/2261400/C%2B%2B-oror-Easy-Solution-oror-Normal-Solution

10 559

https://leetcode.com/problems/smallest-number-in-infinite-set/discuss/2261342/C%2B%2B-oror-Easy-Solution-oror-by-SET-oror-Simple

10 559

https://leetcode.com/problems/minimum-amount-of-time-to-fill-cups/discuss/2261289/C%2B%2B-oror-Easy-Solution-oror-TC-O(N-log-N)-oror-SC-O(1)

10 559

https://leetcode.com/problems/the-latest-time-to-catch-a-bus/discuss/2259246/C%2B%2B-oror-Easy-Solution-oror-SET

10 559

https://leetcode.com/problems/evaluate-boolean-binary-tree/discuss/2259204/C%2B%2B-oror-Easy-Solution-oror-Tree

10 559

#include <bits/stdc++.h> #define n 3 using namespace std; int findLongestFromACell(int i, int j, int mat[n][n], int dp[n][n]) { if (i < 0 i >= n j < 0 || j >= n) return 0; if (dp[i][j] != -1) return dp[i][j]; int x = INT_MIN, y = INT_MIN, z = INT_MIN, w = INT_MIN; if (j < n - 1 && ((mat[i][j] + 1) == mat[i][j + 1])) x = 1 + findLongestFromACell(i, j + 1, mat, dp); if (j > 0 && (mat[i][j] + 1 == mat[i][j - 1])) y = 1 + findLongestFromACell(i, j - 1, mat, dp); if (i > 0 && (mat[i][j] + 1 == mat[i - 1][j])) z = 1 + findLongestFromACell(i - 1, j, mat, dp); if (i < n - 1 && (mat[i][j] + 1 == mat[i + 1][j])) w = 1 + findLongestFromACell(i + 1, j, mat, dp); return dp[i][j] = max({x, y, z, w, 1}); } int LongestPath(int mat[n][n]) { int result = 1; int dp[n][n]; memset(dp, -1, sizeof dp); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (dp[i][j] == -1) findLongestFromACell(i, j, mat, dp); result = max(result, dp[i][j]); } } return result; } int main() { int mat[n][n] = {{1, 2, 9}, {5, 3, 8}, {4, 6, 7}}; cout << "Length of the longest path is " << LongestPath(mat); return 0; }

10 559

Atlassian Software Development Engineer I, Backend https://jobs.lever.co/atlassian/db4f7e89-091b-47c1-8971-0b8abd9f959c

10 559

L&T Off Campus Only 2022 Batch https://campus.lntedutech.com/l#/open/off-campus/profile

10 559

https://leetcode.com/problems/interleaving-string/discuss/2249574/C%2B%2B-oror-Recursion-%2B-Memoization-O(M*N)-time-and-space-oror-Easy-Solution

10 559

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

10 559

https://leetcode.com/problems/longest-consecutive-sequence/discuss/2239835/C%2B%2B-oror-TC-O(N-log-N)-oror-SC-O(1)-oror-Simple-Solution-oror-by-sort-function

10 559

https://practice.geeksforgeeks.org/contest/job-a-thon-exclusive-hiring-challenge-for-amazon-alexa

10 559

// C Solution The Third Problem void codewithvirus() { ll n, mn = 0, p0 = -1, p1 = -1, cnt = 0, CountS = 2, ans = 1; cin >> n; vector<int> vec(n), vec1(n); for (int i = 0; i < n; i++) { cin >> vec[i]; } if (n == 1 || n == 2) { cout << 1; return; } for (int i = 0; i < n; i++) { if (vec[i] == 0) p0 = i; else if (vec[i] == 1) p1 = i; vec1[vec[i]] = i; } sort(vec.begin() + min(p0, p1), vec.begin() + max(p0, p1) + 1); for (int i = min(p0, p1); i <= max(p0, p1); i++) { if (mn != vec[i]) break; else mn++; } ll minn = min(p0, p1), maxxx = max(p0, p1); ll lengthss = maxxx - minn + 1; for (int i = 2; i < n; i++) { if (vec1[i] < minn) { CountS++; minn = vec1[i]; lengthss = maxxx - minn + 1; } else if (vec1[i] > maxxx) { CountS++; maxxx = vec1[i]; lengthss = maxxx - minn + 1; } else { ans = (ans * (lengthss - CountS)) % 1000000007; CountS++; } } cout << ans; }

10 559

//B Solution Almost Ternary Matrix void codewithvirus() { int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cout << ((((i / 2) + (j / 2)) & 1) ^ (((i & 1) + (j & 1)) & 1)) << " "; } cout << endl; } }

10 559

//A Solution The Third Three Number Problem void codewithvirus() { int n; cin >> n; if (n % 2 != 0) cout << -1; else cout << 0 << " " << 0 << " " << n / 2; }

10 559

https://leetcode.com/problems/candy/discuss/2235195/C%2B%2B-oror-TC-O(N)-oror-SC-O(N)-oror-Easy-Solution-oror-From-Left-and-Right

10 559

https://t.me/Amazonavirustech

10 559

https://leetcode.com/problems/wiggle-subsequence/discuss/2232173/C%2B%2B-oror-Greedy-Approach-oror-TC-O(N)-oror-SC-O(1)-oror-Easy-Solution

10 559

// Infosys // N flowers on a Recatangular pana int ans = 100000000; void solve(vector<int> a, int n, int k, int index, int sum, int maxsum) { if (k == 1) { maxsum = max(maxsum, sum); sum = 0; for (int i = index; i < n; i++) { sum += a[i]; } maxsum = max(maxsum, sum); ans = min(ans, maxsum); return; } sum = 0; for (int i = index; i < n; i++) { sum += a[i]; maxsum = max(maxsum, sum); solve(a, n, k - 1, i + 1, sum, maxsum); } } int GetMaxBeauty(int N, int K, vector<int> A) { solve(A, N, K, 0, 0, 0); return ans; } // @codewithvirus // @codewithvirus // @codewithvirus // @codewithvirus