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 529
class Solution {
public:
void bfs(vector<vector<int>>&vis,vector<vector<char>>&grid,int i,int j,int n,int m)
{
vis[i][j]=1;
queue<pair<int,int>>q;
q.push({i,j});
while(!q.empty())
{
int row=q.front().first;
int col=q.front().second;
q.pop();
int delrow[4]={1,0,-1,0};
int delcol[4]={0,1,0,-1};
for(int k=0;k<=3;k++){
int nrow=row+delrow[k];
int ncol=col+delcol[k];
if(nrow>=0 and nrow<n and ncol>=0 and ncol<m and grid[nrow][ncol]=='1' and !vis[nrow][ncol])
{
vis[nrow][ncol]=1;
q.push({nrow,ncol});
}
}
}
}
int numIslands(vector<vector<char>>& grid) {
int n=grid.size();
int m=grid[0].size();
vector<vector<int>>vis(n,vector<int>(m,0));
int cnt=0;
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if(!vis[i][j] and grid[i][j]=='1')
{
cnt++;
bfs(vis,grid,i,j,n,m);
}
}
}
return cnt;
}
};
Zeta ✅
Telegram:- @allcoding1
21 529
class Solution {
public:
void bfs(vector<vector<int>>&vis,vector<vector<char>>&grid,int i,int j,int n,int m)
{
vis[i][j]=1;
queue<pair<int,int>>q;
q.push({i,j});
while(!q.empty())
{
int row=q.front().first;
int col=q.front().second;
q.pop();
int delrow[4]={1,0,-1,0};
int delcol[4]={0,1,0,-1};
for(int k=0;k<=3;k++){
int nrow=row+delrow[k];
int ncol=col+delcol[k];
if(nrow>=0 and nrow<n and ncol>=0 and ncol<m and grid[nrow][ncol]=='1' and !vis[nrow][ncol])
{
vis[nrow][ncol]=1;
q.push({nrow,ncol});
}
}
}
}
int numIslands(vector<vector<char>>& grid) {
int n=grid.size();
int m=grid[0].size();
vector<vector<int>>vis(n,vector<int>(m,0));
int cnt=0;
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if(!vis[i][j] and grid[i][j]=='1')
{
cnt++;
bfs(vis,grid,i,j,n,m);
}
}
}
return cnt;
}
};
Zeta ✅
Telegram:- @allcoding1
21 529
KPMG Off Campus Drive Hiring 2024 | Front End Developer | 4 LPA+
Job Title : Front End Developer
Qualification : B.E / B.Tech
Batch : Any Batch
Package : 4 LPA+
Apply Now:- www.allcoding1.com
Telegram:- @allcoding1
21 529
SELECT
category,
title,
total_stock
FROM (
SELECT
p.category,
p.title,
SUM(w.quantity) AS total_stock
FROM
products p
JOIN
warehouse w ON p.product_id = w.product_id
GROUP BY
p.category, p.title
HAVING
total_stock > 10
) AS filtered_data
ORDER BY
category ASC, title ASC, total_stock DESC;
IBM✅
Telegram:- @allcoding1
21 529
🎯Google Internship 2024 | Software Student Training in Engineering Program | Apply Now
Job Role : Software Student Training in Engineering Program
Qualification : B.E/B.Tech/B.Sc
Experience : Freshers
Last Date : 19 January 2024
Apply Now:- www.allcoding1.com
Telegram:- @allcoding1
21 529
🎯Phone pe hiring
Job role:- Advisor,ONDC
Qualification:- Any
Experience:- 0-2years
Location:- Bangalore
Apply Now:- www.allcoding1.com
Telegram:- @allcoding1
21 529
🎯Phone pe hiring
Job role:- Advisor,ONDC
Qualification:- Any
Experience:- 0-2years
Location:- Bangalore
Apply Now:- www.allcoding1.com
Telegram:- @allcoding1_official
21 529
Repost from allcoding1_official
+1#scammer
Please report 👇
@offical1allcoding , Vds , @Allcodingoffical
The changing names
Guys ♥️ be careful don't pay money
21 529
Repost from allcoding1_official
Guys ♥️
@allcoding, @Allcodingoffical1, @offical1allcoding @Allcodingoffical, @codingoffical and @Allcodingofficalmain it's not me don't lose your money
#scammer
Please report
Please share with your friends and telegram Group's
21 529
🎯 IBM Off Campus Drive Hiring 2024 | Sofware Developer | 6-20 LPA
Job Role : Software Developer
Qualification : BE/ B.Tech/ ME/ M.Tech
Experience : 0-3 years
Package : 6-20 LPA*
Apply Now:- www.allcoding1.com
Telegram:- @allcoding1
21 529
Accenture Work From Home
🎯Position: HR Partner Analyst
Qualification: Any Graduate
Experience: 0-3 Years
Location: Remote (Bangalore Office)
Salary: 3 LPA – 5 LPA
Apply Now:- www.allcoding1.com
Telegram:- @allcoding1
21 529
🎯Ford Off Campus Drive Hiring 2024 | 2022/2023 Batches | 4 LPA
Job Role : Multiple Roles
Qualification : B.E/B.Tech
Batch : 2022/2023
Package : 4 LPA+
Apply Fast :- www.allcoding1.com
Telegram:- @allcoding1
21 529
int solve(vector<vector<int>> arr) {
int n = arr.size();
vector<vector<int>> dp(n, vector<int>(n));
int maxi = 0;
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
if(i == 0 || j == 0) {
dp[i][j] = arr[i][j];
} else if(arr[i][j] == 1) {
dp[i][j] = min({dp[i-1][j], dp[i][j-1], dp[i-1][j-1]}) + 1;
}
maxi = max(maxi, dp[i][j]);
}
}
return maxi;
}
IBM
C++
Telegram:- @allcoding1
