Endi mavjud! Telegram Tadqiqoti 2025 — yilning asosiy insaytlari 
allcoding1
Kanalga Telegram’da o‘tish
Ko'proq ko'rsatish
📈 Telegram kanali allcoding1 analitikasi
allcoding1 (@allcoding1) Ingliz til segmentidagi kanali faol ishtirokchi. Hozirda hamjamiyat 22 543 obunachidan iborat bo'lib, Taʼlim toifasida 8 854-o'rinni va Hindiston mintaqasida 19 507-o'rinni egallagan.
📊 Auditoriya ko‘rsatkichlari va dinamika
невідомо sanasidan buyon loyiha tez o‘sib, 22 543 obunachiga ega bo‘ldi.
14 Iyun, 2026 dagi oxirgi ma’lumotlarga ko‘ra kanal barqaror faollikka ega. Oxirgi 30 kunda obunachilar soni -445 ga, so‘nggi 24 soatda esa -14 ga o‘zgardi va umumiy qamrov yuqori darajada qolmoqda.
- Tasdiqlash holati: Tasdiqlanmagan
- Jalb etish (ER): Auditoriya o‘rtacha 6.31% darajada jalb etiladi. Nashrdan keyingi dastlabki 24 soatda kontent odatda umumiy obunachilar sonining 1.25% ini tashkil etuvchi reaksiyalarni to‘playdi.
- Post qamrovi: Har bir post o‘rtacha 1 423 marta ko‘riladi; birinchi sutkada odatda 282 ta ko‘rish yig‘iladi.
- Reaksiyalar va o‘zaro ta’sir: Auditoriya faol: har bir postga o‘rtacha 2 ta reaksiya keladi.
- Tematik yo‘nalishlar: Kontent dsa, stack, namaste, javascript, learning kabi asosiy mavzularga jamlangan.
📝 Tavsif va kontent siyosati
Kanal uchun tavsif kiritilmagan.
Yuqori yangilanish chastotasi (oxirgi ma’lumot 16 Iyun, 2026 da olingan) sababli kanal doimo dolzarb va katta qamrovli bo‘lib qoladi. Analitika auditoriya kontent bilan faol hamkorlik qilishini, uni Taʼlim toifasidagi muhim ta’sir nuqtasiga aylantirishini ko‘rsatadi.
22 543
Obunachilar
-1424 soatlar
-947 kunlar
-44530 kunlar
Postlar arxiv
22 543
https://app.joinsuperset.com/join/#/signup/student?jp=38d74885-556d-43a9-b493-4dcbd0f4af73
2024 batch eligible only
22 543
Genpact Hiring
Role: Business Analyst
Apply Link:
https://genpact.taleo.net/careersection/sgy_external_career_section/jobdetail.ftl?job=BFS033345
22 543
Company Name: Upstox
Role: SDE Intern
Batch eligible: 2023 and 2024 passouts
Apply: https://docs.google.com/forms/d/e/1FAIpQLSebiXUKhTEoHvCnZFPDCGPqart5Qt3X48ToLgHBY7caw2CFLA/viewform
22 543
Company Name : Freshworks INC
Role : 1. Application Developer
2. Software Developer
Package Freshers: 5LPA
Package Experience (1-2 yrs) : 7.5 LPA
Skills Needed : Java , Python , HTML, CSS, Java Script, SQL and DBMS.
Location: Bangalore and Chennai (currently remote)
Passed out : 2021 - 2025
Round 1 : Coding Assessment Live in Google meet with interviewer (30 mins)
Round 2 : Technical Interview (30 mins)
Round 3 : HR Interview (20 mins)
https://docs.google.com/forms/d/e/1FAIpQLScSh9qPFBce3XvlCUbm4ZpIKuqTcN6IIsdTLPh2WXhAC4XRfQ/viewform?usp=sf_link
22 543
Repost from allcoding1
+1500 TB Tutorials + Books + Courses + Trainings + Workshops + Educational Resources
🔹Data science
🔹Python
🔹Artificial Intelligence
🔹AWS Certified
🔹Cloud
🔹BIG DATA
🔹Data Analytics
🔹BI
🔹Google Cloud Platform
🔹IT Training
🔹MBA
🔹Machine Learning
🔹Deep Learning
🔹Ethical Hacking
🔹SPSS
🔹Statistics
🔹Data Base
🔹Learning language resources ( English🏴 , French🇨🇵 , German🇩🇪 )
₹300
Contact:- @meterials_available
22 543
Nvidia answer
1)011
2)16
3)64 4)i) 100W
ii)OW iii)20W
iv)0.357
5)8 and 16
6)z=0
7)2:1
8)9
9)0.44
10)200
11)40
12)3.0
13)16
14)750 and 50
15)500
16)60
17)5
18)657
19)250 and 96
20)24
@allcoding1
22 543
Repost from allcoding1
+1500 TB Tutorials + Books + Courses + Trainings + Workshops + Educational Resources
🔹Data science
🔹Python
🔹Artificial Intelligence
🔹AWS Certified
🔹Cloud
🔹BIG DATA
🔹Data Analytics
🔹BI
🔹Google Cloud Platform
🔹IT Training
🔹MBA
🔹Machine Learning
🔹Deep Learning
🔹Ethical Hacking
🔹SPSS
🔹Statistics
🔹Data Base
🔹Learning language resources ( English🏴 , French🇨🇵 , German🇩🇪 )
₹300
Contact:- @meterials_available
22 543
struct Request {
string id;
string start_time;
string end_time;
};
bool compare(Request a, Request b) {
return a.start_time < b.start_time;
}
int solve(vector<Request> requests) {
sort(requests.begin(), requests.end(), compare);
int max_concurrent = 0;
int current_concurrent = 0;
string current_end_time = "00:00:00";
for (Request request : requests) {
if (request.start_time >= current_end_time) {
current_concurrent--;
} else {
current_concurrent++;
if (current_concurrent > max_concurrent) {
max_concurrent = current_concurrent;
}
}
if (request.end_time > current_end_time) {
current_end_time = request.end_time;
}
}
return max_concurrent;
}
@allcoding1_official
22 543
#define vv(a) vector<vector<int>>(a)
int solve(int n, int m, vector<vector<int>> &a)
{
vv(right)(n, vector<int>(m, 0));
vv(down)(n, vector<int>(m, 0));
vv(left)(n, vector<int>(m, 0));
for (int i = 0; i < n; i++)
{
int cnt = 0;
for (int j = m - 1; j >= 0; j--)
{
right[i][j] = cnt;
if (a[i][j] == 1)
cnt++;
}
}
for (int i = 0; i < n; i++)
{
int cnt = 0;
for (int j = 0; j < m; j++)
{
left[i][j] = cnt;
if (a[i][j] == 1)
cnt++;
}
}
for (int j = 0; j < m; j++)
{
int cnt = 0;
for (int i = n - 1; i >= 0; i--)
{
down[i][j] = cnt;
if (a[i][j] == 1)
cnt++;
}
}
int ans = 0;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
if (a[i][j] == 1)
{
ans += (right[i][j] * down[i][j]);
ans += (left[i][j] * down[i][j]);
}
}
}
return ans;
}
C++
Telegram:- @allcoding1
22 543
int solve(int n, vector<int>& arr) {
while (arr.size() > 1) {
int len = INT_MAX;
int idx = -1;
for (int i = 0; i < arr.size() - 1; ++i) {
int d = arr[i + 1];
if (d == 0 || arr[i] == 0) {
continue;
}
int r = min(arr[i] % d, d % arr[i]);
if (r < len) {
len = r;
idx = i;
}
}
if (idx == -1) {
break;
}
int d = arr[idx + 1];
if (d != 0) {
arr[idx] = min(arr[idx] % d, d % arr[idx]);
}
arr.erase(arr.begin() + idx + 1);
}
return arr.size();
}
Women Day Mathematics Challenge
Telegram:- @allcoding1
