allcoding1
Kanalga Telegram’da o‘tish
Ko'proq ko'rsatish
📈 Telegram kanali allcoding1 analitikasi
allcoding1 (@allcoding1) Ingliz til segmentidagi kanali faol ishtirokchi. Hozirda hamjamiyat 20 835 obunachidan iborat bo'lib, Taʼlim toifasida 9 649-o'rinni va Hindiston mintaqasida 19 599-o'rinni egallagan.
📊 Auditoriya ko‘rsatkichlari va dinamika
невідомо sanasidan buyon loyiha tez o‘sib, 20 835 obunachiga ega bo‘ldi.
22 Oktabr, 2026 dagi oxirgi ma’lumotlarga ko‘ra kanal barqaror faollikka ega. Oxirgi 30 kunda obunachilar soni -425 ga, so‘nggi 24 soatda esa -9 ga o‘zgardi va umumiy qamrov yuqori darajada qolmoqda.
- Tasdiqlash holati: Tasdiqlanmagan
- Jalb etish (ER): Auditoriya o‘rtacha 1.26% darajada jalb etiladi. Nashrdan keyingi dastlabki 24 soatda kontent odatda umumiy obunachilar sonining N/A% ini tashkil etuvchi reaksiyalarni to‘playdi.
- Post qamrovi: Har bir post o‘rtacha 263 marta ko‘riladi; birinchi sutkada odatda 0 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, learning kabi asosiy mavzularga jamlangan.
📝 Tavsif va kontent siyosati
Kanal uchun tavsif kiritilmagan.
Yuqori yangilanish chastotasi (oxirgi ma’lumot 23 Oktabr, 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.
20 835
Obunachilar
-924 soatlar
-927 kun
-42530 kun
Postlar arxiv
20 835
#include <iostream>
#include <string>
using namespace std;
bool isGoodString(string s) {
int count = 0;
for (char c : s) {
if (c == 'a') {
count++;
} else {
count--;
}
if (count < 0) {
return false;
}
}
return count == 0;
}
int main() {
string s = "aaabbbaaa";
cout << "Is the string good? " << (isGoodString(s) ? "Yes" : "No") << endl;
return 0;
}
Count Good Triples
C++
HackWithInfy
20 835
#include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;
const int MOD = 1e9 + 7;
vector<vector<int>> tree;
vector<int> a;
unordered_map<int, int> countMap;
bool checkPalindrome(unordered_map<int, int>& countMap) {
int oddCount = 0;
for (auto& it : countMap) {
if (it.second % 2 != 0) oddCount++;
if (oddCount > 1) return false;
}
return true;
}
int dfs(int node) {
int ans = 0;
countMap[a[node]]++;
if (checkPalindrome(countMap)) {
ans = 1;
}
for (auto& child : tree[node]) {
ans += dfs(child);
ans %= MOD;
}
countMap[a[node]]--; // Backtrack to remove the current node's count
return ans;
}
int main() {
int n;
cin >> n;
tree.resize(n + 1);
a.resize(n + 1);
vector<int> par(n + 1);
for (int i = 2; i <= n; i++) {
cin >> par[i];
tree[par[i]].push_back(i);
}
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int ans = dfs(1);
cout << ans << endl;
return 0;
}
c++
Palindromic subtrees
20 835
Repost from allcoding1
+9📌IT learning courses
📌All programing courses
📌Abdul bari courses
📌Ashok IT
100 rupees
Contact:- @meterials_available
20 835
Repost from allcoding1
+9📌IT learning courses
📌All programing courses
📌Abdul bari courses
📌Ashok IT
100 rupees
Contact:- @meterials_available
20 835
Black-Hat Hacking All Courses
💻 Android Hacking Course
💻 PC Hacking Course
💻 Advance Carding Course
💻 Account Cracking Course
💻 Networking and Scanning
💻 ATM Hacking Course
💻 Advance Spamming Course
📌 365 Data Science
📌 Devops Notes ( Including Interviews Questions)
📌 Ashok IT AWS & Ashok IT Devops
100 rupees
Contact:- @meterials_available
20 835
Walkin interview drive for US mortgage for freshers 2023, 24, 22 yr passed out
Work location - Crane Consulting firm , Kormangala, Bangalore
Knowledge needed in foreclosure, bankruptcy, underwriting , 4cs
Its held on April 3th wed , 4th thu - 10.30 am till 12.30 pm
220000 pa . 17,500 take home,
6 pm login / US shift
Venue address -Crane Consulting , Attic Trishul 12, G, 1 & 2 Floors, 7th Cross Rd, 3rd Block, Koramangala, Bengaluru, 560034
20 835
🎯Zoho Is Hiring
Role : Software Developer
Qualification:- any
Batch:- any
Location : Chennai
Apply Now:- www.allcoding1.com
Telegram:- @allcoding1
20 835
vector<ll> babuswiggyjayega(vector<ll> a, vector<ll> b)
{
ll n1 = a.size(), n2 = b.size();
ll i = 0, j = 0, k = 0;
vector<ll> golu(n1 + n2);
while (i < n1 && j < n2)
{
if (a[i] < b[j])
golu[k++] = a[i++];
else
golu[k++] = b[j++];
}
while (i < n1)
golu[k++] = a[i++];
while (j < n2)
golu[k++] = b[j++];
return golu;
}
Merge 2 Arrays
Telegram:- @allcoding1
