ATS resume help
Ir al canal en Telegram
WhatsApp Me https://wa.me/917674087200 ✅ ATS-Friendly Resumes ✅ Higher Interview Calls ✅ Free Tips + Templates
Mostrar más3 745
Suscriptores
Sin datos24 horas
-177 días
-3130 días
Archivo de publicaciones
3 744
Share our channel
And sned me screenshot here
https://t.me/InfosysCodess
I will do their code next✅
3 744
Share our channel
And sned me screenshot here
https://t.me/InfosysCodess
I will do their code next✅
3 744
#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 ✅
3 744
#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
3 744
#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;
}
3 744
#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 ✅
3 744
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 **✅
3 744
#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 ✅
