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

CODING SOLUTION - Placement Jobs & Materials

Kanalga Telegram’da o‘tish

🌀 ” Our Only Aim Is To Let Get Placed To You In A Reputed Company. “ Contact Admin: Mail me for collab offcampusjobsindiaadmin@gmail.com instagram.com/offcampusjobsindia_it Our Website : www.offcampusjobsindia.com

Ko'proq ko'rsatish

Hindiston1 679Karyera157...

📈 Telegram kanali CODING SOLUTION - Placement Jobs & Materials analitikasi

CODING SOLUTION - Placement Jobs & Materials (@codingsolution_it) Ingliz til segmentidagi kanali faol ishtirokchi. Hozirda hamjamiyat 128 230 obunachidan iborat bo'lib, Karyera toifasida 157-o'rinni va Hindiston mintaqasida 1 679-o'rinni egallagan.

📊 Auditoriya ko‘rsatkichlari va dinamika

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

09 Noyabr, 2026 dagi oxirgi ma’lumotlarga ko‘ra kanal barqaror faollikka ega. Oxirgi 30 kunda obunachilar soni -2 026 ga, so‘nggi 24 soatda esa -31 ga o‘zgardi va umumiy qamrov yuqori darajada qolmoqda.

Tasdiqlash holati: Tasdiqlanmagan
Jalb etish (ER): Auditoriya o‘rtacha 1.37% darajada jalb etiladi. Nashrdan keyingi dastlabki 24 soatda kontent odatda umumiy obunachilar sonining 0.43% ini tashkil etuvchi reaksiyalarni to‘playdi.
Post qamrovi: Har bir post o‘rtacha 1 762 marta ko‘riladi; birinchi sutkada odatda 548 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 t.me/codingsolution_it, vector, codevita, string, graduate kabi asosiy mavzularga jamlangan.

📝 Tavsif va kontent siyosati

Muallif resursni shaxsiy fikrni ifoda etish maydoni sifatida ta’riflaydi:
“🌀 ” Our Only Aim Is To Let Get Placed To You In A Reputed Company. “ Contact Admin: Mail me for collab offcampusjobsindiaadmin@gmail.com instagram.com/offcampusjobsindia_it Our Website : www.offcampusjobsindia.com”

Yuqori yangilanish chastotasi (oxirgi ma’lumot 10 Noyabr, 2026 da olingan) sababli kanal doimo dolzarb va katta qamrovli bo‘lib qoladi. Analitika auditoriya kontent bilan faol hamkorlik qilishini, uni Karyera toifasidagi muhim ta’sir nuqtasiga aylantirishini ko‘rsatadi.

128 230

Obunachilar

-3124 soatlar

-4747 kun

-2 02630 kun

1 762

Post ko'rishlar

~ 54824 soatlar

~ 75548 soatlar

1.37%

Muloqot nisbati

Ma'lumot yo'q

Kuniga postlar

Ads index

Postlar arxiv

128 161

⚠️ ALL SLOTS SOLUTION GROUP: ⚠️ CAPGEMINI - t.me/capgemini_exam_discussion_group IBM - t.me/ibm_exam_discussion_group ACCENTURE - t.me/accenture_exam_discussion_group VIRTUSA - t.me/virtusa_exam_discussion_group TCS NQT - t.me/+V7_OuuZWqTAwZWZl t.me/codingsolution_IT ✅ Share post in ur college Whatsapp grps.

128 161

⚠️ Reminder - who didn't apply yet 2024 Batch - http://bit.ly/3TnRIC7 2023 Batch - http://bit.ly/3PJhlek 2022 Batch - http://bit.ly/3S7VGOm 2021 Batch - http://bit.ly/3baF6wX Electrical Engg - http://bit.ly/3zFEj0g Mechanical Engg - http://bit.ly/3oF3mKK ✅ Share in ur College WhatsApp Groups

128 161

TCS Exam Over for Everyone?

128 161

n,x=map(int, input().split()) a = list(map(int, input().split())) arr=[0] chk = 0 for i in range(n): arr.append(arr[i] + a[i]) if a[i] > x: chk = 1 if chk == 1: print ("-1") elif arr[n] <x: print (n) else: si = 1 li=n while si <= li: m =(si +li) // 2 chk=0 j=mid while j<n+1: if arr[j]-arr[j-m] > x: break j+=1 if j == n+1: si = m+1 else: li= m-1 print(si-1) Python Rajesh code Telegram - t.me/codingsolution_IT

128 161

TCS NQT [2PM] SOLUTION GROUP: telegram.me/codingsolution_IT telegram.me/+V7_OuuZWqTAwZWZl ✅ Share post in ur college Whatsapp grps.

128 161

Python Rajesh Code Telegram - t.me/codingsolution_IT

128 161

N=int(input()) A=[] A=list(map(int,input().split())) #print(A) Q=int(input()) ARRAY=[] from itertools import repeat ARRAY=[[]for i in repeat(None,Q)] #print(ARRAY) for i in range(0,Q): x,y=input().split() x=int(x) y=int(y) ARRAY[i].append(x) ARRAY[i].append(y) #print(ARRAY) for i in range(0,Q): count=0 if(ARRAY[i][0]==0): for j in range(len(A)): if(A[j]>=ARRAY[i][1]): count+=1 print(count) elif(ARRAY[i][0]==1): for j in range(len(A)): if(A[j]>ARRAY[i][1]): count+=1 print(count) else: pass Python Rajesh Code Telegram - t.me/codingsolution_IT

128 161

TCS NQT [2PM] SOLUTION GROUP: telegram.me/codingsolution_IT telegram.me/+V7_OuuZWqTAwZWZl ✅ Share post in ur college Whatsapp grps.

128 161

$#include using namespace std; string decimalToBinary(int n) { string s = bitset<64> (n).to_string(); const auto loc1 =$

#include <bits/stdc++.h> using namespace std; string decimalToBinary(int n) { string s = bitset<64> (n).to_string(); const auto loc1 = s.find('1'); if(loc1 != string::npos) return s.substr(loc1); return "0"; } int main() { int n; cin>>n; int ans=1; string s =decimalToBinary(n); for(int i=s.size()-1;i>=0;i--) { if(s[i]=='1') break; else ans++; } cout<<ans; return 0; } C++ Telegram - t.me/codingsolution_IT

128 161

Python Tom Code Telegram - t.me/codingsolution_IT

128 161

TCS NQT [2PM] SOLUTION GROUP: telegram.me/codingsolution_IT telegram.me/+V7_OuuZWqTAwZWZl ✅ Share post in ur college Whatsapp grps.

128 161

Python Tom Code Telegram - t.me/codingsolution_IT

128 161

Python Tom Code Telegram - t.me/codingsolution_IT

128 161

Python Tom Code Telegram - t.me/codingsolution_IT

128 161

TCS NQT [2PM] SOLUTION GROUP: telegram.me/codingsolution_IT telegram.me/+V7_OuuZWqTAwZWZl ✅ Share post in ur college Whatsapp grps.

128 161

C++ Chef and kids Code Telegram - t.me/codingsolution_IT

128 161

Python Magic code Telegram - t.me/codingsolution_IT

128 161

Python Tom Code Telegram - t.me/codingsolution_IT