uz
Feedback

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

CODING SOLUTION - Placement Jobs & Materials

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

📈 Telegram kanali CODING SOLUTION - Placement Jobs & Materials analitikasi

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

📊 Auditoriya ko‘rsatkichlari va dinamika

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

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

  • Tasdiqlash holati: Tasdiqlanmagan
  • Jalb etish (ER): Auditoriya o‘rtacha 1.55% 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 977 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 18 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.

127 551
Obunachilar
-3924 soatlar
-5647 kun
-2 21030 kun
Postlar arxiv
#include<stdio.h> int main() { int n1, n2, n3, i, j; printf("\n Enter the number of elements for First Array : "); scanf("%d", &n1); //Array Size Declaration int a[n1]; //Array Declaration printf("\nEnter the elements for First Array : "); for(i = 0; i < n1; i++) { scanf("%d", &a[i]); } printf("\n Enter the number of elements for Second Array : "); scanf("%d", &n2); //Array Size Declaration int b[n2]; //Array Declaration printf("\nEnter the elements for Second Array : "); for(i = 0; i < n2; i++) { scanf("%d", &b[i]); } n3 = n1 + n2; //Array Size Declaration int c[n3]; //Array Declaration for(i = 0; i < n1; i++) { c[i] = a[i]; } for(i = 0, j = n1; j < n3 && i < n2; i++, j++) { c[j] = b[i]; } printf("\n a[%d] Array Elements After Merging \n", n3); for(i = 0; i < n3; i++) { printf(" %d \t ",c[i]); } return 0; } C++ Two Array A and B of size N and M Telegram - t.me/codingsolution_IT
30 Iyul 2022, 07:12

#include <stdio.h> void main() { int arr1[100]; int arr2[100]; int arr3[100]; int n,mm=1,ctr=0; int i, j; printf("\n\nCount total number of duplicate elements in an array:\n"); printf("---------------------------------------------------------\n"); printf("Input the number of elements to be stored in the array :"); scanf("%d",&n); printf("Input %d elements in the array :\n",n); for(i=0;i<n;i++) { printf("element - %d : ",i); scanf("%d",&arr1[i]); } /*----------------- copy in other array ------------------------------------*/ for(i=0;i<n; i++) { arr2[i]=arr1[i]; arr3[i]=0; } /*------------------- mark the elements are duplicate -------------------------*/ for(i=0;i<n; i++) { for(j=0;j<n;j++) { if(arr1[i]==arr2[j]) { arr3[j]=mm; mm++; } } mm=1; } /*--------------- Prints the array ------------------------------------*/ for(i=0; i<n; i++) { if(arr3[i]==2){ctr++;} } printf("The total number of duplicate elements found in the array is: %d \n", ctr); printf("\n\n"); } C++ Telegram - t.me/codingsolution_IT
30 Iyul 2022, 07:10

photo content
30 Iyul 2022, 07:10

C++ Telegram - t.me/codingsolution_IT
+1
C++ Telegram - t.me/codingsolution_IT
30 Iyul 2022, 06:23
30 Iyul 2022, ~07:05

INFOSYS EXAM 3PM SOLUTION GROUP: t.me/codingsolution_IT t.me/infosys_exam_discussion_groups ✅ Share post in ur college Whatsapp grps.
30 Iyul 2022, 06:20
30 Iyul 2022, ~07:13

#include <bits/stdc++.h> using namespace std; int maxProfit(vector<int>& Arr, int n) { vector<vector<int>> ahead(2,vector<int> (3,0)); vector<vector<int>> cur(2,vector<int> (3,0)); for(int ind = n-1; ind>=0; ind--){ for(int buy = 0; buy<=1; buy++){ for(int cap=1; cap<=2; cap++){ if(buy==0){ cur[buy][cap] = max(0+ahead[0][cap], -Arr[ind] + ahead[1][cap]); } if(buy==1){ cur[buy][cap] = max(0+ahead[1][cap], Arr[ind] + ahead[0][cap-1]); } } } ahead = cur; } return ahead[0][2]; } int main() { int n; cin>>n; vector<int> prices; for(int i=0;i<n;i++) { int temp; cin>>temp; prices.push_back(temp); } cout<<maxProfit(prices, n); } C++ Maximum profit trader Code Telegram - t.me/codingsolution_IT
30 Iyul 2022, 06:17

C++ Telegram - t.me/codingsolution_IT
+1
C++ Telegram - t.me/codingsolution_IT
30 Iyul 2022, 06:10

def minOperations(arr1, arr2, i, j): &nbsp;&nbsp;&nbsp;&nbsp;if arr1 == arr2: &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp
def minOperations(arr1, arr2, i, j):     if arr1 == arr2:         return 0               if i >= len(arr1) or j >= len(arr2):         return 0           # If arr[i] < arr[j]     if arr1[i] < arr2[j]:                  return 1 \         + minOperations(arr1, arr2, i + 1, j + 1)    return max(minOperations(arr1, arr2, i, j + 1),                minOperations(arr1, arr2, i + 1, j)) def minOperationsUtil(arr):           brr = sorted(arr);     if(arr == brr):         print("0") else:     print(minOperations(arr, brr,) Python Telegram - t.me/codingsolution_IT
30 Iyul 2022, 06:04

