Deloitte | PWC | ATS resumes | Wipro | Infosys | Accenture | Capegemini | job links

Sharing our channel or not?🧐 Pls reply if you are sharing our channel @Coding_palace1

Longest palindrome concatenation ✅

Minimal String Code ✅ Python3 ✅ All test cases passed✅ Change variables ✅

Share our channel And sned me screenshot here https://t.me/InfosysCodess I will do their code next✅

Join @Coding_palace ✅

#include <bits/stdc++.h> #define int long long using namespace std; #define ll long long vector<vector<ll>> solve(ll n,ll k,vector<ll>&a,vector<ll>&b) { priority_queue<pair<double,pair<ll,ll>>> pq; for(int i=0;i<n;i++) { double x=a[i]; double y=b[i]; double dis=sqrt(x+y); pq.push({dis,{x,y}}); if(pq.size()>k) pq.pop(); } vector<vector<ll>>ans; while(!pq.empty()) { ans.push_back({pq.top().second.first,pq.top().second.second}); pq.pop(); } sort(begin(ans),end(ans)); return ans; } signed main() { ll n,k; cin>>n>>k; vector<ll>a(n),b(n); for(ll i=0;i<n;i++) cin>>a[i]; for(ll i=0;i<n;i++) cin>>b[i]; vector<vector<ll>>ans=solve(n,k,a,b); for(auto it:ans) cout<<it[0]<<" "<<it[1]<<endl; return 0; } Closet K Points Share our channel fast https://t.me/coding_palace

Share our channel And sned me screenshot here -->@Coding_palace1 I will do their code next✅

Let us make our channel -> @Coding_palace 4.8k I will share next code

Closest k origin👆

#include <bits/stdc++.h> #define int long long using namespace std; #define ll long long vector<vector<ll>> solve(ll n,ll k,vector<ll>&a,vector<ll>&b) {     priority_queue<pair<double,pair<ll,ll>>> pq;     for(int i=0;i<n;i++)     {         double x=a[i];         double y=b[i];         double dis=sqrt(x+y);         pq.push({dis,{x,y}});         if(pq.size()>k)  pq.pop();     }     vector<vector<ll>>ans;     while(!pq.empty())     {         ans.push_back({pq.top().second.first,pq.top().second.second});         pq.pop();     }     sort(begin(ans),end(ans));     return ans; } signed main() {                ll n,k; cin>>n>>k;         vector<ll>a(n),b(n);         for(ll i=0;i<n;i++) cin>>a[i];         for(ll i=0;i<n;i++) cin>>b[i];         vector<vector<ll>>ans=solve(n,k,a,b);         for(auto it:ans) cout<<it[0]<<" "<<it[1]<<endl;                 return 0; }

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

K closest

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 palindromic *?Infosys **✅

Want more codes ? Infosys exam✅ https://t.me/InfosysCodess

Send your questions here https://t.me/InfosysCodess

Want more codes? --> comment your code name here --> @Coding_palace1