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 21 559 subscribers, ranking 9 073 in the Education category and 19 010 in the India region.
š Audience metrics and dynamics
Since its creation on Š½ŠµŠ²ŃŠ“Š¾Š¼Š¾, the project has demonstrated rapid growth, gathering an audience of 21 559 subscribers.
According to the latest data from 30 August, 2026, the channel demonstrates stable activity. Although there has been a change in the number of participants by -372 over the last 30 days and by -25 over the last 24 hours, overall reach remains high.
- Verification status: Not verified
- Engagement rate (ER): The average audience engagement rate is 6.68%. Within the first 24 hours after publication, content typically collects N/A% reactions from the total number of subscribers.
- Post reach: On average, each post receives 1 441 views. Within the first day, a publication typically gains 0 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 dsa, stack, namaste, javascript, learning.
š Description and content policy
Channel description not provided.
Thanks to the high frequency of updates (latest data received on 31 August, 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.
21 559
Subscribers
-2524 hours
-867 days
-37230 days
Posts Archive
21 554
#include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
using namespace std;
int getMaxMedian(vector<int> lower_bound, vector<int> upper_bound, long int max_sum) {
Ā Ā Ā int n = lower_bound.size();
Ā Ā Ā long long curr_sum = 0;
Ā Ā Ā for (int i = 0; i < n; ++i) {
Ā Ā Ā Ā Ā Ā Ā curr_sum += lower_bound[i] + upper_bound[i];
Ā Ā Ā }
Ā Ā Ā int num_elements = 2 * n;
Ā Ā Ā long long target_sum = curr_sum + max_sum;
Ā Ā Ā sort(upper_bound.begin(), upper_bound.end());
Ā Ā Ā int median_index = num_elements / 2;
Ā Ā Ā int left = 1, right = INT_MAX;
Ā Ā Ā while (left <= right) {
Ā Ā Ā Ā Ā Ā Ā int mid = left + (right - left) / 2;
Ā Ā Ā Ā Ā Ā Ā long long sum = 0;
Ā Ā Ā Ā Ā Ā Ā for (int i = 0; i < n; ++i) {
Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā if (upper_bound[i] <= mid) {
Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā sum += upper_bound[i];
Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā } else {
Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā sum += mid;
Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā }
Ā Ā Ā Ā Ā Ā Ā }
Ā Ā Ā Ā Ā Ā Ā if (sum <= target_sum) {
Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā left = mid + 1;
Ā Ā Ā Ā Ā Ā Ā } else {
Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā right = mid - 1;
Ā Ā Ā Ā Ā Ā Ā }
Ā Ā Ā }
Ā Ā Ā return right;
}
int main() {
Ā Ā Ā int n;
Ā Ā Ā cin >> n;
Ā Ā Ā vector<int> lower_bound(n);
Ā Ā Ā vector<int> upper_bound(n);
Ā Ā Ā for (int i = 0; i < n; ++i) {
Ā Ā Ā Ā Ā Ā Ā cin >> lower_bound[i];
Ā Ā Ā }
Ā Ā Ā for (int i = 0; i < n; ++i) {
Ā Ā Ā Ā Ā Ā Ā cin >> upper_bound[i];
Ā Ā Ā }
Ā Ā Ā long int max_sum;
Ā Ā Ā cin >> max_sum;
Ā Ā Ā int max_median = getMaxMedian(lower_bound, upper_bound, max_sum);
Ā Ā Ā cout << max_median << endl;
Ā Ā Ā return 0;
}
DE Shaw
21 554
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
Ā Ā Ā ll n;
Ā Ā Ā cin >> n;
Ā Ā Ā vector<ll> v(n);
Ā Ā Ā for(ll i=0; i<n; i++)
Ā Ā Ā Ā Ā Ā Ā cin >> v[i];
Ā Ā Ā sort(v.begin(), v.end());
Ā Ā Ā ll sum = 0;
Ā Ā Ā for(ll i=0; i<n; i++) {
Ā Ā Ā Ā Ā Ā Ā if(sum + v[i] < 0)
Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā return cout << -1, 0;
Ā Ā Ā Ā Ā Ā Ā sum += v[i];
Ā Ā Ā }
Ā Ā Ā if(sum % 2 == 0)
Ā Ā Ā Ā Ā Ā Ā cout << -1;
Ā Ā Ā else
Ā Ā Ā Ā Ā Ā Ā cout << sum;
Ā Ā Ā return 0;
}
fortunejob
21 554
#include <iostream>
using namespace std;
int main() {
Ā Ā Ā int e, d;
Ā Ā Ā cin >> e >> d;
Ā Ā Ā
Ā Ā Ā int mE = 0;
Ā Ā Ā int mN = 0;
Ā Ā Ā
Ā Ā Ā for (int i = 1; i <= d; i++) {
Ā Ā Ā Ā Ā Ā Ā int gE = e * i;
Ā Ā Ā Ā Ā Ā Ā int gN = 0;
Ā Ā Ā Ā Ā Ā Ā
Ā Ā Ā Ā Ā Ā Ā while (gE % 10 == 0) {
Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā gN++;
Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā gE /= 10;
Ā Ā Ā Ā Ā Ā Ā }
Ā Ā Ā Ā Ā Ā Ā
Ā Ā Ā Ā Ā Ā Ā if (gN > mN) {
Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā mN = gN;
Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā mE = e * i;
Ā Ā Ā Ā Ā Ā Ā } else if (gN == mN) {
Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā mE = max(mE, e * i);
Ā Ā Ā Ā Ā Ā Ā }
Ā Ā Ā }
Ā Ā Ā
Ā Ā Ā cout << mE << endl;
Ā Ā Ā
Ā Ā Ā return 0;
}
goodenergy
21 554
#include<bits/stdc++.h>
using namespace std;
bool solve(char c) {
c = tolower(c);
return !(c == 'a' c == 'e' c == 'i' c == 'o' c == 'u') && c >= 'a' && c <= 'z';
}
int main() {
string s;
cin >> s;
int count = 0;
for(int i = 0; i < s.length(); i += 2) {
if(solve(s[i])) {
count++;
}
}
cout << count << endl;
return 0;
}
Airtel Shecode
anabellle
@allcoding1
21 554
import java.util.Scanner;
public class Solution {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int energy = sc.nextInt();
int maxDrink = sc.nextInt();
int maxGoodEnergy = 0;
int maxGoodNumber = 0;
for (int i = 1; i <= maxDrink; i++) {
int goodEnergy = energy * i;
int goodNumber = 0;
while (goodEnergy % 10 == 0) {
goodNumber++;
goodEnergy /= 10;
}
if (goodNumber > maxGoodNumber) {
maxGoodNumber = goodNumber;
maxGoodEnergy = energy * i;
} else if (goodNumber == maxGoodNumber) {
maxGoodEnergy = Math.max(maxGoodEnergy, energy * i);
}
}
System.out.println(maxGoodEnergy);
}
}
Airtel shecode
@allcoding1
21 554
Repost from allcoding1_official
+8
šIT learning courses
šAll programing courses
šAbdul bari courses
šAshok IT
Tutorials + Books + Courses + Trainings + Workshops + Educational Resources
š¹Data science
š¹Python
š¹Artificial Intelligence
š¹AWS Certified
š¹Cloud
š¹BIG DATA
š¹Data Analytics
š¹BI
š¹Google Cloud Platform
š¹IT Training
š¹MBA
š¹Machine Learning
š¹Deep Learning
š¹Ethical Hacking
š¹SPSS
š¹Statistics
š¹Data Base
š¹Learning language resources English , š«š·
100 rupees
Contact:- @meterials_available
21 554
Repost from allcoding1_official
+8
šIT learning courses
šAll programing courses
šAbdul bari courses
šAshok IT
Tutorials + Books + Courses + Trainings + Workshops + Educational Resources
š¹Data science
š¹Python
š¹Artificial Intelligence
š¹AWS Certified
š¹Cloud
š¹BIG DATA
š¹Data Analytics
š¹BI
š¹Google Cloud Platform
š¹IT Training
š¹MBA
š¹Machine Learning
š¹Deep Learning
š¹Ethical Hacking
š¹SPSS
š¹Statistics
š¹Data Base
š¹Learning language resources English , š«š·
100 rupees
Contact:- @meterials_available
21 554
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll solve(vector<int>a)
{
set<int>s(a.begin(),a.end());
ll mex=0;
while (s.count(mex)) mex++;
ll ans=distance(s.lower_bound(mex),s.end());
if(ans==a.size()) return -2;
return ans;
}
int main() {
int n; cin>>n;
vector<int>arr(n);
for(int i=0;i<n;i++) cin>>arr[i];
cout<<solve(arr);
return 0;
}
Mex Number
@allcoding1
21 554
#include <iostream>
#include <vector>
using namespace std;
vector<int> HeightProblem(int n, vector<int>& arr) {
Ā Ā Ā vector<int> ans(n);
Ā Ā Ā for (int i = 0; i < n; ++i) {
Ā Ā Ā Ā Ā Ā Ā int height = arr[i];
Ā Ā Ā Ā Ā Ā Ā int closestLeftHeight = -1;
Ā Ā Ā Ā Ā Ā Ā for (int j = i - 1; j >= 0; --j) {
Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā if (arr[j] < height) {
Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā closestLeftHeight = arr[j];
Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā break;
Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā }
Ā Ā Ā Ā Ā Ā Ā }
Ā Ā Ā Ā Ā Ā Ā ans[i] = closestLeftHeight;
Ā Ā Ā }
Ā Ā Ā return ans;
}
Height problem
21 554
#include <iostream>
#include <vector>
using namespace std;
vector<int> HeightProblem(int n, vector<int>& arr) {
Ā Ā Ā vector<int> ans(n);
Ā Ā Ā for (int i = 0; i < n; ++i) {
Ā Ā Ā Ā Ā Ā Ā int height = arr[i];
Ā Ā Ā Ā Ā Ā Ā int closestLeftHeight = -1;
Ā Ā Ā Ā Ā Ā Ā for (int j = i - 1; j >= 0; --j) {
Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā if (arr[j] < height) {
Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā closestLeftHeight = arr[j];
Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā break;
Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā }
Ā Ā Ā Ā Ā Ā Ā }
Ā Ā Ā Ā Ā Ā Ā ans[i] = closestLeftHeight;
Ā Ā Ā }
Ā Ā Ā return ans;
}
Height problem ā
21 554
Repost from allcoding1_official
+8
šIT learning courses
šAll programing courses
šAbdul bari courses
šAshok IT
Tutorials + Books + Courses + Trainings + Workshops + Educational Resources
š¹Data science
š¹Python
š¹Artificial Intelligence
š¹AWS Certified
š¹Cloud
š¹BIG DATA
š¹Data Analytics
š¹BI
š¹Google Cloud Platform
š¹IT Training
š¹MBA
š¹Machine Learning
š¹Deep Learning
š¹Ethical Hacking
š¹SPSS
š¹Statistics
š¹Data Base
š¹Learning language resources English , š«š·
100 rupees
Contact:- @meterials_available
21 554
![private static double[] calculateMovingAverage(int[] array, int K) { double[] smoo](https://cdn.tlmtr.io/_next/static/media/empty-channel.35ed232f.svg)
private static double[] calculateMovingAverage(int[] array, int K) {
double[] smoothedArray = new double[array.length - K + 1];
double sum = 0;
for (int i = 0; i < K; i++) {
sum += array[i];
}
for (int i = 0; i <= array.length - K; i++) {
if (i > 0) {
sum = sum - array[i - 1] + array[i + K - 1];
}
smoothedArray[i] = sum / K;
}
return smoothedArray;
}
Moving Averages
Telegram:-
21 554
#include<bits/stdc++.h>
using namespace std;
int main(){
Ā Ā Ā string a,b,c; cin>>a>>b>>c;
Ā Ā Ā vector<int>cnt(26,0);
Ā Ā Ā for(auto ele: a){
Ā Ā Ā Ā Ā Ā Ā cnt[ele-'A']++;
Ā Ā Ā }
Ā Ā Ā for(auto ele: b){
Ā Ā Ā Ā Ā Ā Ā cnt[ele-'A']++;
Ā Ā Ā }
Ā Ā Ā for(auto ele: c){
Ā Ā Ā Ā Ā Ā Ā cnt[ele-'A']--;
Ā Ā Ā }
Ā Ā Ā bool flag=true;
Ā Ā Ā for(auto ele: cnt){
Ā Ā Ā Ā Ā Ā Ā if(ele<0) flag=false;
Ā Ā Ā }
Ā Ā Ā if(flag) cout<<"YES"<<endl;
Ā Ā Ā else cout<<"NO"<<endl;
}
Magnetic Letters
21 554
#include <iostream>
#include <string>
using namespace std;
int smallest_possible_number(const string& S) {
Ā Ā Ā if (S.size() == 1 && S[0] == '0') {
Ā Ā Ā Ā Ā Ā Ā return -1;
Ā Ā Ā }
Ā Ā Ā if (S.find('1') == string::npos) {
Ā Ā Ā Ā Ā Ā Ā return -1;
Ā Ā Ā }
Ā Ā Ā int number = 1;
Ā Ā Ā int n = S.size();
Ā Ā Ā for (int i = n - 1; i >= 0; --i) {
Ā Ā Ā Ā Ā Ā Ā if (S[i] == '1') {
Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā if (number % (i + 1) != 0) {
Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā number *= (i + 1);
Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā }
Ā Ā Ā Ā Ā Ā Ā } else {
Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā while (number % (i + 1) == 0) {
Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā number += 1;
Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā }
Ā Ā Ā Ā Ā Ā Ā }
Ā Ā Ā }
Ā Ā Ā return number;
}
Base Conversion
21 554
+6šIT learning courses
šAll programing courses
šAbdul bari courses
šAshok IT
100 rupees
Contact:- @meterials_available
21 554
šÆAgoda SDE Tech Internship 2024
Graduation Year: 2025 / 2026
Eligibility: Ongoing pursuit of a Bachelorās or Masterās Degree in Computer Science or a related field.
Internship period: July ā Dec 2024
Interview process:
Registration closes: 21st April 2024
Hacker rank test starts: 26th April 2024
In-office interview date: 3rd May 2024
Location: Gurugram, Haryana
Apply Link: https://careersatagoda.com/job/5417820-tech-internship-2024-india-based-gurgaon-office/
Telegram:- @allcoding1
