Wipro 9 am all codes available

DM @Mrtrueliving_ix ✔️🎉

Wipro 12 pm codes are available

DM @Mrtrueliving_ix 💯✔️

Flipkart SDE Help available.....

DM @Mrtrueliving_ix 💯🎉

Previous helping proofs 💯

https://t.me/code_alphix/836

https://t.me/code_alphix/880

Gaint Egale Help done ✔️

Test accomplished 🪄

Pics sharing.....🎉💻

All placement help available

#Gaint_Egale #Offcampus

n = int(input())
a = list(map(int, input().split()))
k = int(input())

res = []
i = 0
while i < n and len(res) < k:
if a[i] < 0:
res.append(i + 1)
a[i] *= -1
if i + 1 < n:
a[i + 1] *= -1
i += 1

if any(x < 0 for x in a):
print(-1)
else:
print(' '.join(map(str, res)))

N application ✔️

Another approach ✔️

#include <bits/stdc++.h>
using namespace std;

struct T {
int s, e, p;
};

int findLast(vector<T>& t, int i) {
int l = 0, h = i - 1, r = -1;
while (l <= h) {
int m = l + (h - l) / 2;
if (t[m].e <= t[i].s) {
r = m;
l = m + 1;
} else {
h = m - 1;
}
}
return r;
}

int maxP(int n, vector<T>& t) {
if (!n) return 0;

sort(t.begin(), t.end(), [](const T& a, const T& b) {
return a.e == b.e ? a.s < b.s : a.e < b.e;
});

vector<long long> dp(n + 1, 0);
for (int i = 0; i < n; i++) {
dp[i + 1] = dp[i];
int j = findLast(t, i);
if (j != -1) {
dp[i + 1] = max(dp[i + 1], dp[j + 1] + t[i].p);
} else {
dp[i + 1] = max(dp[i + 1], (long long)t[i].p);
}
}
return dp[n];
}

int main() {
int n, m;
cin >> n >> m;
vector<T> t(n);
for (int i = 0; i < n; i++) {
cin >> t[i].s >> t[i].e >> t[i].p;
}
cout << maxP(n, t) << endl;
return 0;
}


N- trolley ✔️

n = int(input())
s = list(map(int, input().split()))
m = int(input())
r = list(map(int, input().split()))

ss = set(s)
sr = set(r)
fs = [x for x in s if x in sr]
fr = [x for x in r if x in ss]

fn, fm = len(fs), len(fr)
if not fn or not fm:
print(0)
exit()

dp = [[0] * (fm + 1) for _ in range(fn + 1)]
for i in range(1, fn + 1):
for j in range(1, fm + 1):
if fs[i-1] == fr[j-1]:
dp[i][j] = dp[i-1][j-1] + 1
else:
dp[i][j] = max(dp[i-1][j], dp[i][j-1])

print(dp[fn][fm])

Network ✔️

#include <bits/stdc++.h>
using namespace std;

int main() {
int n;
cin >> n;
vector<int> s(n);
for (int i = 0; i < n; i++) cin >> s[i];
int m;
cin >> m;
vector<int> r(m);
for (int i = 0; i < m; i++) cin >> r[i];

set<int> ss(s.begin(), s.end()), sr(r.begin(), r.end());
vector<int> fs, fr;
for (int x : s) if (sr.count(x)) fs.push_back(x);
for (int x : r) if (ss.count(x)) fr.push_back(x);

int fn = fs.size(), fm = fr.size();
if (!fn || !fm) {
cout << 0 << endl;
return 0;
}

vector<vector<int>> dp(fn + 1, vector<int>(fm + 1, 0));
for (int i = 1; i <= fn; i++) {
for (int j = 1; j <= fm; j++) {
if (fs[i-1] == fr[j-1]) dp[i][j] = dp[i-1][j-1] + 1;
else dp[i][j] = max(dp[i-1][j], dp[i][j-1]);
}
}

cout << dp[fn][fm] << endl;
return 0;
}

Network - cpp ✔️

Add your friends help them to succeed 💯🎉

https://t.me/code_alphix

Cognizant Technical Help available...

✔️ all cluster available

✔️py , Java , csharp

Those who need 💯 test Clearance

DM @Mrtrueliving_ix 🎉

Previous helping proofs & placement offers

https://t.me/code_alphix/5976

https://t.me/code_alphix/5947

https://t.me/code_alphix/5869?single