Endi mavjud! Telegram Tadqiqoti 2025 — yilning asosiy insaytlari 
allcoding1_official
Kanalga Telegram’da o‘tish
Ko'proq ko'rsatish
📈 Telegram kanali allcoding1_official analitikasi
allcoding1_official (@allcoding1_official) Ingliz til segmentidagi kanali faol ishtirokchi. Hozirda hamjamiyat 85 678 obunachidan iborat bo'lib, Texnologiyalar & Aralashmalar toifasida 1 508-o'rinni va Hindiston mintaqasida 3 501-o'rinni egallagan.
📊 Auditoriya ko‘rsatkichlari va dinamika
невідомо sanasidan buyon loyiha tez o‘sib, 85 678 obunachiga ega bo‘ldi.
21 Iyun, 2026 dagi oxirgi ma’lumotlarga ko‘ra kanal barqaror faollikka ega. Oxirgi 30 kunda obunachilar soni -1 434 ga, so‘nggi 24 soatda esa -33 ga o‘zgardi va umumiy qamrov yuqori darajada qolmoqda.
- Tasdiqlash holati: Tasdiqlanmagan
- Jalb etish (ER): Auditoriya o‘rtacha 3.09% darajada jalb etiladi. Nashrdan keyingi dastlabki 24 soatda kontent odatda umumiy obunachilar sonining 0.73% ini tashkil etuvchi reaksiyalarni to‘playdi.
- Post qamrovi: Har bir post o‘rtacha 2 645 marta ko‘riladi; birinchi sutkada odatda 625 ta ko‘rish yig‘iladi.
- Reaksiyalar va o‘zaro ta’sir: Auditoriya faol: har bir postga o‘rtacha 1 ta reaksiya keladi.
- Tematik yo‘nalishlar: Kontent dsa, stack, namaste, javascript, dev kabi asosiy mavzularga jamlangan.
📝 Tavsif va kontent siyosati
Kanal uchun tavsif kiritilmagan.
Yuqori yangilanish chastotasi (oxirgi ma’lumot 22 Iyun, 2026 da olingan) sababli kanal doimo dolzarb va katta qamrovli bo‘lib qoladi. Analitika auditoriya kontent bilan faol hamkorlik qilishini, uni Texnologiyalar & Aralashmalar toifasidagi muhim ta’sir nuqtasiga aylantirishini ko‘rsatadi.
85 678
Obunachilar
-3324 soatlar
-3007 kunlar
-1 43430 kunlar
Postlar arxiv
85 678
Date science full course (record classes)
50 rupees
👇👇
@meterials_available
85 678
In response to your demand, we now offer Instant Data Analytics Certificate Recognized by Google and Amazon
- 🕑 Take 5 minutes Quiz
- 📜Pay & Unlock Instant Certificate
- ✅ show it off on your CV & LinkedIn
Get your instant certificate @Rs.199 only and level up your CV & increase chance of getting job by 133%.
Limited period offer 🥵. Click below
https://tinyurl.com/DataAnalyticsXCertificateAC1
85 678
Many of you have been asking for SQL course that covers everything you need and is budget friendly. Well, I’m excited to introduce you to this course by LearnTube!
Highlights :-
📃Personalised SQL Course
📰Verified SQL Certificate recognised by Google and amazon .
🏅5+ Industry projects.
All of these in just Rs. 399 with Life Time access
Limited time period offer. Click Below 👇
https://tinyurl.com/SQLXCourseAC1
85 678
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int[] left = new int[n];
int[] right = new int[n];
for (int i = 0; i < n; i++) {
left[i] = scanner.nextInt();
right[i] = scanner.nextInt();
}
int sumLeft = 0;
int sumRight = 0;
for (int i = 0; i < n; i++) {
sumLeft += left[i];
sumRight += right[i];
}
if (sumLeft % 2 == 0 && sumRight % 2 == 0) {
System.out.println(0);
return;
}
boolean possible = false;
for (int i = 0; i < n; i++) {
int newSumLeft = sumLeft - left[i] + right[i];
int newSumRight = sumRight - right[i] + left[i];
if (newSumLeft % 2 == 0 && newSumRight % 2 == 0) {
possible = true;
break;
}
}
if (possible) {
System.out.println(1);
} else {
System.out.println(-1);
}
}
}
85 678
AWS COURSE Classes BY NARESH IT
Google drive Link for 50 rupees
Contact:- @meterials_available
85 678
+8
📌IT learning courses
📌All programing courses
📌Abdul bari courses
📌Ashok IT
📌Linux
📌Networking
📌Design patterns
📌Donet
📌Docker
📌Entity framework
📌Node.js
📌ASP. Net
📌Aps. Net cro
📌java
📌JavaScript
📌full stack developer
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 , 🇫🇷
All courses (100 rupees)
Contact:- @meterials_available
85 678
AWS COURSE Classes BY NARESH IT
Google drive Link for 50 rupees
Contact:- @meterials_available
85 678
AP election results
https://results.eci.gov.in/AcResultGenJune2024/partywiseleadresult-1745S01.htm
85 678
+8
📌IT learning courses
📌All programing courses
📌Abdul bari courses
📌Ashok IT
📌Linux
📌Networking
📌Design patterns
📌Donet
📌Docker
📌Entity framework
📌Node.js
📌ASP. Net
📌Aps. Net cro
📌java
📌JavaScript
📌full stack developer
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 , 🇫🇷
All courses (100 rupees)
Contact:- @meterials_available
85 678
+8
📌IT learning courses
📌All programing courses
📌Abdul bari courses
📌Ashok IT
📌Linux
📌Networking
📌Design patterns
📌Donet
📌Docker
📌Entity framework
📌Node.js
📌ASP. Net
📌Aps. Net cro
📌java
📌JavaScript
📌full stack developer
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 , 🇫🇷
All courses (100 rupees)
Contact:- @meterials_available
85 678
import math
AC
def is_nprime(x): if x <2: return False for i in range(2, int(math.sqrt(x)) + 1): if x % i == 0: return x == i*i return True
def count_nearly_primes(L, R): nPrimes = 0 for x in range(L+1, R): if is_nprime(x): nPrimes += 1 return nPrimes
L = int(input()) R = int(input()) result = count_nearly..primes(L, R) print(result)
Count of Nearly Primes
Python3
85 678
def count_arrays(N, K, X):
MOD = 1000000007
if N == 1:
return 1 if X == 1 else 0
a = [0] * (N + 1)
b = [0] * (N + 1)
a[1] = 1
b[1] = 0
for i in range(2, N + 1):
a[i] = (a[i - 1] * (K - 2) + b[i - 1] * (K - 1)) % MOD
b[i] = a[i - 1] % MOD
return b[N]
N = int(input())
K = int(input())
X = int(input())
print(count_arrays(N, K, X))
Number Of Array code
Thoughtwork exam
Python3
Telegram:- @allcoding1_official
