Firibgarlarga uchmang! Telemetrio bunday kanallarni topadi va belgilaydi 👉 Belgini ko‘rmoqchi bo‘lsangiz, obuna bo‘ling

allcoding1

Kanalga Telegram’da o‘tish

Ko'proq ko'rsatish

📈 Telegram kanali allcoding1 analitikasi

allcoding1 (@allcoding1) Ingliz til segmentidagi kanali faol ishtirokchi. Hozirda hamjamiyat 20 738 obunachidan iborat bo'lib, Taʼlim toifasida 9 715-o'rinni va Hindiston mintaqasida 19 502-o'rinni egallagan.

📊 Auditoriya ko‘rsatkichlari va dinamika

невідомо sanasidan buyon loyiha tez o‘sib, 20 738 obunachiga ega bo‘ldi.

29 Oktabr, 2026 dagi oxirgi ma’lumotlarga ko‘ra kanal barqaror faollikka ega. Oxirgi 30 kunda obunachilar soni -409 ga, so‘nggi 24 soatda esa -19 ga o‘zgardi va umumiy qamrov yuqori darajada qolmoqda.

Tasdiqlash holati: Tasdiqlanmagan
Jalb etish (ER): Auditoriya o‘rtacha 2.24% darajada jalb etiladi. Nashrdan keyingi dastlabki 24 soatda kontent odatda umumiy obunachilar sonining 1.06% ini tashkil etuvchi reaksiyalarni to‘playdi.
Post qamrovi: Har bir post o‘rtacha 464 marta ko‘riladi; birinchi sutkada odatda 220 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 30 Oktabr, 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.

20 738

Obunachilar

-1924 soatlar

-957 kun

-40930 kun

464

Post ko'rishlar

~ 22024 soatlar

~ 32048 soatlar

2.24%

Muloqot nisbati

Ma'lumot yo'q

Kuniga postlar

Ads index

beta

Postlar arxiv

20 738

TCS Exam Ans 1)1008 2)39 3)2 4)40.3 Telegram:- @allcoding1

20 738

TCS Exam Ans 1)1008 2)39 3)2 Telegram:- @allcoding1

20 738

Python 3

20 738

#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; vector<string> v(n); for (int i = 0; i < n; i++) { cin >> v[i]; } int ans = 0; for (int i = 0; i <= n - k; i++) { map<string, int> mp; for (int j = i; j < i + k; j++) { mp[v[j]]++; } int p = mp.size(); ans = max(ans, p); } cout << ans << endl; } C++ N-Day (TCS 1st Qsn) Telegram:- @allcoding1

20 738

Python N-Day (TCS 1st Qsn) Telegram:- @allcoding1

20 738

Advance reasoning 1) No 2) red 3)266839 4) data in either 5) candidate will be not be selected 6. 3 7. MERKLF. 8) lily 9)32 Telegram:- @allcoding1

20 738

Advance reasoning 1) No 2) red 3)266839 4) data in either 5) candidate will be not be selected 6. 3 7. MERKLF. 8) lily Telegram:- @allcoding1

20 738

Advance reasoning 1) No 2) red 3)266839 4) data in either 5) candidate will be not be selected 6. 3 7. MERKLF... Telegram:- @allcoding1

20 738

Advance reasoning 1) No 2) red 3)266839 4) data in either 5) candidate will be not be selected Telegram:- @allcoding1

20 738

Advance reasoning 1) No 2) red

20 738

TCS NQT 9AM ADV. APTI 1) 26/35 2) 18 3) greater by 14 14/15 4) 9500 and 10500 5) 20 6) 15 7) 9 8) 30 9) 80000 10) 15000 Telegram:- @allcoding1

20 738

TCS NQT 9AM ADV. APTI 1) 26/35 2) 18 3) greater by 14 14/15 4) 9500 and 10500 5) 20 6) 15 7) 9 8) 25 9) 60000 10) 15000 Telegram:- @allcoding1

20 738

Advanced answers 1. 15/28 2. 18 3. No difference 4. 9500 5. 400 6. 16 7. 9 8. 25 9. 60000 10. 15000 Telegram:- @allcoding1

20 738

Advance 1)26/35 2)18 3) greatr by 14 14/15 4)9500 and 10500 5) 20 6) 15 @allcoding1

20 738

Advance 1)26/35 2)18 @allcoding1

20 738

Advance 1)26/35 @allcoding1

20 738

19)M @allcoding1 20)False @allcoding1