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
TCS NQT & SAMSUNG EXAM SOLUTION GROUP: t.me/codingsolution_IT t.me/tcs_nqt_exam_samsung_exam ✅ Share post in ur college Whatsapp grps.
09 Iyul 2022, 23:22
09 Iyul 2022, ~23:28

⚠️ ALL SLOTS SOLUTION GROUP: ⚠️ SAMSUNG - t.me/samsung_exam_discussion_group TCS NQT - t.me/tcs_nqt_exam_discussion_group t.me/codingsolution_IT ✅ Share post in ur college Whatsapp grps.
09 Iyul 2022, 23:20
09 Iyul 2022, ~23:22

⚠️ ALL SLOTS SOLUTION GROUP: ⚠️ SAMSUNG - t.me/samsung_exam_discussion_group TCS NQT - t.me/tcs_nqt_exam_discussion_group t.me/codingsolution_IT ✅ Share post in ur college Whatsapp grps.
09 Iyul 2022, 22:48
09 Iyul 2022, ~23:20

⚠️ ALL SLOTS SOLUTION GROUP: ⚠️ SAMSUNG - t.me/samsung_exam_discussion_group TCS NQT - t.me/tcs_nqt_exam_discussion_group t.me/codingsolution_IT ✅ Share post in ur college Whatsapp grps.
09 Iyul 2022, 14:25
09 Iyul 2022, ~22:49

⚠️ ALL SLOTS SOLUTION GROUP: ⚠️ SAMSUNG - t.me/samsung_exam_discussion_group TCS NQT - t.me/tcs_nqt_exam_discussion_group t.me/codingsolution_IT ✅ Share post in ur college Whatsapp grps.
09 Iyul 2022, 12:33
09 Iyul 2022, ~14:25

TCS NQT EXAM SOLUTION GROUP: t.me/codingsolution_IT t.me/tcs_nqt_exam_discussion_group ✅ Share post in ur college Whatsapp grps.
09 Iyul 2022, 11:30
09 Iyul 2022, ~12:33

n = int(input()) li = [] for i in range(n): li.append(int(input())) m = [] li.sort() for i in range(len(li)): st = "" count =
n = int(input()) li = [] for i in range(n): li.append(int(input())) m = [] li.sort() for i in range(len(li)): st = "" count = 0 for j in range(i+1): if str(li[j]) not in st: st += str(li[j]) count += 1 m.append(count) sum = 0 for i in m: sum += i print(sum) Python Telegram - t.me/codingsolution_IT
09 Iyul 2022, 09:32

SAMSUNG EXAM 6PM SOLUTION GROUP: t.me/codingsolution_IT t.me/samsung_exam_tcs_nqt_exam ✅ Share post in ur college Whatsapp grps.
09 Iyul 2022, 08:42
09 Iyul 2022, ~09:30

#include <bits/stdc++.h> #define n 3 using namespace std; int findLongestFromACell(int i, int j, int mat[n][n], int dp[n][n]) { if (i < 0 i >= n j < 0 || j >= n) return 0; if (dp[i][j] != -1) return dp[i][j]; int x = INT_MIN, y = INT_MIN, z = INT_MIN, w = INT_MIN; if (j < n - 1 && ((mat[i][j] + 1) == mat[i][j + 1])) x = 1 + findLongestFromACell(i, j + 1, mat, dp); if (j > 0 && (mat[i][j] + 1 == mat[i][j - 1])) y = 1 + findLongestFromACell(i, j - 1, mat, dp); if (i > 0 && (mat[i][j] + 1 == mat[i - 1][j])) z = 1 + findLongestFromACell(i - 1, j, mat, dp); if (i < n - 1 && (mat[i][j] + 1 == mat[i + 1][j])) w = 1 + findLongestFromACell(i + 1, j, mat, dp); return dp[i][j] = max({x, y, z, w, 1}); } int LongestPath(int mat[n][n]) { int result = 1; int dp[n][n]; memset(dp, -1, sizeof dp); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (dp[i][j] == -1) findLongestFromACell(i, j, mat, dp); result = max(result, dp[i][j]); } } return result; } int main() { int mat[n][n] = {{1, 2, 9}, {5, 3, 8}, {4, 6, 7}}; cout << "Length of the longest path is " << LongestPath(mat); return 0; } C++ Telegram - t.me/codingsolution_IT
09 Iyul 2022, 06:30

photo content
09 Iyul 2022, 06:30

