7 850
Subscribers
No data24 hours
-177 days
-10030 days
Data loading in progress...
Similar Channels
Tags Cloud
No data
Any problems? Please refresh the page or contact our support manager.
Incoming and Outgoing Mentions
---
---
---
---
---
---
Attracting Subscribers
March '25
March '250
in 0 channels
February '250
in 0 channels
Get PRO
January '250
in 0 channels
Get PRO
December '240
in 0 channels
Get PRO
November '24
+1
in 0 channels
Get PRO
October '24
+17
in 0 channels
Get PRO
September '24
+10
in 0 channels
Get PRO
August '24
+44
in 0 channels
Get PRO
July '24
+70
in 0 channels
Get PRO
June '24
+113
in 0 channels
Get PRO
May '24
+183
in 0 channels
Get PRO
April '24
+116
in 0 channels
Get PRO
March '24
+7
in 0 channels
Get PRO
February '24
+118
in 0 channels
Get PRO
January '24
+28
in 0 channels
Get PRO
December '23
+65
in 0 channels
Get PRO
November '23
+246
in 0 channels
Get PRO
October '23
+256
in 0 channels
Get PRO
September '23
+63
in 0 channels
Get PRO
August '23
+552
in 0 channels
Get PRO
July '23
+534
in 0 channels
Get PRO
June '23
+644
in 0 channels
Get PRO
May '230
in 0 channels
Get PRO
April '23
+444
in 0 channels
Get PRO
March '23
+338
in 0 channels
Get PRO
February '23
+212
in 0 channels
Get PRO
January '23
+1 059
in 0 channels
Get PRO
December '22
+144
in 0 channels
Get PRO
November '22
+63
in 0 channels
Get PRO
October '22
+4
in 0 channels
Get PRO
September '220
in 0 channels
Get PRO
August '22
+189
in 0 channels
Get PRO
July '22
+170
in 0 channels
Get PRO
June '22
+164
in 0 channels
Get PRO
May '22
+393
in 0 channels
Get PRO
April '22
+2 030
in 0 channels
Get PRO
March '22
+4 754
in 0 channels
Get PRO
February '22
+3 323
in 0 channels
Get PRO
January '22
+1 457
in 0 channels
| Date | Subscriber Growth | Mentions | Channels | |
| 03 March | 0 | |||
| 02 March | 0 | |||
| 01 March | 0 |
Channel Posts
Final Call for Accenture 28th October all Slots
Contact @captaincqt
Note - Take Refund if Exam Not Cleared.
| 2 | Final Call for Accenture 28th October all Slots
Contact @captaincqt
Note - Take Refund if Exam Not Cleared. | 178 |
| 3 | Final Call for Accenture 28th October Slots
Contact @captaincqt
Note - Take Refund if Exam Not Cleared. | 1 |
| 4 | Accenture
EXAM HELP AVAILABLE
CONTACT US IMMEDIATELY
100 percent Clearance guaranteed
@captaincpq8
@captaincpq8 | 130 |
| 5 | Accenture
EXAM HELP AVAILABLE
CONTACT US IMMEDIATELY
100 percent Clearance guaranteed
@captaincpq8
@captaincpq8 | 393 |
| 6 | Accenture
EXAM HELP AVAILABLE
CONTACT US IMMEDIATELY
100 percent Clearance guaranteed
@captainqke1
@captainqke1 | 133 |
| 7 | INFOSYS
EXAM HELP AVAILABLE
3 codes will be provided
CONTACT US IMMEDIATELY
100 percent Clearance guaranteed
@captainqke1
@captainqke1 | 811 |
| 8 | Final call
INFOSYS
EXAM HELP AVAILABLE
CONTACT US IMMEDIATELY
100 percent Clearance guaranteed
@captainqke1
@captainqke1 | 196 |
| 9 | Final call
INFOSYS
EXAM HELP AVAILABLE
CONTACT US IMMEDIATELY
100 percent Clearance guaranteed
@captainqke1
@captainqke1 | 158 |
| 10 | Final call
INFOSYS
EXAM HELP AVAILABLE
CONTACT US IMMEDIATELY
100 percent Clearance guaranteed
@captainqke1
@captainqke1 | 83 |
| 11 | Final call
INFOSYS
EXAM HELP AVAILABLE
First person who message us will help for free
CONTACT US IMMEDIATELY
@captainqke1
@captainqke1 | 74 |
| 12 | Final call
INFOSYS
EXAM HELP AVAILABLE
CONTACT US IMMEDIATELY
@captainqke1
@captainqke1 | 376 |
| 13 | Final call
INFOSYS
EXAM HELP AVAILABLE
CONTACT US IMMEDIATELY
@captainqke1
@captainqke1 | 66 |
| 14 | Final call
INFOSYS
EXAM HELP AVAILABLE
CONTACT US IMMEDIATELY
@captainqke1
@captainqke1 | 53 |
| 15 | Code Name - cost of string s
int solve(const string& S) {
vector<int> freq(26, 0);
for (char c : S) {
freq[c - 'a']++;
}
int total = 0;
for (int i = 0; i < 26; ++i) {
for (int j = i + 1; j < 26; ++j) {
total += freq[i] * freq[j] * abs(i - j);
}
}
return total;
}
100% Running ✅✅✅ | 1 672 |
| 16 | #include <iostream>
#include <unordered_set>
#include <string>
using namespace std;
void generateSubstrings(const string &s, int len, unordered_set<string> &substrings) {
for (int i = 0; i <= s.size() - len; ++i) {
substrings.insert(s.substr(i, len));
}
}
string findMinimalString(const string &s) {
unordered_set<string> substrings;
for (int len = 1; ; ++len) {
substrings.clear();
generateSubstrings(s, len, substrings);
string candidate(len, 'a');
while (true) {
if (substrings.find(candidate) == substrings.end()) {
return candidate;
}
int pos = len - 1;
while (pos >= 0 && candidate[pos] == 'z') {
candidate[pos] = 'a';
--pos;
}
if (pos < 0) break;
++candidate[pos];
}
}
}
int main() {
string S;
cin >> S;
cout << findMinimalString(S) << endl;
return 0;
}
Minimal String Code. | 1 554 |
| 17 |  Minimal String Code Done ✅✅ | 1 |
| 18 | Final call
INFOSYS
EXAM HELP AVAILABLE
First person who message us will help for free
CONTACT US IMMEDIATELY
@captainqke1
@captainqke1 | 1 015 |
| 19 | Final call
INFOSYS
EXAM HELP AVAILABLE
First person who message us will help for free
CONTACT US IMMEDIATELY
@captainqke1
@captainqke1 | 44 |
| 20 | Final call
INFOSYS
EXAM HELP AVAILABLE
CONTACT US IMMEDIATELY
@captainqke1
@captainqke1 | 1 |
