uz
Feedback
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 84 584 obunachidan iborat bo'lib, Texnologiyalar & Aralashmalar toifasida 1 497-o'rinni va Hindiston mintaqasida 3 527-o'rinni egallagan.

📊 Auditoriya ko‘rsatkichlari va dinamika

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

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

  • Tasdiqlash holati: Tasdiqlanmagan
  • Jalb etish (ER): Auditoriya o‘rtacha 2.01% darajada jalb etiladi. Nashrdan keyingi dastlabki 24 soatda kontent odatda umumiy obunachilar sonining 0.85% ini tashkil etuvchi reaksiyalarni to‘playdi.
  • Post qamrovi: Har bir post o‘rtacha 1 701 marta ko‘riladi; birinchi sutkada odatda 723 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, dev kabi asosiy mavzularga jamlangan.

📝 Tavsif va kontent siyosati

Kanal uchun tavsif kiritilmagan.

Yuqori yangilanish chastotasi (oxirgi ma’lumot 11 Iyul, 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.

84 584
Obunachilar
-3024 soatlar
-4257 kunlar
-1 55630 kunlar
Postlar arxiv
LTTS & IBM EXAM Ans @allcoding1 @allcoding1 Share post in ur college Whatsapp grps.

Tech Mahindra Interview questions 1) show your I'd proff? 2) self intro? 3) which language your are comfortable ? 4) what is structure? 5) what is calloc and mallic? 6)static memory allocation? 7)Dynamic memory allocation? 8)What is null pointer? Write the program 9)Fibonacci serious and explain? 10)speak non technical topic in 5 mins ? 11) project details? 12) do u have any questions? Telegram:-@allcoding1

telegram:-@allcoding1
telegram:-@allcoding1

class Player: def init(self,name,team,price,skills,debut,country): self.name=name self.team=team self.price=price self.skills=skills self.debut=debut self.country=country class IPL: def init(self,playerList, dict): self.dict=dict self.playerList=playerList def findMaximumPrice(self): max_obj=max(self.playerList, key=lambda x:x.price) return max_obj def sortByPrice(self): s=[] s=sorted(self.teamList, key=lambda x:x.price) s1=[] for i in s: s1.append(i.price) if len(s1)==0: return None else: return s1 if name =='main': playerList=[] dict={} limit=int(input()) for j in range(limit): name=input() team=input() price=float(input()) debut=input() skills=input() country=input() //allcoding1 playerList.append(Player(name,team,price,country,skills,debut)) obj=League("dict",playerList) r1=obj.findMaximumPrice() if(r1!=None): print(r1.name) print(r1.team) print(r1.price) print(r1.skills) print(r1.debut) print(r1.country) else: print("NO Data Found") r2=obj.sortByPrice() for i in r2: print(i) Phyton

IPL Unix code... Python Unix code telegram:-@allcoding1
IPL Unix code... Python Unix code telegram:-@allcoding1

TCS IRA APRIL 25th TCS IRA PYTHON 1. Numerical regression 2.2003 3.neural networks 4.2017 5.machine learning 6. Go stright away into the rework 7.A 8.ALL THE ABOVE 9.C 10.reason for the meeting 11.B 12.A 13.ALL 14.D 15.B 16.Salad 17.c 18.false 19. B 20.B 21.D 22.C 23.A 24.apple 25.martime museum 26.>2000 27.C 28.B 29.B 30.A 31. 32.1 33.D 34.A 35.1 36.PRESERVE WATER RESERVE 37.ERROR 38.false 39.15 40. A or C 41.A 42. For sale 43.C 44.20 45.syntax error 46.D 47.Sweden D 48.northern lights can on scotland 49.0 50.D TCS IRA PYTHON Telegram:-@allcoding1

TCS IRA APRIL 25th TCS IRA PYTHON 1. Numerical regression 2.2003 3.neural networks 4.2017 5.machine learning 6. Go stright away into the rework 7.A 8.ALL THE ABOVE 9.C 10.reason for the meeting 11.B 12.A 13.ALL 14.D 15.B 16.Salad 17.c 18.false 19. B 20.B 21.D 22.C 23.A 24.apple 25.martime museum 26.>2000 27.C 28.B 29.B 30.A 31. 32.1 33.D 34.A 35.1 36.PRESERVE WATER RESERVE 37.ERROR 38.false 39.15 40. A or C 41.A 42. For sale 43.C 44.20 45.syntax error 46.D 47.Sweden D 48.northern lights can on scotland 49.0 50.D Telegram:-@allcoding1

TCS IRA APRIL 25th TCS IRA PYTHON 1. Numerical regression 2.2003 3.neural networks 4.2017 5.machine learning 6. Go stright away into the rework 7.A 8.ALL THE ABOVE 9.C 10.reason for the meeting 11.B 12.A 13.ALL 14.D 15.B 16.Salad 17.c 18.false 19. B 20.B 21.D 22.C 23.A 24.apple 25.martime museum 26.>2000 27.C 28.B 29.B 30.A 31.country London usa careerits 32.1 33.D 34.A 35.1 36.PRESERVE WATER RESERVE 37.ERROR 38.false 39.15 40. A or C 41.A 42. For sale 43.C 44.20 45.syntax error 46.D 47.Sweden D 48.northern lights careerits on scotland 49.0 50.D TCS IRA PYTHON