// Java program to find next greater // number with same set of digits. import java.util.Arrays; public class nextGreater { // Utility function to swap two digit static void swap(char ar[], int i, int j) { char temp = ar[i]; ar[i] = ar[j]; ar[j] = temp; } // Given a number as a char array number[], // this function finds the next greater number. // It modifies the same array to store the result static void findNext(char ar[], int n) { int i; // I) Start from the right most digit // and find the first digit that is smaller // than the digit next to it. for (i = n - 1; i > 0; i--) { if (ar[i] > ar[i - 1]) { break; } } // If no such digit is found, then all // digits are in descending order means // there cannot be a greater number with // same set of digits if (i == 0) { System.out.println("Not possible"); } else { int x = ar[i - 1], min = i; // II) Find the smallest digit on right // side of (i-1)'th digit that is greater // than number[i-1] for (int j = i + 1; j < n; j++) { if (ar[j] > x && ar[j] < ar[min]) { min = j; } } // III) Swap the above found smallest // digit with number[i-1] swap(ar, i - 1, min); // IV) Sort the digits after (i-1) // in ascending order Arrays.sort(ar, i, n); System.out.print("Next number with same" + " set of digits is "); for (i = 0; i < n; i++) System.out.print(ar[i]); } } public static void main(String[] args) { char digits[] = { '5','3','4','9','7','6' }; int n = digits.length; findNext(digits, n); } } Java Telegram - t.me/codingsolution_IT
09 Iyul 2022, 06:22

photo content
09 Iyul 2022, 06:21

C++ Trees identical code Telegram - t.me/codingsolution_IT
+1
C++ Trees identical code Telegram - t.me/codingsolution_IT
09 Iyul 2022, 06:14

#include<bits/stdc++.h> using namespace std; struct node { int data; node *left, *right; }; bool identicalTree(node* root1, node* root2){ if(root1 && root2) { if(root1->data == root2->data && identicalTree(root1->left, root2->left) && identicalTree(root1->right, root2->right)) return true; return false; } else if(!root1 && !root2) return true; return false; } node* create(int data){ node* tmp = new node(); tmp->data = data; tmp->left = tmp->right = NULL; return tmp; } int main() { node* root1 = create(2); root1->left = create(1); root1->right = create(3); node* root2 = create(2); root2->left = create(1); root2->right = create(3); cout<<(identicalTree(root1, root2) ? "1" : "0"); } Count subtrees with digit sum K Telegram - t.me/codingsolution_IT
09 Iyul 2022, 06:10

#include <iostream> #include <cstring> #include <algorithm> using namespace std; void swap(char *a, char *b) { char temp = *a; *a = *b; *b = temp; } void findNext(char number[], int n) { int i, j; for (i = n-1; i > 0; i--) if (number[i] > number[i-1]) break; if (i==0) { cout << "Next number is not possible"; return; } int x = number[i-1], smallest = i; for (j = i+1; j < n; j++) if (number[j] > x && number[j] < number[smallest]) smallest = j; swap(&number[smallest], &number[i-1]); sort(number + i, number + n); cout << "Next number with same set of digits is " << number; return; } int main() { char digits[] = "3187475"; int n = strlen(digits); findNext(digits, n); return 0; } C++ Find Next Greater Number code Telegram - t.me/codingsolution_IT
09 Iyul 2022, 05:50

from itertools import permutations r=int(input()) #length n=input() #taking the input as a string a = permutations(n, r) #print(a) y = [''.join(i) for i in a] # joining the digits to a y y=sorted(y) q=y.index(n) #finding the index of the input value from the list #print(q) print(y[q+1]) Python Telegram - t.me/codingsolution_IT
09 Iyul 2022, 05:45
09 Iyul 2022, ~05:58

SAMSUNG EXAM 3PM SOLUTION GROUP: t.me/codingsolution_IT t.me/samsung_exam_tcs_nqt_exam ✅ Share post in ur college Whatsapp grps.
09 Iyul 2022, 05:21
09 Iyul 2022, ~08:44

SAMSUNG & TCS NQT EXAM SOLUTION GROUP: t.me/codingsolution_IT t.me/samsung_exam_tcs_nqt_exam ✅ Share post in ur college Whatsapp grps.
09 Iyul 2022, 04:43
09 Iyul 2022, ~05:21

SAMSUNG & TCS NQT EXAM SOLUTION GROUP: t.me/codingsolution_IT t.me/samsung_exam_tcs_nqt_exam ✅ Share post in ur college Whatsapp grps.
09 Iyul 2022, 03:27
09 Iyul 2022, ~04:43

TCS NQT Solved Paper - 12th Sept 2021 [Slot 2] Telegram - t.me/studymaterial_IT
09 Iyul 2022, 00:50