¡Ya disponible! Investigación de Telegram 2025 — los principales insights del año 
IBM Oa Help | Oa Exam Helper
Ir al canal en Telegram
We are here to clear All types of Exams Admin : @Codercpp001 (aka) KMK ✅ INTERVIEW HELP AVAILABLE 1-Coding Round 2-Aptitude and Reasoning Round 3-Communication round 4-Resume building 🎉Job updates will be posted here.
Mostrar más1 156
Suscriptores
Sin datos24 horas
Sin datos7 días
+730 días
Archivo de publicaciones
#include <bits/stdc++.h>
#define int long long
using namespace std;
#define ll long long
ll solve(ll n,ll k,vector<ll>&a)
{
k++;
unordered_map<ll,ll>freq;
map<ll,vector<ll>>mpp;
for (ll i=0;i<n;i++)
{
freq[a[i]]++;
mpp[freq[a[i]]].push_back(a[i]);
}
ll ans=0;
for (auto it:mpp) ans+=it.second.size();
return ans;
}
signed main()
{
ll n,k; cin>>n>>k;
vector<ll>a(n);
for(ll i=0;i<n;i++) cin>>a[i];
cout<<solve(n,k,a);
return 0;
}
Sequence split ✅
const int MOD = 1000000007;
int subsetSumCount(const vector<int>& A, int L, int R, int K) {
vector<int> dp(K + 1, 0);
dp[0] = 1;
for (int i = L; i <= R; ++i) {
for (int j = K; j >= A[i]; --j) {
dp[j] = (dp[j] + dp[j - A[i]]) % MOD;
}
}
return dp[K];
}
int findXOR(int n, int Q, const vector<int>& A, const vector<vector<int>>& 😎 {
int result = 0;
for (const auto& query : 😎 {
int L = query[0] - 1;
int R = query[1] - 1;
int K = query[2];
int P = subsetSumCount(A, L, R, K);
result ^= P;
}
return result;
}
//subarray subset sum
#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;
}.
#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 <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 <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
// your code goes here
int t;
cin>>t;
while(t--){
int a;
cin>>a;
int ans=INT_MAX;
vector<int>v(a);
unordered_map<int,int>mp;
for(int i=0;i<a;i++){
cin>>v[i];
mp[v[i]]++;
}
for(auto x:mp){
int r=a-x.second;
int l=x.first;
l*=r;
ans=min(ans,l);
}
ans=min(ans,a);
cout<<ans<<endl;
}
}
void dfs(int node, int parent, const vector>>& graph,
const vector& minActivity, vector& activity, vector& vulnerable) {
activity[node] = 0; // initial activity is 0
for (const auto& edge : graph[node]) {
int next_node = edge.first;
int weight = edge.second;
if (next_node != parent) {
dfs(next_node, node, graph, minActivity, activity, vulnerable);
activity[node] += activity[next_node] + weight;
}
}
if (activity[node] > minActivity[node]) {
vulnerable[node] = true;
}
}
int getMinServers(int server_nodes, int server_edges, const vector& server_from,
const vector& server_to, const vector& server_weight,
int minActivity_count, const vector& minActivity) {
vector>> graph(server_nodes + 1);
for (int i = 0; i < server_edges; ++i) {
graph[server_from[i]].emplace_back(server_to[i], server_weight[i]);
graph[server_to[i]].emplace_back(server_from[i], -server_weight[i]);
}
vector activity(server_nodes + 1, 0);
vector vulnerable(server_nodes + 1, false);
dfs(1, -1, graph, minActivity, activity, vulnerable);
int vulnerableCount = count(vulnerable.begin(), vulnerable.end(), true);
return vulnerableCount;
}
