en
Feedback

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

ACCENTURE EXAM SOLUTIONS

ACCENTURE EXAM SOLUTIONS

Open in Telegram

🔥Guys plz Stop fearing for daily exams 📝 👨‍💻 @srksvk is here to help you all at lowest cost possible.💪 🌀 ” Our Only Aim Is To Let Get Placed To You In A Reputed Company 🔥Effort from our side = 💯 📱Main Channel: @coding_are 📱Tel I'd : @srksvk

Show more

📈 Analytical overview of Telegram channel ACCENTURE EXAM SOLUTIONS

Channel ACCENTURE EXAM SOLUTIONS (@coding_are) in the English language segment is an active participant. Currently, the community unites 13 823 subscribers, ranking 14 760 in the Education category and 28 177 in the India region.

📊 Audience metrics and dynamics

Since its creation on невідомо, the project has demonstrated rapid growth, gathering an audience of 13 823 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 -171 over the last 30 days and by 0 over the last 24 hours, overall reach remains high.

  • Verification status: Not verified
  • Engagement rate (ER): The average audience engagement rate is 3.50%. Within the first 24 hours after publication, content typically collects 1.07% reactions from the total number of subscribers.
  • Post reach: On average, each post receives 484 views. Within the first day, a publication typically gains 148 views.
  • Reactions and interaction: The audience actively supports content: the average number of reactions per post is 1.
  • Thematic interests: Content is focused on key topics such as placement, gaurntee, suree, capgemini, infosy.

📝 Description and content policy

The author describes the resource as a platform for expressing subjective opinions:
“🔥Guys plz Stop fearing for daily exams 📝 👨‍💻 @srksvk is here to help you all at lowest cost possible.💪 🌀 ” Our Only Aim Is To Let Get Placed To You In A Reputed Company 🔥Effort from our side = 💯 📱Main Channel: @coding_are 📱Tel I'd : @srks...”

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 Education category.

13 823
Subscribers
No data24 hours
-397 days
-17130 days
Posts Archive
int n = S.length();     unordered_map leftFreq, rightFreq;     unordered_set leftSet, rightSet;     // Initialize the rightFreq map and rightSet with the entire string S     for (char c : S) {         rightFreq[c]++;         rightSet.insert(c);     }     int maxX = 0;     // Traverse the string and adjust the left and  right sets and maps     for (int i = 0; i < n - 1; ++i) {         char c = S[i];         leftFreq[c]++;         rightFreq[c]--; if (rightFreq[c] == 0) {             rightSet.erase(c);         }         leftSet.insert(c);                 int currentSum = leftSet.size() + rightSet.size();         maxX = max(maxX, currentSum);     }     return n - maxX; Infosys ✅ Fully passed Split string ✅✅
07 Jul 2024, 03:12

Shortest string
Shortest string
07 Jul 2024, 02:58

Done first ✅✅✅✅
Done first ✅✅✅✅
07 Jul 2024, 02:38

Make it 12k
07 Jul 2024, 02:33

Gys share FAstt
07 Jul 2024, 02:33

long long solve(int n,vector<int>v){     long long ans=0;    sort(v.begin(),v.end());    for(int i=1;i<n;i++){     if(v[i]<=v[i-1]){         v[i]=v[i-1]+1;     }    }   ans=accumulate(v.begin(),v.end(),0);        return ans; } Minimum unique sum✅ Infosys ( Full passed ✅✅ Share @codeing_area
07 Jul 2024, 02:26

Guys, Make it 12k .. after 12 k I will send sloution
07 Jul 2024, 02:14

Next sloution After 12k I will uploaded ✅✅
07 Jul 2024, 02:01

#include <bits/stdc++.h> using namespace std; int equalzeroandone(vector<int>v){     int n=v.size();     for(int i=0;i<n;i++){         if(v[i]==0){             v[i]=-1;         }     }     int sum=0;     int ans=-1;    map<int,int>mp;     for(int i=0;i<n;i++){         sum+=v[i];         if(sum==0){             ans=i+1;         }         if(mp.find(sum)!=mp.end()){             ans=max(ans,i-mp[sum]);         }         else{             mp[sum]=i;         }     }     return ans; } int main() {     int n;     cin>>n;     vector<int>v(n);     for(int i=0;i<n;i++){         cin>>v[i];     }     cout<<equalzeroandone(v); } Equal no of zero and one(Infosys) Full passed ✅✅ Shared @codeing_area
07 Jul 2024, 01:57

Share with your Friends and in Big groups we will definitely post answers here We will Try to share Some answers Here also in our Groups. So must Join 1) @codeing_area 2) @codeing_area 3) @codeing_area
07 Jul 2024, 01:24

