CODING SOLUTIONS | IBM | AMAZON CODING SOLUTIONS
Ir al canal en Telegram
8 815
Suscriptores
Sin datos24 horas
-207 días
-11730 días
Archivo de publicaciones
Outer Flag:
HQ8FLAG{579603cc48918ada9e73b9edd69a013
Inner Key:
HQ8{1a8814a7dce6960d572e0752d220ded9}
Apply meesho exam
👇
https://docs.google.com/forms/d/e/1FAIpQLSc3DvqJDjZeYjFZX2OgVPwm5shjCX4a0APzYBaTBoPzTf4khg/viewform?pli=1
29th last date 📅
For exam help contact @tcsrolex
💯% clearance guaranteed
HQ8FLAG{d2433675fd29ee095ed8ed0e67b9ac9}
Scrap Scrubber
TCS HackQuest
HQ8FLAG{c2b8c1d94d3f3afda53c4b09a4593a3}
Optimus Prime
TCS HackQuest
HQ8FLAG{eb29c30a8984c3a5dad34a305c542c9}
Script Scrutinizer
TCS HackQuest
TCS HackQuest Exam Answers:
HQ8FLAG{339b6dfe00dc94a6029cf999f36fb8c}
ICMP ESPIONAGE
TCS HackQuest
TCS HackQuest Exam Answers:
HQ8FLAG{339b6dfe00dc94a6029cf999f36fb8c}
ICMP ESPIONAGE
TCS HackQuest
HQ8FLAG{eb29c30a8984c3a5dad34a305c542c9}
Script Scrutinizer
TCS HackQuest
HQ8FLAG{c2b8c1d94d3f3afda53c4b09a4593a3}
Optimus Prime
TCS HackQuest
HQ8FLAG{d2433675fd29ee095ed8ed0e67b9ac9}
Scrap Scrubber
TCS HackQuest
https://www.mitsogo.com/career/opportunities-for-freshers/
mitsogo mass hiring
Apply now
For exam help contact @tcsrolex
⭕ Those who need help in 👇👇
🔹 𝗜𝗕𝗠 #ibm
🔹 𝗠𝗜𝗧𝗦𝗜𝗚𝗢
🔹 𝗠𝗘𝗘𝗦𝗛𝗢
🔹 𝗧𝗘𝗖𝗛𝗠
🔹 𝗝𝗨𝗦𝗣𝗔𝗬 #juspay
🔹 𝗔𝗠𝗔𝗭𝗢𝗡 #amazon
𝗮𝗻𝘆 𝗽𝗹𝗮𝗰𝗲𝗺𝗲𝗻𝘁 𝗲𝘅𝗮𝗺 help available ✅ and All online Exams help available
💯% clearance will be provided
Genuine help✅
🔸 Contact :----> @tcsrolex ❤🔥 for any placement exam.
C++
Lots of Tree
Infosys
using namespace std;
class Node {
public:
int data;
int weight;
vector<Node*> children;
};
int mod = 1e9 + 7;
int recurse(Node *root,int thresold){
if(root == NULL){
return 0;
}
int val = 0;
if(root->weight >= thresold){
val = root->data;
}
for(auto i : root->children){
val = (val % mod + recurse(i,thresold) % mod) % mod;
}
return val;
}
int solve(int n,int q,vector<vector<int>> arr,vector<vector<int>> queries){
map<int,Node*> mp;
mp[0] = new Node();
for(int i = 0;i < n;i++){
Node *parent = mp[arr[i][0]];
int weight = arr[i][2];
int value = arr[i][1];
Node *chld = mp[i + 1];
if(chld == NULL){
chld = new Node();
chld->data = value;
chld->weight = weight;
chld->children = vector<Node*>();
mp[i + 1] = chld;
}
parent->children.push_back(chld);
}
int val = 0;
for(auto i : queries){
Node *root = mp[i[0]];
val = ( val % mod + recurse(root,i[1]) % mod) % mod;
}
return val;
}
int main(){
int n,q;
cin >> n;
cin >> q;
int m1;
cin >> m1;
vector<vector<int>> arr(n,vector<int>(m1,0));
for(int i = 0;i < n;i++){
for(int j = 0;j < m1;j++){
cin >> arr[i][j];
}
}
int m2;
cin >> m2;
vector<vector<int>> queries(q,vector<int>(m2,0));
for(int i = 0;i < q;i++){
for(int j = 0;j < m2;j++){
cin >> queries[i][j];
}
}
cout << solve(n,q,arr,queries) << endl;
}
C++
Lots of Tree
Infosys
C++
Count Subsets
Infosys
int solve(vector<int>& arr)
{
if(arr.size()==1)
{
if(arr[0]==0) return 0;
else return 1;
} coding_000
int used = 0;
int start = 0;
int n = arr.size();
int result = 0;
for (int i = 0; i < n; i++)
{
while ((used&arr[i])!=0)
{
used ^= arr[start];
start++;
}
used |= arr[i];
if (start < i)
result+=i - start + 1;
}
return 2*result;
}
C++
Count Subsets
Infosys
C++
Max Strikes Again
Infosys
int dp[603];
int mex(vector<int>&v, int i, int j){
set<int>st;
for(int ind = i;ind <= j;ind++) st.insert(v[ind]);
int ans = 1;
for(auto pr : st){
if(pr == ans) ans++;
}
return ans;
}
int love(vector<int>& arr, int ind, int k){
int n = arr.size();
if(k == 1) return mex(arr, ind, n - 1);
if(dp[ind] != -1) return dp[ind];
int maxi = INT_MIN;
for(int i = ind;i <= (n - k);i++){
int ans = mex(arr, ind, i) + helper(arr, i + 1, k - 1);
maxi = max(maxi, ans);
}
return dp[ind] = maxi;
}
int solve(int N, int K, vector<int>A){
memset(dp, -1, sizeof(dp));
return love(A, 0 , K);
}
C++
Max Strikes Again
Infosys
C++
Good Edges
Infosys
#include<bits/stdc++.h>
using namespace std;
const int N=500005;
typedef long long ll;
int T,n,k,t,h[N];
ll dp[N][2];
struct edge{
int ver,net;
ll val;
}f[N*2];
void add(int x,int y,int z){
f[++t].net=h[x];
h[x]=t,f[t].ver=y;
f[t].val=z;
}
void dfs(int x,int fa){
dp[x][0]=dp[x][1]=0;
priority_queue<ll> q;
for(int i=h[x];i;i=f[i].net){
int y=f[i].ver;
if(y==fa) continue;
dfs(y,x);
dp[x][0]+=dp[y][0];
q.push(dp[y][1]+f[i].val-dp[y][0]);
}
dp[x][1]=dp[x][0];
int p=k;
while(p--&&q.size()&&q.top()>0){
if(p) dp[x][1]+=q.top();
dp[x][0]+=q.top();
q.pop();
}
}
int main(){
scanf("%d",&T);
while(T--){
int x,y,z;t=0;
scanf("%d%d",&n,&k);
for(int i=1;i<n;++i){
scanf("%d%d%d",&x,&y,&z);
add(x,y,z),add(y,x,z);
}
dfs(1,0);
printf("%lld\n",dp[1][0]);
for(int i=1;i<=n;++i) h[i]=0,dp[i][0]=dp[i][1]=0;
}
return 0;
}
C++
Good Edges
Infosys
while (t--)
{
int n = 0, m = 0, a = 0, b = 0, c = 0, d = 0, sum = 0, diff = 0, maxN = 0, minN = 0, count = 0, temp = 0;
bool flag = false;
cin >> n;
cin >> m;
int xx;
cin >> xx;
int yy;
cin >> yy;
vector<vector<int>> vv(n, vector<int>(m));
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
cin >> vv[i][j];
}
}
if (n == 1)
{
cout << -1 << endl;
continue;
}
int res = INT_MAX;
solve(vv, 0, xx, yy, res);
cout << res << endl;
}
return 0;
}
C++
Pay for Gift
Infosys
C++
Count beautiful sequence
Infosys
#include <iostream>
#include <vector>
const int MOD = 1000000007;
using namespace std;
int countBeautifulSequences(int n) {
if (n == 1) {
return 1;
}
vector<int> dp(n + 1, 0);
dp[1] = 1;
for (int i = 1; i <= n; ++i) {
for (int j = i; j <= n; ++j) {
dp[j] = (dp[j] + dp[j - i]) % MOD;
}
}
return (dp[n] - 1 + MOD) % MOD;
}
int main() {
int n;
cin >> n;
int result = countBeautifulSequences(n);
cout << result << endl;
return 0;
}
C++
Count beautiful sequence
Infosys
C++
String Dot
Infosys
int min_operations(string s) {
int n = s.length();
vector<vector<int>> dp(n, vector<int>(n, INT_MAX));
for (int i = 0; i < n; i++) {
dp[i][i] = 0;
}
for (int len = 2; len <= n; len++) {
for (int i = 0; i <= n - len; i++) {
int j = i + len - 1;
if (s[i] == s[j]) {
dp[i][j] = min(dp[i][j], dp[i + 1][j - 1]);
} else {
for (int k = i; k < j; k++) {
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] + 1);
}
}
}
}
return dp[0][n - 1];
}
C++
String Dot
Infosys
C++
Array Segment
Infosys
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll dp[10005][2];
const int mod = (1e9 + 7);
ll solve(ll i, ll o, ll n, ll k, vector<ll> &v) {
if (i > n) {
return 0;
}
if (dp[i][o] != -1)
return dp[i][o];
ll ans = 0;
if (o == 0) {
for (int j = i; j < min(n + 1, i + k); j++) {
ans = max(ans, solve(j + 1, 1 - o, n, k, v)) % mod;
}
} else {
ll ta = 0;
ll mx = 0;
for (int j = i; j < min(n + 1, i + k); j++) {
if (ta + v[j] >= 0) {
ta += v[j];
mx = max(mx, ta);
} else {
ta = 0;
}
ll c = solve(j + 1, 1 - o, n, k, v) % mod;
ans = max(ans, ((j - i + 1) * mx) % mod + c % mod);
}
}
return dp[i][o] = ans;
}
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v;
ll neg = 0;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
v.push_back(x);
if (x <= 0)
neg++;
}
if (neg == v.size()) {
cout << 0 << endl;
return 1;
}
memset(dp, -1, sizeof(dp));
cout << max(solve(0, 0, v.size() - 1, k, v), solve(0, 1, v.size() - 1, k, v)) << endl;
}
C++
Array Segment
Infosys
C++
Smart Taxi Driver
Infosys
#include <iostream>
#include <vector>
#include <deque>
#include <unordered_map>
using namespace std;
int smartTaxiDriver(int N, int K, vector<int>& T, vector<int>& P, vector<int>& C) {
unordered_map<int, vector<pair<int, int>>> g;
for (int i = 0; i < N - 1; ++i) {
g[P[i] - 1].push_back({i + 2, C[i]});
}
int mpc = 0;
for (int sn = 1; sn <= N; ++sn) {
vector<int> d(N + 1, -1);
d[sn] = 0;
deque<pair<int, int>> q = {{sn, 0}};
while (!q.empty()) {
auto [cn, cd] = q.front();
q.pop_front();
for (auto& [ne, rd] : g[cn]) {
if (d[ne] == -1 || d[ne] > cd + rd) {
d[ne] = cd + rd;
q.push_back({ne, d[ne]});
}
}
}
int pc = 0;
for (int des : T) {
if (d[des] <= K) {
pc++;
}
}
mpc = max(mpc, pc);
}
return mpc - 1;
}
int main() {
int N, K;
cin >> N >> K;
vector<int> T(N - 1), P(N - 1), C(N - 1);
for (int i = 0; i < N - 1; ++i) {
cin >> T[i];
}
for (int i = 0; i < N - 1; ++i) {
cin >> P[i];
}
for (int i = 0; i < N - 1; ++i) {
cin >> C[i];
}
int res = smartTaxiDriver(N, K, T, P, C);
cout << res << endl;
return 0;
}
C++
Smart Taxi Driver
Infosys
C++
Pay for Gift
Infosys
#include <bits/stdc++.h>
using namespace std;
void solve(vector<vector<int>> vv, int operation, int xx, int yy, int &res)
{
for (int i = 1; i < 3; i++)
{
int sum1 = 0;
for (int j = 0; j < vv.size(); j++)
{
sum1 += vv[j][i - 1];
}
int sum2 = 0;
for (int j = 0; j < vv.size(); j++)
{
sum2 += vv[j][i];
}
if (sum1 == sum2)
{
res = min(res, operation);
}
return;
}
for (int i = 0; i < vv.size(); i++)
{
solve(vv, operation, xx, yy, res);
vector<int> p1 = vv[i];
reverse(p1.begin(), p1.end());
solve(vv, operation + yy, xx, yy, res);
vector<int> p2 = vv[i];
int temp1 = p2[0];
int temp2 = p2[1];
int temp3 = p2[2];
p2[2] = temp1;
p2[1] = temp3;
p2[0] = temp2;
solve(vv, operation + xx, xx, yy, res);
vector<int> p3 = vv[i];
temp1 = p2[0];
temp2 = p2[1];
temp3 = p2[2];
p2[2] = temp2;
p2[1] = temp1;
p2[0] = temp3;
solve(vv, operation + xx, xx, yy, res);
}
return;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
