allcoding1_official

Kanalga Telegram’da o‘tish

Ko'proq ko'rsatish

Hindiston3 460 Texnologiyalar & Aralashmalar1 507...

📈 Telegram kanali allcoding1_official analitikasi

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

📊 Auditoriya ko‘rsatkichlari va dinamika

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

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

Tasdiqlash holati: Tasdiqlanmagan
Jalb etish (ER): Auditoriya o‘rtacha 2.71% darajada jalb etiladi. Nashrdan keyingi dastlabki 24 soatda kontent odatda umumiy obunachilar sonining 0.84% ini tashkil etuvchi reaksiyalarni to‘playdi.
Post qamrovi: Har bir post o‘rtacha 2 308 marta ko‘riladi; birinchi sutkada odatda 713 ta ko‘rish yig‘iladi.
Reaksiyalar va o‘zaro ta’sir: Auditoriya faol: har bir postga o‘rtacha 3 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 29 Iyun, 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.

85 284

Obunachilar

-7724 soatlar

-3927 kunlar

-1 49430 kunlar

2 308

Post ko'rishlar

~ 71324 soatlar

~ 1 09648 soatlar

2.71%

Muloqot nisbati

Ma'lumot yo'q

Kuniga postlar

Ads index

beta

Postlar arxiv

85 229

(A)

85 229

🎯HCL Technologies Off Campus Freshers Recruitment Hiring For Analyst Role | 4.2 LPA Job Role Senior analyst Education B.Tech Experience 0-2.5 Years CTC/Salary 4.2 LPA Apply Now:- http://www.allcoding1.com Telegram:- @allcoding1_official

85 229

inline string IntToString(LL a) { char x[100]; sprintf(x, "%lld", a); string s = x; return s; } inline LL StringToInt(string a) { char x[100]; LL res; strcpy(x, a.c_str()); sscanf(x, "%lld", &res); return res; } inline string GetString(void) { char x[1000005]; scanf("%s", x); string s = x; return s; } inline string uppercase(string s) { int n = SIZE(s); REP(i, n) if (s[i] >= 'a' && s[i] <= 'z') s[i] = s[i] - 'a' + 'A'; return s; } inline string lowercase(string s) { int n = SIZE(s); REP(i, n) if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a'; return s; } inline void OPEN(string s) { #ifndef TESTING freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); #endif }

85 229

x = float(input()) n = int(input()) If n<1 and n>3: print("Invalid Input") else: print(round(x,n))

85 229

import java.lang.Math; class Gfg { // driver code public static void main(String args[]) { // float numbers float x = 4567.9874f; // find the closest int for these floats System.out.println(Math.round(x)); float y = -3421.134f; // find the closest int for these floats System.out.println(Math.round(y)); double positiveInfinity = Double.POSITIVE_INFINITY; // returns the Integer.MAX_VALUE value when System.out.println(Math.round(positiveInfinity)); } }

85 229

IBM EXAM ANS 6PM Telegram:- @allcoding1_official Discussion group:- @IBM_codingAns

85 229

x = float(input()) n = int(input()) print(round(x,n) Python Q) abridged Ans Telegram:- @allcoding1_official

85 229

IBM EXAM ANS 6PM Telegram:- @allcoding1_official

85 229

Code for changeCase question in python 3 Telegram:-

85 229

string changeCase(string s, int n) { int n = s.size(); string ans = ""; if (n == 1) { for (int i = 0; i < n; i++) { int a = 0; if (s[i] == ' ') a = 1; else if (a == 1) ans += toupper(s[i]); else ans += s[i]; } } else if (n == 2) { for (int i = 0; i < n; i++) { int a = 0; if (s[i] == ' ') ans += '-'; else ans += s[i]; } } else if (n == 3) { for (int i = 0; i < n; i++) { int a = 0; if (s[i] == ' ') ans += '_'; else ans += s[i]; } } else if (n == 4) { ans += toupper(s[0]); for (int i = 1; i < n; i++) { int a = 0; if (s[i] == ' ') a = 1; else if (a == 1) ans += toupper(s[i]); else ans += s[i]; } } return ans; } C++ Telegram:- @allcoding1_official

85 229

Python Telegram - @allcoding1_official

85 229

C++ Telegram -

85 229

IBM EXAM ANS 5PM Telegram:- @allcoding1_official Discussion group:- @IBM_codingAns