uz
Feedback

Firibgarlarga uchmang! Telemetrio bunday kanallarni topadi va belgilaydi 👉 Belgini ko‘rmoqchi bo‘lsangiz, obuna bo‘ling

allcoding1_official

allcoding1_official

Kanalga Telegram’da o‘tish

📈 Telegram kanali allcoding1_official analitikasi

allcoding1_official (@allcoding1_official) Ingliz til segmentidagi kanali faol ishtirokchi. Hozirda hamjamiyat 78 961 obunachidan iborat bo'lib, Texnologiyalar & Aralashmalar toifasida 1 613-o'rinni va Hindiston mintaqasida 3 828-o'rinni egallagan.

📊 Auditoriya ko‘rsatkichlari va dinamika

невідомо sanasidan buyon loyiha tez o‘sib, 78 961 obunachiga ega bo‘ldi.

25 Oktabr, 2026 dagi oxirgi ma’lumotlarga ko‘ra kanal barqaror faollikka ega. Oxirgi 30 kunda obunachilar soni -1 654 ga, so‘nggi 24 soatda esa -52 ga o‘zgardi va umumiy qamrov yuqori darajada qolmoqda.

  • Tasdiqlash holati: Tasdiqlanmagan
  • Jalb etish (ER): Auditoriya o‘rtacha 1.79% darajada jalb etiladi. Nashrdan keyingi dastlabki 24 soatda kontent odatda umumiy obunachilar sonining 0.62% ini tashkil etuvchi reaksiyalarni to‘playdi.
  • Post qamrovi: Har bir post o‘rtacha 1 414 marta ko‘riladi; birinchi sutkada odatda 489 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 26 Oktabr, 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 961
Obunachilar
-5224 soatlar
-3677 kun
-1 65430 kun
Postlar arxiv
Paid Promotion:- @Priya_i

sticker.webp0.13 KB

photo content
+6

heights = [int(i) for i in input().split()] freq_dict = {} for h in heights: if h in freq_dict: freq_dict[h] += 1 else: freq_
heights = [int(i) for i in input().split()] freq_dict = {} for h in heights: if h in freq_dict:   freq_dict[h] += 1 else:   freq_dict[h] = 1 for h in sorted(freq_dict): print(h, freq_dict[h])

