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 78 624 obunachidan iborat bo'lib, Texnologiyalar & Aralashmalar toifasida 1 628-o'rinni va Hindiston mintaqasida 3 762-o'rinni egallagan.
š Auditoriya koārsatkichlari va dinamika
Š½ŠµŠ²ŃŠ“Š¾Š¼Š¾ sanasidan buyon loyiha tez oāsib, 78 624 obunachiga ega boāldi.
02 Noyabr, 2026 dagi oxirgi maālumotlarga koāra kanal barqaror faollikka ega. Oxirgi 30 kunda obunachilar soni -1 632 ga, soānggi 24 soatda esa -57 ga oāzgardi va umumiy qamrov yuqori darajada qolmoqda.
- Tasdiqlash holati: Tasdiqlanmagan
- Jalb etish (ER): Auditoriya oārtacha 1.85% darajada jalb etiladi. Nashrdan keyingi dastlabki 24 soatda kontent odatda umumiy obunachilar sonining 0.60% ini tashkil etuvchi reaksiyalarni toāplaydi.
- Post qamrovi: Har bir post oārtacha 1 452 marta koāriladi; birinchi sutkada odatda 471 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, dev kabi asosiy mavzularga jamlangan.
š Tavsif va kontent siyosati
Kanal uchun tavsif kiritilmagan.
Yuqori yangilanish chastotasi (oxirgi maālumot 03 Noyabr, 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.
78 624
Obunachilar
-5724 soatlar
-3377 kun
-1 63230 kun
Postlar arxiv
78 615
18+ join now ā¬ļø
āļø Hamas terrorists in killing Israelis
š¦ videos and pics
https://whatsapp.com/channel/0029VaBHQmLHVvTS8f2p1034
78 615
š
¾ļø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
78 615
+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
78 615
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
78 615
#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_official
78 615
def cardinalitySort(nums):
Ā Ā Ā return sorted(nums, key=lambda num: [bin(num).count('1'), num])
Cardinality sorting
78 615
#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() {
Ā // your code goes here
Ā 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++
78 615
def cardinalitySort(nums):
Ā Ā Ā return sorted(nums, key=lambda num: [bin(num).count('1'), num])
Cardinality sorting
JP Morgan
78 615
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
78 615
šÆ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_official
78 615
šÆHCL Off Campus Hiring for Freshers as Engineer Trainee | 3-5LPA
Job Role:- Engineer Trainee
Education:- Any Degree
Batch:- Any Batch
CTC/Salary:- 3-5 LPA
Apply Now:- www.allcoding1.com
Videoš
š
¾ļøInstagram:- https://instagram.com/allcoding1_official?utm_source=qr&igshid=NGExMmI2YTkyZg%3D%3D
āYouTube :- https://youtube.com/shorts/TMaL15W0p3g?feature=share
