en
Feedback

Don't get caught by a cheater! Telemetrio finds and tags such channels 👉 If you want to see the tag, subscribe

CODING SOLUTION - Placement Jobs & Materials

CODING SOLUTION - Placement Jobs & Materials

Open in Telegram

🌀 ” 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

Show more

📈 Analytical overview of Telegram channel CODING SOLUTION - Placement Jobs & Materials

Channel CODING SOLUTION - Placement Jobs & Materials (@codingsolution_it) in the English language segment is an active participant. Currently, the community unites 127 316 subscribers, ranking 168 in the Career category and 1 668 in the India region.

📊 Audience metrics and dynamics

Since its creation on невідомо, the project has demonstrated rapid growth, gathering an audience of 127 316 subscribers.

According to the latest data from 20 November, 2026, the channel demonstrates stable activity. Although there has been a change in the number of participants by -2 180 over the last 30 days and by -99 over the last 24 hours, overall reach remains high.

  • Verification status: Not verified
  • Engagement rate (ER): The average audience engagement rate is 1.52%. Within the first 24 hours after publication, content typically collects 0.44% reactions from the total number of subscribers.
  • Post reach: On average, each post receives 1 932 views. Within the first day, a publication typically gains 555 views.
  • Reactions and interaction: The audience actively supports content: the average number of reactions per post is 0.
  • Thematic interests: Content is focused on key topics such as t.me/codingsolution_it, vector, codevita, string, graduate.

📝 Description and content policy

The author describes the resource as a platform for expressing subjective opinions:
“🌀 ” 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”

Thanks to the high frequency of updates (latest data received on 21 November, 2026), the channel maintains relevance and a high level of publication reach. Analytics show that the audience actively interacts with content, making it an important point of influence in the Career category.

127 316
Subscribers
-9924 hours
-5287 days
-2 18030 days
Posts Archive
INFOSYS EXAM 3PM SOLUTION GROUP: t.me/codingsolution_IT t.me/infosys_exam_discussion_groups ✅ Share post in ur college Whatsapp grps.
29 Jul 2022, 04:24
29 Jul 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 Jul 2022, 03:02
29 Jul 2022, ~04:24

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

INFOSYS EXAM 10AM SOLUTION GROUP: t.me/codingsolution_IT t.me/infosys_exam_discussion_groups ✅ Share post in ur college Whatsapp grps.
29 Jul 2022, 01:47
29 Jul 2022, ~01:49

Python Telegram - t.me/codingsolution_IT
+1
Python Telegram - t.me/codingsolution_IT
29 Jul 2022, 01:45

Send CODING Question in This Group 👇 t.me/infosys_exam_discussion_groups
29 Jul 2022, 01:42
29 Jul 2022, ~03:02

class CountOccurrences { public static void main(String[] args) { String str = "aabbccd"; char a[]=str.toCharArray(); int cnt
class CountOccurrences { public static void main(String[] args) { String str = "aabbccd"; char a[]=str.toCharArray(); int cnt = 0; for (int i = 0; i < a.length; i++) { for (int j = i + 1; j < a.length; j++) { if ((a[i] == a[j])) { cnt++; } } } System.out.println(cnt); } } Java Telegram - t.me/codingsolution_IT
29 Jul 2022, 01:42

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 Jul 2022, 01:40

Send CODING Question in This Group 👇 t.me/infosys_exam_discussion_groups
29 Jul 2022, 01:37
29 Jul 2022, ~01:43

Send CODING Question in This Group 👇 t.me/infosys_exam_discussion_groups
29 Jul 2022, 01:36

#include #include #include #include using namespace std; int ans(string s){ unordered_map map; for(int i =0; i map[s[i]]){ }
#include<iostream> #include<unordered_map> #include<string> #include<math.h> using namespace std; int ans(string s){ unordered_map map; for(int i =0; i map[s[i]]){ } } return val; } int main() { string s; cin>>s; cout<< ans(s); return 0; } val = map[s[i]]; key = map[s[i]]; C++ Telegram - t.me/codingsolution_IT
29 Jul 2022, 01:34

INFOSYS EXAM 10AM SOLUTION GROUP: t.me/codingsolution_IT t.me/infosys_exam_discussion_groups ✅ Share post in ur college Whatsapp grps.
29 Jul 2022, 01:29
29 Jul 2022, ~02:15

#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>b[i]; } int max=
#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 Jul 2022, 01:29

static int minMovesToEvenFollowedByOdd(int[] arr) { int moves = 0; int totalLength = arr.length; for (int i = 0; i <= totalLe
static int minMovesToEvenFollowedByOdd(int[] arr) { int moves = 0; int totalLength = arr.length; for (int i = 0; i <= totalLength / 2; i++) { if (arr[i] % 2 != 0) { for (int j = totalLength / 2; j < totalLength; j++) { if (arr[j] % 2 == 0) { int temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; moves++; break; } else { continue; } } } else { continue; } } return moves; Python Telegram - t.me/codingsolution_IT
29 Jul 2022, 01:26

int A[] = {10,13,7,8,14,11}; int n = 6; int memo[6];//initialized with -1s; int count(int currIndex){ if (currIndex == n-1) return 1; if (memo[currIndex] != -1) return memo[currIndex]; int res = 0; for (int i=currIndex+1 ; i<n ; i++){ if (abss(A[currIndex] - A[i]) <= 3){ res += count(i); } } memo[currIndex] = res; return res; } C++ Number Of Subsequences Code Telegram - t.me/codingsolution_IT
29 Jul 2022, 01:23

29 Jul 2022, 01:15

INFOSYS EXAM 10AM SOLUTION GROUP: t.me/codingsolution_IT t.me/infosys_exam_discussion_groups ✅ Share post in ur college Whatsapp grps.
29 Jul 2022, 01:11
29 Jul 2022, ~01:32

Python Telegram - t.me/codingsolution_IT
+1
Python Telegram - t.me/codingsolution_IT
29 Jul 2022, 01:08

n = int(input()) A = int(input()) A1 = [] A2= [] A3= [] ans = 0 for i in range(n): A1.append(int(input())) for j in range(n):
n = int(input()) A = int(input()) A1 = [] A2= [] A3= [] ans = 0 for i in range(n): A1.append(int(input())) for j in range(n): A2.append(int(input())) for k in range(n): A2.append([p[k], b[k]]) a.sort() for z in a: if a[0] > N: break N += a[1] ans += 1 print(ans) Python 3 Telegram - t.me/codingsolution_IT
29 Jul 2022, 01:01

def sum_of_elements(arr, n): sumfirst = 0; sumsecond = 0; for i in range(n): # Add elements in first half sum if (i < n // 2): sumfirst += arr[i]; # Add elements in the second half sum else: sumsecond += arr[i]; print("Sum of first half elements is", sumfirst, end = "\n"); print("Sum of second half elements is", sumsecond, end = "\n"); # Driver Code arr = [20, 30, 60, 10, 25, 15, 40]; n = len(arr); # Function call sum_of_elements(arr, n); #logic for code
29 Jul 2022, 00:53