TCS IRA APRIL 25th TCS IRA PYTHON 1. Numerical regression 2.2003 3.neural networks 4.2017 5.machine learning 6. Go stright away into the rework 7.A 8.ALL THE ABOVE 9.C 10.reason for the meeting 11.B 12.A 13.ALL 14.D 15.B 16.Salad 17.c 18.false 19. B 20.B 21.D 22.C 23.A 24.apple 25.martime museum 26.>2000 27.C 28.B 29.B 30.A 31.country London usa careerits 32.1 33.D 34.A 35.1 36.PRESERVE WATER RESERVE 37.ERROR 38.false 39.15 40. A or C 41.A 42. For sale 43.C 44.20 45.syntax error 46.D 47.Sweden D 48.northern lights careerits on scotland 49.0 50.D TCS IRA PYTHON Telegram:-@allcoding1

IRA java: 1)all the above 2) option 1 and 2 3)Immediate line 15) true 16)Mishra record.... 17) option A 18)query comprises successful....... 19) option A 20) option D 21) option C 22)6 23)all 24)1 25)3 26)letsfind course 27) option B 28) option D 29)Yes 30)Yes 31) option C 32) option D 33) option A 34)keep smiling will be printed inside allcoding1 the doubled border 35) option A 36)arrayinde... 37)false 38) option B 39)it will sort ......(option D) 40)there is no issue with the code. 41) option C 41) option C 42) optionD 43)error 44)a=21 45)70 46)0 47)23 48)an integer value 49)-1 50)falsefalse Telegram:-@allcoding1

IRA java: 1)all the above 2) option 1 and 2 3)Immediate line 35) option A 36)arrayind... 37)false 38) option B 39)it will sort ......(option D) 40)there is no issue with thecode. 41) option C 46)0 telegram:-@allcoding1

IRA Python: 1) classification 2)2003 3) machine learning 4)2018 5)Machine learning 6)Apologize to the client for not meeting his expectation 11)Display the number of characters 36)1 3 5 37)false 38)New employee id name 50)false false Telegram:-@allcoding1

ArrayList<Integer> ar = new ArrayList<Integer>(); ArrayList<Integer> ar1 = new ArrayList<Integer>(); ArrayList<Integer> arr2= new ArrayList<Integer>(); ArrayList<Integer> sza= new ArrayList<Integer>(); ArrayList<Integer> p_n= new ArrayList<Integer>(); Scanner sc = new Scanner(System.in); int a_size= sc.nextInt(); int m_size=sc.nextInt(); int[] a = new int[a_size]; for(int i=0;i<a_size;i++){ a[i]=sc.nextInt(); arr2.add(a[i]); } int[] p = new int[m_size]; for(int i=0;i<m_size;i++){ p[i]=sc.nextInt(); p_n.add(p[i]); } int[] sz=new int[m_size]; for(int i=0;i<m_size;i++){ sz[i]=sc.nextInt(); sza.add(sz[i]); } for(int i=0;i<a_size;i++) { for(int j=0;j<m_size;j++) { if(a[i]==p[j]) { ar.add(p[j]); } } } int [] fr = new int [ar.size()]; int visited = -1; for(int i = 0; i < ar.size(); i++){ int count = 1; for(int j = i+1; j < ar.size(); j++){ if(ar.get(i).equals(ar.get(j))){ count++; fr[j] = visited; } } if(fr[i] != visited) fr[i] = count; } for(int i = 0; i < fr.length; i++){ if(fr[i] != visited) ar1.add(fr[i]); } ArrayList<Integer> pnew = new ArrayList<Integer>(); for(int l=0;l<sz.length;l++) { for(int h=0;h<sza.get(l);h++) { pnew.add(p_n.get(l)); } } int count=0; for(int i = 0; i < pnew.size(); i++) { Sequences concatenation code

#include <bits/stdc++.h> using namespace std; int func(int n){ int cnt=0; for (int i=1; i<=sqrt(n); i++) { if (n%i == 0) { if (n/i == i) cnt++; else cnt+=2; } } return cnt; } int calcSum(int arr[], int n, int k) { int sum = 0; for (int i = 0; i < k; i++) sum += arr[i]; int mx=func(sum); for (int i = k; i < n; i++) { sum = (sum - arr[i - k]) + arr[i]; //allcoding1 mx=max(mx,func(sum)); } return mx; } int main() { // Write C++ code here int n,k; cin>>n>>k; int arr[n]; for(int i=0;i<n;i++) cin>>arr[i]; cout<<calcSum(arr, n, k)*k; return 0; } MSPS Code C++

photo content
+1