uz
Feedback
allcoding1_official

allcoding1_official

Kanalga Telegram’da o‘tish

📈 Telegram kanali allcoding1_official analitikasi

allcoding1_official (@allcoding1_official) Ingliz til segmentidagi kanali faol ishtirokchi. Hozirda hamjamiyat 85 198 obunachidan iborat bo'lib, Texnologiyalar & Aralashmalar toifasida 1 500-o'rinni va Hindiston mintaqasida 3 477-o'rinni egallagan.

📊 Auditoriya ko‘rsatkichlari va dinamika

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

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

  • Tasdiqlash holati: Tasdiqlanmagan
  • Jalb etish (ER): Auditoriya o‘rtacha 2.91% darajada jalb etiladi. Nashrdan keyingi dastlabki 24 soatda kontent odatda umumiy obunachilar sonining 0.82% ini tashkil etuvchi reaksiyalarni to‘playdi.
  • Post qamrovi: Har bir post o‘rtacha 2 478 marta ko‘riladi; birinchi sutkada odatda 697 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, dev kabi asosiy mavzularga jamlangan.

📝 Tavsif va kontent siyosati

Kanal uchun tavsif kiritilmagan.

Yuqori yangilanish chastotasi (oxirgi ma’lumot 01 Iyul, 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 198
Obunachilar
-3124 soatlar
-3917 kunlar
-1 47330 kunlar
Postlar arxiv
🎯Accenture Hiring | For System and Application Services Associate Degree: Any Graduate Batch: 2019, 20, 21 & 22 CTC - ₹ 3.33 LPA Apply now:- http://www.allcoding1.com Telegram:- @allcoding1_official

🎯Capgemini Recruitment for Freshers 2022 : Hiring for Freshers With 4 LPA Job Role : Network Engineer Qualification : B.Tech/ B.E / MCA Batch : 2020/2021/2022 Salary : 3-4 LPA Apply Now:- http://www.allcoding1.com Telegram:- @allcoding1_official

🎯SHL Global Hiring for Freshers as Associate QA Deployment With 3.25 LPA Job Role : Associate QA – Deployment Qualification : B.E/B.Tech Experience : Freshers Package : 3.25 LPA Apply Now:- http://www.allcoding1.com Telegram:- @allcoding1_official

Synopsys Off Campus Drive 2022 For Intern (Technical - Engineering) Location: Bangalore / Hyderabad Qualification: B.E / B.Tech / M.E / M.Tech Work Experience: Fresher Apply Now:- http://www.allcoding1.com Telegram:- @allcoding1_official

October 2022 Jobs notifications 🔔 🎯Infosys 9.5LPA 🎯TCS 🎯 Accenture 3.33LPA 🎯 Amazon 5LPA 🎯 cognizant 4.5 LPA 🎯 Capgemini 4LPA 🎯 Qualcomm 8LPA 🎯 Wipro 🎯 Zoho 4LPA 🎯Alter 6LPA 🎯IBM 5LPA 🎯HCL 4.25 LPA 🎯DXC 4LPA 🎯LTI 4LPA 🎯 KPMG 4LPA @allcoding1_official 🎯Zeta 3LPA 🎯Theyve 3.5LPA 🎯 Emerson 4LPA 🎯Hexaware 4LPA 🎯 Global Logic 4.2LPA 🎯 Google 7.5LPA 🎯 Pepsico 7LPA 🎯 Phonepe 5LPA 🎯 Sutherland 5.5LPA Guys♥️ Once check All notifications and apply Now👇👇👇👇 http://www.allcoding1.com INFOSYS CODEINE ANS 3PM (22/10/22) ↗️Share with your friends and groups Telegram:- @allcoding1_official

photo content
+2

(Python3) Total Number of possible pairs(a,b) All test cases passes Telegram:-
+1
(Python3) Total Number of possible pairs(a,b) All test cases passes Telegram:-

photo content
+1

photo content

Alex code Python 3 Telegram:-
Alex code Python 3 Telegram:-

MAX = 10000 # prefix[i] is going to # store count of primes # till i (including i). pt =[0]*(MAX + 1) def abc(): prime = [1]*
MAX = 10000 # prefix[i] is going to # store count of primes # till i (including i). pt =[0]*(MAX + 1) def abc(): prime = [1]*(MAX + 1) p = 2 while(p * p <= MAX): if (prime[p] == 1): i = p * 2 while(i <= MAX): prime[i] = 0 i += p p+=1 for p in range(2,MAX+1): pt[p] = pt[p - 1] if (prime[p]==1): pt[p]+=1 //@allcoding1 def query(a,b): return pt[b]-pt[a-1] n=int(input()) c=0 for i in range(n): a,b=map(int,input().split()) abc() c+=query(a,b) mod=10**9+7 print(c%mod) prime numbers in range[L,R] All test cases passed Telegram :- @allcoding1

Array A length n code Telegram:- @allcoding1
Array A length n code Telegram:- @allcoding1

photo content

Java Telegram -
+1
Java Telegram -

Python Telegram:-
+1
Python Telegram:-

October 2022 Jobs notifications 🔔 🎯Infosys 9.5LPA 🎯TCS 🎯 Accenture 3.33LPA 🎯 Amazon 5LPA 🎯 cognizant 4.5 LPA 🎯 Capgemini 4LPA 🎯 Qualcomm 8LPA 🎯 Wipro 🎯 Zoho 4LPA 🎯Alter 6LPA 🎯IBM 5LPA 🎯HCL 4.25 LPA 🎯DXC 4LPA 🎯LTI 4LPA 🎯 KPMG 4LPA @allcoding1_official 🎯Zeta 3LPA 🎯Theyve 3.5LPA 🎯 Emerson 4LPA 🎯Hexaware 4LPA 🎯 Global Logic 4.2LPA 🎯 Google 7.5LPA 🎯 Pepsico 7LPA 🎯 Phonepe 5LPA 🎯 Sutherland 5.5LPA Guys♥️ Once check All notifications and apply Now👇👇👇👇 http://www.allcoding1.com INFOSYS CODEINE ANS 3PM (22/10/22) ↗️Share with your friends and groups Telegram:- @allcoding1_official

def getLargestString(s, k):     frequency_array = [0] * 26     for i in range(len(s)):         frequency_array[ord(s[i]) -                         ord('a')] += 1     ans = ""     i = 25     while i >= 0:         if (frequency_array[i] > k):             temp = k             st = chr( i + ord('a'))                          while (temp > 0):                 ans += st                 temp -= 1                        frequency_array[i] -= k             j = i - 1                          while (frequency_array[j] <= 0 and                    j >= 0):                 j -= 1             if (frequency_array[j] > 0 and                 j >= 0):                 str1 = chr(j + ord( 'a'))                 ans += str1                 frequency_array[j] -= 1                          else:                 break         elif (frequency_array[i] > 0):             temp = frequency_array[i]             frequency_array[i] -= temp             st = chr(i + ord('a'))             while (temp > 0):                 ans += st                 temp -= 1         else:             i -= 1                  return ans           if name == "main":        S = input()     k = 3     print (getLargestString(S, k)) Python Bob code Telegram:- @allcoding1_official

Repost from allcoding1
from itertools import permutations def count(arr): z=[] perm = permutations(arr) for i in list(perm): z.append(list(i)) q=[]
from itertools import permutations def count(arr):     z=[]     perm = permutations(arr)          for i in list(perm):         z.append(list(i))     q=[]          for i in range(len(arr)-1):         x,y=arr[i],arr[i+1]                  for j in range(len(z)):             if z[j].index(x)!=len(z[j])-1:                 if z[j][z[j].index(x)+1]==y:                     q.append(z[j])                          for i in range(len(q)):          if q[i] in z:              z.remove(q[i])     return len(z) a= int(input()) b=list(map(int,input().strip().split())) print(count(b)) Python Telegram - @allcoding1