INFOSYS EXAM 3PM SOLUTION GROUP: t.me/codingsolution_IT t.me/infosys_exam_discussion_groups ✅ Share post in ur college Whatsapp grps.
30 Iyul 2022, 06:02
30 Iyul 2022, ~06:20

#include using namespace std; #define ll long long int ll solve(ll n) { ll position = 1; ll m = 1; while (!(n &amp; m)) { m =
#include <bits/stdc++.h> using namespace std; #define ll long long int ll solve(ll n) { ll position = 1; ll m = 1; while (!(n & m)) { m = m << 1; position++; } return position; } int main() { // your code goes here ll n,p; cin>>n; vector<int> ans(n); for(int i=0;i<n;i++) { cin>>p; ans[i] = solve(p+1); } for(int i=0;i<n;i++) cout<<ans[i]<<"\n"; return 0; } C++ Telegram - t.me/codingsolution_IT
30 Iyul 2022, 06:01

class Solution { public: vector<int> frequncey(string s) { vector<int> freq(26, 0); for (int i = 0; i < s.length(); i++) freq[s[i] - 'a']++; return freq; } vector<string> wordSubsets(vector<string> &words1, vector<string> &words2) { vector<string> ans; vector<int> Freq(26, 0); for (auto &x : words2) { vector<int> freq1 = frequncey(x); for (int i = 0; i < 26; i++) Freq[i] = max(freq1[i], Freq[i]); } for (auto &x : words1) { vector<int> freq1 = frequncey(x); bool flag = true; for (int i = 0; i < 26; i++) { if (freq1[i] < Freq[i]) { flag = false; break; } } if (flag) ans.push_back(x); } return ans; } }; C++ Word Subsets Code Telegram - t.me/codingsolution_IT
30 Iyul 2022, 05:54

INFOSYS EXAM 3PM SOLUTION GROUP: t.me/codingsolution_IT t.me/infosys_exam_discussion_groups ✅ Share post in ur college Whatsapp grps.
30 Iyul 2022, 05:32
30 Iyul 2022, ~06:02

INFOSYS EXAM 3PM SOLUTION GROUP: t.me/codingsolution_IT t.me/infosys_exam_discussion_groups ✅ Share post in ur college Whatsapp grps.
30 Iyul 2022, 05:30
30 Iyul 2022, ~05:32

INFOSYS EXAM 3PM SOLUTION GROUP: t.me/codingsolution_IT t.me/infosys_exam_discussion_groups ✅ Share post in ur college Whatsapp grps.
30 Iyul 2022, 04:57
30 Iyul 2022, ~05:30

INFOSYS EXAM 3PM SOLUTION GROUP: t.me/codingsolution_IT t.me/infosys_exam_discussion_groups ✅ Share post in ur college Whatsapp grps.
30 Iyul 2022, 04:49
30 Iyul 2022, ~04:57

INFOSYS EXAM 3PM SOLUTION GROUP: t.me/codingsolution_IT t.me/infosys_exam_discussion_groups ✅ Share post in ur college Whatsapp grps.
30 Iyul 2022, 03:38
30 Iyul 2022, ~04:49

C++ Minimum Discomfort Code Telegram - t.me/codingsolution_IT
C++ Minimum Discomfort Code Telegram - t.me/codingsolution_IT
30 Iyul 2022, 03:17

INFOSYS EXAM 10AM SOLUTION GROUP: t.me/codingsolution_IT t.me/infosys_exam_discussion_groups ✅ Share post in ur college Whatsapp grps.
30 Iyul 2022, 01:59

#include using namespace std; #define ll long long int ll solve(ll n) { ll position = 1; ll m = 1; while (!(n &amp; m)) { m =
#include <bits/stdc++.h> using namespace std; #define ll long long int ll solve(ll n) { ll position = 1; ll m = 1; while (!(n & m)) { m = m << 1; position++; } return position; } int main() { // your code goes here ll n,p; cin>>n; vector<int> ans(n); for(int i=0;i<n;i++) { cin>>p; ans[i] = solve(p+1); } for(int i=0;i<n;i++) cout<<ans[i]<<"\n"; return 0; } C++ Telegram - t.me/codingsolution_IT
30 Iyul 2022, 01:58

INFOSYS EXAM 10AM SOLUTION GROUP: t.me/codingsolution_IT t.me/infosys_exam_discussion_groups ✅ Share post in ur college Whatsapp grps.
30 Iyul 2022, 01:40
30 Iyul 2022, ~02:00

CODING SOLUTION - Placement Jobs & Materials - Telegram kanali @codingsolution_it statistikasi va tahlili