allcoding1
Kanalga Telegram’da o‘tish
Ko'proq ko'rsatish
📈 Telegram kanali allcoding1 analitikasi
allcoding1 (@allcoding1) Ingliz til segmentidagi kanali faol ishtirokchi. Hozirda hamjamiyat 21 531 obunachidan iborat bo'lib, Taʼlim toifasida 9 159-o'rinni va Hindiston mintaqasida 19 101-o'rinni egallagan.
📊 Auditoriya ko‘rsatkichlari va dinamika
невідомо sanasidan buyon loyiha tez o‘sib, 21 531 obunachiga ega bo‘ldi.
01 Sentabr, 2026 dagi oxirgi ma’lumotlarga ko‘ra kanal barqaror faollikka ega. Oxirgi 30 kunda obunachilar soni -367 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 7.16% 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 543 marta ko‘riladi; birinchi sutkada odatda 270 ta ko‘rish yig‘iladi.
- Reaksiyalar va o‘zaro ta’sir: Auditoriya faol: har bir postga o‘rtacha 0 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 02 Sentabr, 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.
21 531
Obunachilar
-1424 soatlar
-797 kun
-36730 kun
Postlar arxiv
21 531
18+ join now ⬇️
❇️ Hamas terrorists in killing Israelis
🎦 videos and pics
https://whatsapp.com/channel/0029VaBHQmLHVvTS8f2p1034
21 531
🅾️Free off cost
👉ALL IT companies (materials, exams questions & Answers paper)
👉ALL software courses with certification
🅾️Free off cost
Join now 👇
@Allcodingsolution
@Allcodingsolution
@Allcodingsolution
✅Please send with your friends and college groups
21 531
+1string getLongestRegex(string a, string b, string c)
{
const size_t n = a.size();
int idx = -1;
for (int i = 0; i < n; i++) {
if (c[i] != a[i] && c[i] != b[i]) { idx = i; }
}
if (idx == -1) return "-1";
string res;
for (int i = 0; i < n; i++) {
if (i == idx) {
string cur = "[";
for (int j = 'A'; j <= 'Z'; j++) if (j != c[i]) cur += j;
cur += "]";
res += cur;
} else {
res += "[ABCDEFGHIJKLMNOPQRSTUVWXYZ]";
}
}
return res;
}
C++
Amazon
21 531
def minimumCost(price):
n = len(price)
price.append(0)
ans = float('inf')
last = {price[0]: 0}
for i in range(1, n):
v = price[i]
price[i] += price[i - 1]
if last.get(v) != None:
ans = min(ans, price[i] - price[last[v]] + v)
last[v] = i
return ans if ans != float('inf') else -1
n = int(input())
price = list(map(int,input().split(' ')))
print(minimumCost(price))
Python 3
Amazon
21 531
#include <bits/stdc++.h>
using namespace std;
bool checkbit(int n,int i){
return n&(1<<i);
}
bool cmp(const pair<int,int> &a,const pair<int,int>&b){
return a.second<b.second;
}
int main() {
int n;cin>>n;
int a[n];
for(int i=0;i<n;i++) cin>>a[i];
vector<pair<int,int>> v;
for(int i=0;i<n;i++){
int c=0;
for(int j=0;j<31;j++){
if(checkbit(a[i],j)) c++;
}
v.push_back({a[i],c});
}
int idx = 0;
sort(v.begin(),v.end(),cmp);
for(auto it : v){
a[idx++] = it.first;
cout<<it.second<<" ";
}
for(int i=0;i<n;i++){
cout<<a[i]<<" ";
}
return 0;
}
C++
Telegram:- @allcoding1
21 531
def cardinalitySort(nums):
return sorted(nums, key=lambda num: [bin(num).count('1'), num])
Cardinality sorting
21 531
def gameWinner(colors):
currPlayer = "wendy"
prevPlayer = ""
winner = ""
while True:
moveMade = False
if currPlayer == "wendy":
whiteIndex = colors.find("www")
if whiteIndex = -1:
# 3 consecutive whites found, remove the middle one
colorsBuilder = list(colors)
colorsBuilder.pop(whiteIndex + 1)
colors = "".join(colorsBuilder)
moveMade = True
prevPlayer = currPlayer
currPlayer = "bob"
else:
blackIndex = colors.find("bbb")
if blackIndex != -1:
# 3 consecutive blacks found, remove the middle one
colorsBuilder = list(colors)
colorsBuilder.pop(blackIndex + 1)
colors = "".join(colorsBuilder)
moveMade = True
prevPlayer = currPlayer
currPlayer = "wendy"
# if no moves possible break
if not moveMade:
winner = prevPlayer
break
return winner
print(gameWinner("wwwbb"))
Python 3
Game Winner
JP Morgan
21 531
🎯GlobalLogic off Campus Drive 2023 | Associate Analyst | Gurgaon | Rs 3.5-4.5 LPA
Job Role:- Associate Analyst
Qualification:- Any Graduate
Batch:- Any Batch
Salary/CTC:- Rs 3.5-4.5 LPA
Apply Now;- http://www.allcoding1.com
Video:- https://youtube.com/shorts/tWPfvbhtPgI?feature=share
Telegram:- @allcoding1