Accenture hackdivaa slot available ✅ Contact fast and book your slots ✅ Contact @srksvk Remote access available 🔥🥇🥇 200% suree clearance guarantee ✅🔥🔥 Priviously helped 👇👇👇 https://t.me/codeing_area/7643?single https://t.me/codeing_area/8059?single
07 Jul 2024, 00:07

Share with your Friends and in Big groups we will definitely post answers here We will Try to share Some answers Here also in our Groups. So must Join 1) @codeing_area 2) @codeing_area 3) @codeing_area
06 Jul 2024, 23:40

Accenture hackdivaa slot available ✅ Contact fast and book your slots ✅ Contact @srksvk Remote access available 🔥🥇🥇 200% suree clearance guarantee ✅🔥🔥 Priviously helped 👇👇👇 https://t.me/codeing_area/7643?single https://t.me/codeing_area/8059?single
06 Jul 2024, 14:20

Share with your Friends and in Big groups we will definitely post answers here We will Try to share Some answers Here also in our Groups. So must Join 1) @codeing_area 2) @codeing_area 3) @codeing_area
06 Jul 2024, 11:31

Now slot open 7 July Infosys sp 1 slot available ✅ Contact fast and book your slots ✅ @srksvk 200% suree clearance guarantee nd Remote access available 🔥
06 Jul 2024, 05:05
06 Jul 2024, ~11:39

Infosys sp exam help successfully done by remote access ✅✅ 3/3 code fully passed ✅✅✅ 🔥🔥🔥 Contact for placement exam @srksv
+2
Infosys sp exam help successfully done by remote access ✅✅ 3/3 code fully passed ✅✅✅ 🔥🔥🔥 Contact for placement exam @srksvk
06 Jul 2024, 04:50

Guys we are upload all code passed .. but no one sharing group
06 Jul 2024, 04:19

#include <bits/stdc++.h> #define ll long long using namespace std; ll solve(string s1, string s2) { ll m = s1.length(); ll n = s2.length(); vector<vector<ll>>dp(m+1,vector<ll>(n + 1)); for (ll i=1;i<= m;i++) { dp[i][0]=i; } for (ll j = 1; j <= n;j++) { dp[0][j] = j; } for (ll i = 1; i <= m; ++i) { for (ll j = 1; j <= n; ++j) { if (s1[i - 1] == s2[j - 1]) { dp[i][j] = dp[i - 1][j - 1]; } else { dp[i][j] = 1 + min(dp[i - 1][j], dp[i][j - 1]); if (i > 1 && j > 1 && s1[i - 1] == s2[j - 2]) { dp[i][j] = min(dp[i][j], 1 + dp[i - 1][j - 2]); } if (i > 1 && j > 1 && s1[i - 2] == s2[j - 1]) { dp[i][j] = min(dp[i][j], 1 + dp[i - 2][j - 1]); } } } } return dp[m][n]; } signed main() { string s1,s2; cin>>s1>>s2; cout<<solve(s1,s2)<<endl; return 0; } String operation. Just paste it
06 Jul 2024, 04:17

Guys we are upload all code passed pic ... but no one sharing group
06 Jul 2024, 04:13

Don't forget share the group @codeing_arra
06 Jul 2024, 04:05