[Posted by Dushyant] [🖼 heights = [int(i) for i in input().split()] freq_dict = {} for h in heights: if h in freq_dict: freq
[Posted by Dushyant] [🖼 heights = [int(i) for i in input().split()] freq_dict = {} for h in heights: if h in freq_dict:   freq_dict[h] += 1 else:   freq_dict[h] = 1 for h in sorted(freq_dict): print(h, freq_dict[h])] heights = [int(i) for i in input().split()] freq_dict = {} for h in heights: if h in freq_dict:   freq_dict[h] += 1 else:   freq_dict[h] = 1 for h in sorted(freq_dict): print(h, freq_dict[h])

#include <iostream> #include <string> #include <vector> using namespace std; int numDecodings(string msg) {     int MOD = 1000000007;     int n = msg.size();         vector<long long> dp(n + 1, 0);     dp[0] = 1;         if (msg[0] == '0')         dp[1] = 0;     else if (msg[0] == '*')         dp[1] = 9;     else         dp[1] = 1;         for (int i = 2; i <= n; ++i) {         if (msg[i - 1] == '0') {                         if (msg[i - 2] == '1' || msg[i - 2] == '2')                 dp[i] += dp[i - 2];             else if (msg[i - 2] == '*')                 dp[i] += 2 * dp[i - 2];         } else if (msg[i - 1] >= '1' && msg[i - 1] <= '9') {                   dp[i] += dp[i - 1];                         if (msg[i - 2] == '1' || (msg[i - 2] == '2' && msg[i - 1] <= '6'))                 dp[i] += dp[i - 2];             else if (msg[i - 2] == '*') {                                 if (msg[i - 1] <= '6')                     dp[i] += 2 * dp[i - 2];                 else                     dp[i] += dp[i - 2];             }         } else if (msg[i - 1] == '*') {             dp[i] += 9 * dp[i - 1];                         if (msg[i - 2] == '1')                 dp[i] += 9 * dp[i - 2];             else if (msg[i - 2] == '2')                 dp[i] += 6 * dp[i - 2];             else if (msg[i - 2] == '*')                 dp[i] += 15 * dp[i - 2];         }                 dp[i] %= MOD;     }         return dp[n]; } Number of ways decode

photo content

photo content
+1

photo content
+1

photo content
+1

photo content
+1

#include <iostream> #include <vector> #include <algorithm> using namespace std; int findLIS(vector<int>& s) {     vector<int> tails;     for (int x : s) {         auto it = lower_bound(tails.begin(), tails.end(), x);         if (it == tails.end()) {             tails.push_back(x);         } else {             *it = x;         }     }     return tails.size(); }   Swiggy LIS

#include <bits/stdc++.h> using namespace std; int jumps(int flagHeight, int bigJump) {     return flagHeight / bigJump+flagheight% bigJump; }.  Swiggy Jump to The Flag

long getMaxPrisonHole(int n, int m, vector x, vector y) {     vector xb(n+1, true);     vector yb(m+1, true);         for(int i : x) {         xb[i] = false;     }         for(int i : y) {         yb[i] = false;     }         long cx = 0, xm = LONG_MIN, cy = 0, ym = LONG_MIN;         for(int i = 0; i < xb.size(); i++) {         if(xb[i]) {             cx = 0;         } else {             cx++;             xm = max(cx, xm);         }     }         for(int i = 0; i < yb.size(); i++) {         if(yb[i]) {             cy = 0;         } else {             cy++;             ym = max(cy, ym);         }     }         return (xm+1) * (ym+1); }  Swiggy Prison Break

public static int selectStock(int saving, int[] currentValue, int[] futureValue) {         int n = currentValue.length;         int[][] dp = new int[n + 1][saving + 1];         for (int i = 1; i <= n; i++) {             for (int j = 0; j <= saving; j++) {                 dp[i][j] = dp[i - 1][j];                 if (j >= currentValue[i - 1]) {                     dp[i][j] = Math.max(dp[i][j], dp[i - 1][j - currentValue[i - 1]] + futureValue[i - 1] - currentValue[i - 1]);                 }             }         }         return dp[n][saving];     }.  Swiggy Selecting  Stocks

📌IT learning courses 📌All programing courses 📌Abdul bari courses 📌Ashok IT Tutorials + Books + Courses + Trainings + Work
+8
📌IT learning courses 📌All programing courses 📌Abdul bari courses 📌Ashok IT Tutorials + Books + Courses + Trainings + Workshops + Educational Resources 🔹Data science 🔹Python 🔹Artificial Intelligence 🔹AWS Certified 🔹Cloud 🔹BIG DATA 🔹Data Analytics 🔹BI 🔹Google Cloud Platform 🔹IT Training 🔹MBA 🔹Machine Learning 🔹Deep Learning 🔹Ethical Hacking 🔹SPSS 🔹Statistics 🔹Data Base 🔹Learning language resources English , 🇫🇷 All courses (100 rupees) Contact:- @meterials_available

📌IT learning courses 📌All programing courses 📌Abdul bari courses 📌Ashok IT Tutorials + Books + Courses + Trainings + Work
+8
📌IT learning courses 📌All programing courses 📌Abdul bari courses 📌Ashok IT Tutorials + Books + Courses + Trainings + Workshops + Educational Resources 🔹Data science 🔹Python 🔹Artificial Intelligence 🔹AWS Certified 🔹Cloud 🔹BIG DATA 🔹Data Analytics 🔹BI 🔹Google Cloud Platform 🔹IT Training 🔹MBA 🔹Machine Learning 🔹Deep Learning 🔹Ethical Hacking 🔹SPSS 🔹Statistics 🔹Data Base 🔹Learning language resources English , 🇫🇷 All courses (100 rupees) Contact:- @meterials_available

Advanced SubArray Problem
Advanced SubArray Problem

Elections code
Elections code

int winning_party(int voters, int votes[]) { &nbsp;&nbsp;&nbsp; unordered_map vote_counts; &nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nb
int winning_party(int voters, int votes[]) {     unordered_map vote_counts;         for (int i = 0; i < voters; ++i) {         vote_counts[votes[i]]++;     }         for (auto it = vote_counts.begin(); it != vote_counts.end(); ++it) {         if (it->second > voters / 2) {             return it->first;         }     }         return -1; } Elections