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 84 717 obunachidan iborat bo'lib, Texnologiyalar & Aralashmalar toifasida 1 498-o'rinni va Hindiston mintaqasida 3 519-o'rinni egallagan.
📊 Auditoriya ko‘rsatkichlari va dinamika
невідомо sanasidan buyon loyiha tez o‘sib, 84 717 obunachiga ega bo‘ldi.
08 Iyul, 2026 dagi oxirgi ma’lumotlarga ko‘ra kanal barqaror faollikka ega. Oxirgi 30 kunda obunachilar soni -1 499 ga, so‘nggi 24 soatda esa -64 ga o‘zgardi va umumiy qamrov yuqori darajada qolmoqda.
- Tasdiqlash holati: Tasdiqlanmagan
- Jalb etish (ER): Auditoriya o‘rtacha 2.62% darajada jalb etiladi. Nashrdan keyingi dastlabki 24 soatda kontent odatda umumiy obunachilar sonining 0.88% ini tashkil etuvchi reaksiyalarni to‘playdi.
- Post qamrovi: Har bir post o‘rtacha 2 218 marta ko‘riladi; birinchi sutkada odatda 743 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 09 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.
84 717
Obunachilar
-6424 soatlar
-4007 kunlar
-1 49930 kunlar
Postlar arxiv
84 684
Repost from allcoding1_official
AllCODING1 (PYTHON 3)
Allcoding1
1.) Number Sum
n=input()
s=list(map(int, input().split(',')))
maxi=max(s) # finding the maximum number
mini=min(s) # finding the minimum number
print((maxi)+(mini))
2.) Modular Exponentiation
b=int(input())
e=int(input())
m=int(input())
print((b**e)%m) #main operation
3.) Next Greater Number
from itertools import permutations
r=int(input()) #length
n=input() #taking the input as a string
a = permutations(n, r)
#print(a)
y = [''.join(i) for i in a] # joining the digits to a y
y=sorted(y)
q=y.index(n) #finding the index of the input value from the list
#print(q)
print(y[q+1])
@allcoding1
4.) Factorials
n=int(input())
fact=1
for i in range(1,n+1):
fact=fact*i;
print(str(fact))
5.) Anagrams
n=input()
m=input()
count=0
l=len(m)
for i in n:
if i in m:
count=count+1
else:
pass
if count == l:
print("Yes")
else:
print("No")
6.) String within String
n=input()
m=input()
if m in n:
print("yes")
else:
print("No")
7.) Maximum Sum of Column and Row (Java 3)
public class CodeWindow {
public static void main(String[] args) {
int input1=3;
int input2=3;
int [] input3={3,6,9,1,4,7,2,8,9};
int ans= max( input1,input2,input3);
System.out.println(ans);
}
private static int max(int input1, int input2, int[] input3) {
int rows = input1;
int cols = input2;
int sumRow, sumCol;
int [] [] a= new int[input1][input2];
int count=0;
for(int i=0;i<input1;i++)
{
for(int j=0;j<input2;j++)
{
if(count==input3.length) break;
a[i][j]=input3[count];
count++;
}
}
int maxRow = Integer.MIN_VALUE;
for(int i = 0; i < rows; i++){
sumRow = 0;
for(int j = 0; j < cols; j++){
sumRow = sumRow + a[i][j];
}
maxRow=Math.max(maxRow,sumRow);
}
int maxCol=Integer.MIN_VALUE;
for(int i = 0; i < cols; i++){
sumCol = 0;
for(int j = 0; j < rows; j++){
sumCol = sumCol + a[j][i];
}
maxCol=Math.max(maxCol,sumCol);
}
return maxCol+maxRow;
}
}
@allcoding1
8.) Nth Prime Number
l=int(input())
n=0
i=0
a=[]
while n<100:
i+=1
count=1
for j in range(2,i):
if i%j==0:
count=0
break
if count==1:
a.append(i)
n+=1
#print(a) #to check the series
print(a[l])
9.) Second Largest Number
l=int(input())
arr=list(map(int, input().split()))
arr=list(set(arr))
length_list=len(arr)
arr.sort()
#print("set = ",arr)
#print("length of set: ",length_list)
print(arr[length_list-2])
10.) Adam’s Charity
n=int(input())
sum=0
for i in range(1,n+1):
sum=sum+(i**2)
print(sum)
Telegram👇
@allcoding1 @allcoding1
@allcoding1 @allcoding1
@allcoding1 @allcoding1
⚠️ Share post in ur college and telegram Group's
84 684
Repost from allcoding1_official
![s = input() s1=s[::-1] If(s == s1) : print ("True") else: //allcoding1 print ("False") Python Telegram:-@allcoding1](https://cdn.tlmtr.io/_next/static/media/empty-channel.35ed232f.svg)
s = input()
s1=s[::-1]
If(s == s1) :
print ("True")
else:
//allcoding1
print ("False")
Python
Telegram:-@allcoding1
84 684
Repost from allcoding1_official
Palindrome
private static isPalindrome (String put1)
{ j = input1.length(); for (int i=0;i<s.length()/2;i++) { char ch input1.charAt(i);
//allcoding1
if(ch!= input1.charAt(j-1))
return 0;
j--;
}
return 1;
}
Output:-
1
Java
Telegram:-@allcoding1
84 684
Repost from allcoding1_official
LCS With Vowels
str1 = input()
str2 = input ()
vowels = 'aeiou'
c1 = c2 = 0
for ch in str1:
if ch in vowels:
c1 += 1
for ch in str2:
if ch in vowels:
c2 += 1
//allcoding1
print(min(c1,c2))
input2[-1] +=1
ans = input2[::-1]
i=0
while i<= input1:
if ans[i]>=9:
ans[i+1]+=1
i+=1
else:
print(input1-i)
break
Python
Telegram:-@allcoding1
84 684
s = input()
s1=s[::-1]
If(s == s1) :
print ("True")
else:
//allcoding1
print ("False")
Python
Telegram:-@allcoding1
84 684
Palindrome
private static isPalindrome (String put1)
{ j = input1.length(); for (int i=0;i<s.length()/2;i++) { char ch input1.charAt(i);
//allcoding1
if(ch!= input1.charAt(j-1))
return 0;
j--;
}
return 1;
}
Output:-
1
84 684
Repost from allcoding1_official
LCS With Vowels
str1 = input()
str2 = input ()
vowels = 'aeiou'
c1 = c2 = 0
for ch in str1:
if ch in vowels:
c1 += 1
for ch in str2:
if ch in vowels:
c2 += 1
//allcoding1
print(min(c1,c2))
input2[-1] +=1
ans = input2[::-1]
i=0
while i<= input1:
if ans[i]>=9:
ans[i+1]+=1
i+=1
else:
print(input1-i)
break
Python
Telegram:-@allcoding1
