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 592 obunachidan iborat bo'lib, Karyera toifasida 159-o'rinni va Hindiston mintaqasida 1 669-o'rinni egallagan.

📊 Auditoriya ko‘rsatkichlari va dinamika

невідомо sanasidan buyon loyiha tez o‘sib, 127 592 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 592
Obunachilar
-3924 soatlar
-5647 kun
-2 21030 kun
Postlar arxiv
#include using namespace std; int main() { int n,a[n],b[n],k; cin>>n>>k; for(int i=0;i>a[i]; } for(int i=0;i&g
#include <iostream> using namespace std; int main() { int n,a[n],b[n],k; cin>>n>>k; for(int i=0;i<n;i++){ cin>>a[i]; } for(int i=0;i<n;i++){ cin>>b[i]; } int max=a[0]+b[1]; for(int i=0;i<n;i++){ if(a[i]+b[i+1]>max){ max=a[i]+b[i+1]; } } cout<<max<<endl; return 0; } C++ Telegram - t.me/codingsolution_IT
29 Iyul 2022, 06:56
29 Iyul 2022, ~07:08

Java You are given 2 integers X and Y Code Telegram - t.me/codingsolution_IT
+1
Java You are given 2 integers X and Y Code Telegram - t.me/codingsolution_IT
29 Iyul 2022, 06:54

import java.util.*; public class MyClass { static String generatePrintBinary(int n) { Queue<String> q = new LinkedList<String>(); q.add("1"); String val=""; while (n-- > 0) { String s1 = q.peek(); q.remove(); val= s1; String s2 = s1; q.add(s1 + "0"); q.add(s2 + "1"); } return val; } public static int diff(int a, int b){ if(a < b){ return a; } for(int i=0;i<b;i++){ if(generatePrintBinary(a).charAt(i)=='1'){ int y =(int) Math.pow(2, i+1); if(a-y < b){ return a - y; } } } return 0; } public static void main(String args[]) { System.out.println(diff(3,2)); System.out.println(diff(2,3)); System.out.println(diff(13,10)); } } Java You are given 2 integers X and Y Code Telegram - t.me/codingsolution_IT
29 Iyul 2022, 06:50
29 Iyul 2022, ~06:55

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

Python Stone bucket code Telegram - t.me/codingsolution_IT
Python Stone bucket code Telegram - t.me/codingsolution_IT
29 Iyul 2022, 06:45

Python Telegram - t.me/codingsolution_IT
+1
Python Telegram - t.me/codingsolution_IT
29 Iyul 2022, 06:42

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

Python Telegram - t.me/codingsolution_IT
+1
Python Telegram - t.me/codingsolution_IT
29 Iyul 2022, 06:24

array AR of size N perfect_sum(arr, s, result) : x = [0]*len(arr) j = len(arr) - 1 while (s > 0) : x[j] = s % 2 s = s // 2 j
array AR of size N perfect_sum(arr, s, result) : x = [0]*len(arr) j = len(arr) - 1 while (s > 0) : x[j] = s % 2 s = s // 2 j -= 1 sum = 0 for i in range(len(arr)) : if (x[i] == 1) : sum += arr[i] if (sum == result) : print("{",end=""); for i in range(len(arr)) : if (x[i] == 1) : print(arr[i],end= ", "); print("}, ",end="") def print_subset(arr, K) : x = pow(2, len(arr)) for i in range(1, x): perfect_sum(arr, i, K) # Driver code arr = [ ] n = int(input("Enter length of array : ")) s=int(input("Enter sum : ")) for i in range(n): ele=int(input("Enter element : ")) arr.append(ele) print_subset(arr, s) Python Telegram - t.me/codingsolution_IT
29 Iyul 2022, 06:18

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

C++ Lexographically smallest question code Telegram - t.me/codingsolution_IT
C++ Lexographically smallest question code Telegram - t.me/codingsolution_IT
29 Iyul 2022, 06:15

C++ Minprocuct Code Telegram - t.me/codingsolution_IT
+1
C++ Minprocuct Code Telegram - t.me/codingsolution_IT
29 Iyul 2022, 06:14

# to make a given change V    import sys    # m is size of coins array (number of different coins) def minCoins(coins, m, V):        # base case     if (V == 0):         return 0        # Initialize result     res = sys.maxsize            # Try every coin that has smaller value than V     for i in range(0, m):         if (coins[i] <= V):             sub_res = minCoins(coins, m, V-coins[i])                # Check for INT_MAX to avoid overflow and see if             # result can minimized             if (sub_res != sys.maxsize and sub_res + 1 < res):                 res = sub_res + 1     return res    # Driver program to test above function coins = [9, 6, 5, 1] m = len(coins) V = 11 print("Minimum coins required is",minCoins(coins, m, V)) Python 3 program to find minimum of coins Code Telegram - t.me/codingsolution_IT
29 Iyul 2022, 06:12

C++ Minswap Code Telegram - t.me/codingsolution_IT
C++ Minswap Code Telegram - t.me/codingsolution_IT
29 Iyul 2022, 06:07

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

def minOperations(arr1, arr2, i, j): &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp;&nbsp;# Base Case &nbsp;&nbsp;&nbsp;&nb
def minOperations(arr1, arr2, i, j):           # Base Case     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]:                   # Include the current element         return 1 \         + minOperations(arr1, arr2, i + 1, j + 1)               # Otherwise, excluding the current element     return max(minOperations(arr1, arr2, i, j + 1),                minOperations(arr1, arr2, i + 1, j))       # Function that counts the minimum # moves required to sort the array def minOperationsUtil(arr):           brr = sorted(arr);           # If both the arrays are equal     if(arr == brr):                   # No moves required         print("0")       # Otherwise     else:                   # Print minimum operations required         print(minOperations(arr, brr,) Python Telegram - t.me/codingsolution_IT
29 Iyul 2022, 05:58

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

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

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

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