Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO

#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 ✅ All test cases pass 👨‍💻✅

share your questions below 👇👇 https://t.me/exams_discussion https://t.me/exams_discussion

bool isp(string s){     int n=s.length();     for(int i=0;i<n/2;i++){         if(s[i]!=s[n-i-1]){             return false;         }     }     return true; } int longestString(vector<string>v){     unordered_map<string,int>mp;     for(auto x:v){         mp[x]++;     }     int ans=0;     for(auto x:mp){       if(x.second>1){         int k=(x.second)/2;           ans+=k*(x.first.length());        }       if(x.second%2!=0){          mp[x.first]=1;       }       else       mp.erase(x.first);     }     int maxi=0;     for(auto x:mp){         if(isp(x.first)){             maxi=max(maxi,(int)x.first.length());         }     }     return ans+maxi; } Max palindrome Infosys ✅

Closet k share @coding_000✅👨‍💻

Swap and delete string

#include <iostream> #include <vector> using namespace std; vector<bool> sieve(int max_val) {     vector<bool> is_prime(max_val + 1, true);     is_prime[0] = is_prime[1] = false;     for (int i = 2; i * i <= max_val; ++i) {         if (is_prime[i]) {             for (int j = i * i; j <= max_val; j += i) {                 is_prime[j] = false;             }         }     }     return is_prime; } int main() {     int N;     cin >> N;     vector<int> A(N);     int max_val = 0;     for (int i = 0; i < N; ++i) {         cin >> A[i];         if (A[i] > max_val) {             max_val = A[i];         }     }     vector<bool> is_prime = sieve(max_val);     int prime_count = 0, composite_count = 0;     for (int i = 0; i < N; ++i) {         if (is_prime[A[i]]) {             prime_count++;         } else {             composite_count++;         }     }     int good_pairs = prime_count * composite_count;     cout << good_pairs << endl;     return 0; }.   find good pairs in array Infosys ✅

#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 Infosys ✅

Good Sets int solve(const string& s) {     vector<int> lc;     for (int i = 0; i < s.size(); ++i) {         if (islower(s[i])) {             lc.push_back(i);         }     }     int m = 0;     int c = 0;     int p = -1;     for (int i : lc) {         if (p == -1 || s.substr(p + 1, i - p).compare(s.substr(p + 1, i - p)) != 0) {             c += 1;         } else {             c = 1;         }         m = max(m, c);         p = i;     }     return m; }

NoBody sharing 😢😕 Our channel @Coding_000❤️

How many Of u writing Infosys Exam Today ? Give reactions....❤️ Based on reactions i will help...✅ Otherwise I will sleep..😴 Share our channel make 4.5k 🎯🎯 Share @coding_000❤️✅

Join this group and share our channel i will share all Infosys codes 😊👨‍💻 @CODING_000👨‍💻😊 https://t.me/Coding_000 👨‍💻🆓 https://t.me/Coding_000 👨‍💻🆓 https://t.me/Coding_000 👨‍💻🆓 https://t.me/Coding_000 👨‍💻🆓 Share ✅ share ✅ share ✅

Who have Infosys exam guys?? Join this group and share our channel i will share all codes 😊👨‍💻 @CODING_000👨‍💻😊

Attention everyone!! Those who need help for Cognizant, Accenture, Revature or any placement tests clearance should contact @ILOVEU_143👨‍💻😊 and book your slots ✅ 100% CLEARANCE ✅👨‍💻 Remote access available🤞 Telegram: @ILOVEU_143✅ SHARE @coding_000✅👨‍💻

PYTHON 3✅ IBM ALL TEST CASES PASS 👨‍💻✅ SHare @coding_000👨‍💻✅

Placements Help Available 👍👍 If you also want to crack your current placements Contact: @ILOVEU_143 Book your slots ASAP Scroll above and check the work 💯 Clearence @Coding_000 Note: It's paid💶🤑 ✅Share✅Share✅Share ✅share✅

Those who need Job in It Companies can check this channel Join now @Offcampus_000 🔥🔥 Latest Jobs and Internships Updates for 2021,2022, 2023 and 2024 Batch

Placements Help Available 👍👍 If you also want to crack your current placements Contact: @ILOVEU_143 Book your slots ASAP Scroll above and check the work 💯 Clearence @Coding_000 Note: It's paid💶🤑 ✅Share✅Share✅Share ✅share✅

IMS - Off Campus - 2024 Hexaware Technologies Limited · Mumbai,Pune,Chennai https://app.joinsuperset.com/join/#/signup/student/jobprofiles/45f5ed91-e4a5-4fc4-a2d8-9cd88836b79c