Available now! Telegram Research 2025 — the year's key insights 
allcoding1
Open in Telegram
Show more
📈 Analytical overview of Telegram channel allcoding1
Channel allcoding1 (@allcoding1) in the English language segment is an active participant. Currently, the community unites 22 394 subscribers, ranking 8 823 in the Education category and 18 959 in the India region.
📊 Audience metrics and dynamics
Since its creation on невідомо, the project has demonstrated rapid growth, gathering an audience of 22 394 subscribers.
According to the latest data from 28 June, 2026, the channel demonstrates stable activity. Although there has been a change in the number of participants by -390 over the last 30 days and by -15 over the last 24 hours, overall reach remains high.
- Verification status: Not verified
- Engagement rate (ER): The average audience engagement rate is 4.60%. Within the first 24 hours after publication, content typically collects 1.42% reactions from the total number of subscribers.
- Post reach: On average, each post receives 1 031 views. Within the first day, a publication typically gains 318 views.
- Reactions and interaction: The audience actively supports content: the average number of reactions per post is 2.
- Thematic interests: Content is focused on key topics such as dsa, stack, namaste, javascript, learning.
📝 Description and content policy
Channel description not provided.
Thanks to the high frequency of updates (latest data received on 29 June, 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 Education category.
22 394
Subscribers
-1524 hours
-947 days
-39030 days
Posts Archive
22 394
import java.io.*;
import java.util.*;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print("Enter a string: ");
String str = sc.next();
HashMap<String, Integer> maps = new HashMap<String, Integer>();
String[] cha = new String[str.length()];
cha = str.split("");
for(int i=0; i<cha.length; i++)
{
int count = 0;
if(maps.containsKey(" "+cha[i]))
{
maps.put(" "+cha[i], 1+maps.get(" "+cha[i]));
}
else if(maps.containsKey(cha[i]))
{
if(!(cha[i].equals(cha[i-1])) && i > 0)
{
maps.put(" "+cha[i], 1);
}else{
count = 1 + maps.get(cha[i]);
maps.put(cha[i], count);
}
}else{
maps.put(cha[i], 1);
}
}
String updated = "";
for(String key: maps.keySet())
{
System.out.print(key+""+maps.get(key));
updated = updated+""+key+""+maps.get(key);
}
System.out.println();
if(str.length() > updated.length())
{
System.out.println("String Accepted");
System.out.println("Inputted String: "+str);
System.out.println("Compressed String: "+updated);
}else{
System.out.println("String Rejected");
System.out.println("Inputted String: "+str);
System.out.println("Compressed String: "+updated);
}
}
}
String Compression Code in Java
Telegram:- @allcoding1
22 394
import java.io.*;
import java.util.*;
class Main {
static void desc(int[] arr, int num, int total)
{
int temp =0 ;
for(int i=0;i<total; i++)
{
for(int j=0;j<total;j++)
{
if(arr[j] < arr[i])
{
temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}
topScorer(arr, num);
}
static void topScorer(int[] arr, int num)
{
int sum=0;
for(int i=0; i<num; i++)
{
sum = sum+arr[i];
}
System.out.println(sum);
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print("Enter total number of participants: ");
int total = sc.nextInt();
int[] arr= new int[total];
System.out.print("Enter number of top scorer: ");
int num = sc.nextInt();
System.out.print("Enter "+total+" elements: ");
for(int i=0;i<total; i++)
{
arr[i] = sc.nextInt();
}
desc(arr, num, total);
}
}
Marathon code
Java
Telegram:-@allcoding1
22 394
Pattern code in java
import java.io.*;
import java.util.*;
class Main {
static void myCode(String str)
{
int num = Integer.parseInt(str);
for(int i=1; i<=num; i++)
{
for(int j=num-1; j>=i; j--)
{
System.out.print(" ");
}
for(int k=1; k<=2*i-1; k++)
{
System.out.print("*");
}
for(int l=num-1; l>=i; l--)
{
System.out.print(" ");
}
System.out.println();
}
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.next();
myCode(str);
}
}
Telegram:-@allcoding1
22 394
🎯Deloitte Requirement | For Associate Analyst
Apply Now:- www.allcoding1.com
🎯 TCS NQT Registration | TCS Recruitment Drive For Freshers | 3.36 LPA-7 LPA
Apply Now:- www.allcoding1.com
🎯 Mindtree Off Campus Drive
Apply Now:- www.allcoding1.com
🎯Cognizant is hiring for Devops Engineer
Apply Now:- www.allcoding1.com
🎯 ZOHO Corp Off Campus Drive | B.E/B.Tech/Any Degree
Apply Now:- www.allcoding1.com
🎯VIRTUSA OFF CAMPUS DRIVE
Apply Now:- www.allcoding1.com
🎯 Hexaware Technologies Off Campus Drive : Hiring for Freshers as Trainee – IMS With 3.15 LPA
Apply Now:- www.allcoding1.com
✅Qualification : B.E/B.Tech/✅Any Degree
Batch : 2019, 2020, 2021, or 2022
Telegram:-@allcoding1
22 394
🎯 Hexaware Technologies Off Campus Drive 2022 : Hiring for Freshers as Trainee – IMS With 3.15 LPA
Designation : Trainee – IMS
Job Location : Across India
Experience : Freshers
Salary : Rs. 3.15 LPA
Apply Now:- http://www.allcoding1.com/2022/07/hexaware-off-campus-drive.html
Telegram:-@allcoding1
22 394
Guys ❤️
Easy to discuss your Friends
Hindi students:- @Hindisoftwarejobs
Telugu students:- @TeluguSoftwarejobs
Tamil students:- @Tamilsoftwarejobs
Kannada students:- @kannadasowfarejobs
Telegram:-@allcoding1
22 394
// 1074. Number of Submatrices That Sum to Target
class Solution
{
public:
int numSubmatrixSumTarget(vector<vector<int>> &matrix, int target)
{
int m = matrix.size();
int n = matrix[0].size();
for (int i = 0; i < m; i++)
{
for (int j = 1; j < n; j++)
{
matrix[i][j] += matrix[i][j - 1];
}
}
int count = 0;
for (int index = 0; index < n; index++)
{
for (int j = index; j < n; j++)
{
unordered_map<int, int> mp{{0, 1}};
int sum = 0;
for (int i{}; i < m; i++)
{
if (index > 0)
sum -= matrix[i][index - 1];
sum += matrix[i][j];
if (mp.count(sum - target))
count += mp[sum - target];
mp[sum]++;
}
}
}
return count;
}
};
// C++ unordered_map TC O(MN + MN*MN) || Easy Solution
Telegram:-@allcoding1
22 394
Guys ❤️
Easy to discuss your Friends
Hindi students:- @Hindisoftwarejobs
Telugu students:- @TeluguSoftwarejobs
Tamil students:- @Tamilsoftwarejobs
Kannada students:- @kannadasowfarejobs
Telegram:-@allcoding_1
22 394
VIRTUSA OFF CAMPUS DRIVE
Position Title: Associate Engineer
CTC: 4,00,00 Per Annum
Batch: 2018/19/20/21
Apply Now:- http://www.allcoding1.com/2022/07/virtusa-off-campus-drive.html
Telegram:-@allcoding1
22 394
leecode A
class Solution
{
public:
vector<int> numberOfPairs(vector<int> &nums)
{
int p = 0, u = 0;
vector<int> vec;
unordered_map<int, int> mp;
for (auto x : nums)
mp[x]++;
for (auto x : mp)
{
p += x.second / 2;
u += x.second % 2;
}
vec.push_back(p);
vec.push_back(u);
return vec;
}
};
MAP easy Solution || TC O(N)
C++
Telegram:-@allcoding1
22 394
leetcode B
class Solution
{
public:
int sumofNumber(int n)
{
int sum = 0;
while (n)
{
sum += (n % 10);
n /= 10;
}
return sum;
}
int maximumSum(vector<int> &nums)
{
int ans = -1;
int n = nums.size();
sort(nums.begin(), nums.end());
map<int, vector<int>> m;
for (int i = 0; i < n; i++)
{
m[sumofNumber(nums[i])].push_back(nums[i]);
}
for (auto i : m)
{
if (i.second.size() > 1)
{
int k = i.second.size();
ans = max(ans, i.second[k - 1] + i.second[k - 2]);
}
}
return ans;
}
};
Easy Solution by sum of number ,sorting
C++
Telegram:-@allcoding1
