#include <vector>
#include <algorithm>
using namespace std;
bool c(const vector<int>& a, const vector<int>& b) {
return a[0] > b[0];
}
int solve(int n, int t, vector<vector<int>>& d) {
sort(d.begin(), d.end(), c);
long long r = t;
long long ans = 0;
while (r > 0) {
int p = -1;
for (int i = 0; i < n; ++i) {
if (d[i][1] > 0 && r % d[i][0] == 0) {
p = i;
break;
}
}
if (p == -1) return -1;
long long u = min(r / d[p][0], (long long)d[p][1]);
r -= u * d[p][0];
ans += u;
d[p][1] -= u;
}
return ans;
}
Infosys SP ✅
🚨 Need Help with Coding?
💻 Live Coding | Projects | Interviews | OA & Hackathons
💯 Expert Assistance Available
📩 DM: @codemaster004
#include <algorithm>
using namespace std;
bool c(const vector<int>& a, const vector<int>& b) {
return a[0] > b[0];
}
int solve(int n, int t, vector<vector<int>>& d) {
sort(d.begin(), d.end(), c);
long long r = t;
long long ans = 0;
while (r > 0) {
int p = -1;
for (int i = 0; i < n; ++i) {
if (d[i][1] > 0 && r % d[i][0] == 0) {
p = i;
break;
}
}
if (p == -1) return -1;
long long u = min(r / d[p][0], (long long)d[p][1]);
r -= u * d[p][0];
ans += u;
d[p][1] -= u;
}
return ans;
}
Infosys SP ✅
🚨 Need Help with Coding?
💻 Live Coding | Projects | Interviews | OA & Hackathons
💯 Expert Assistance Available
📩 DM: @codemaster004
def maximizePacketSum(packetSizes, k):
n = len(packetSizes)
if k > n:
return -1
d = {}
s = 0
m = -1
for i in range(n):
v = packetSizes[i]
s += v
d[v] = d.get(v, 0) + 1
if i >= k:
o = packetSizes[i - k]
s -= o
d[o] -= 1
if d[o] == 0:
del d[o]
if i >= k - 1:
if len(d) == k:
if s > m:
m = s
return m
IBM ✅
____
💻 Live Coding | Projects | Interviews | OA & Hackathons Help
📩 DM: @codemaster004
n = len(packetSizes)
if k > n:
return -1
d = {}
s = 0
m = -1
for i in range(n):
v = packetSizes[i]
s += v
d[v] = d.get(v, 0) + 1
if i >= k:
o = packetSizes[i - k]
s -= o
d[o] -= 1
if d[o] == 0:
del d[o]
if i >= k - 1:
if len(d) == k:
if s > m:
m = s
return m
IBM ✅
____
💻 Live Coding | Projects | Interviews | OA & Hackathons Help
📩 DM: @codemaster004
import requests
def findSpeedster(marathon, sex):
url = f"https://jsonmock.hackerrank.com/api/marathon?sex={sex}"
best_n = ""
best_s = -1.0
best_st = float('inf')
curr_p = 1
total_p = 1
while curr_p <= total_p:
resp = requests.get(f"{url}&page={curr_p}").json()
if curr_p == 1:
total_p = resp['total_pages']
for r in resp['data']:
if r['marathon_name'] == marathon:
s = float(r['top_speed'])
st = int(r['stops_taken'])
if s > best_s:
best_s = s
best_st = st
best_n = r['name']
elif s == best_s:
if st < best_st:
best_st = st
best_n = r['name']
curr_p += 1
return best_n
IBM ✅
_
💻 Live Coding | Projects | Interviews | OA & Hackathons Help
📩 DM: @codemaster004
def findSpeedster(marathon, sex):
url = f"https://jsonmock.hackerrank.com/api/marathon?sex={sex}"
best_n = ""
best_s = -1.0
best_st = float('inf')
curr_p = 1
total_p = 1
while curr_p <= total_p:
resp = requests.get(f"{url}&page={curr_p}").json()
if curr_p == 1:
total_p = resp['total_pages']
for r in resp['data']:
if r['marathon_name'] == marathon:
s = float(r['top_speed'])
st = int(r['stops_taken'])
if s > best_s:
best_s = s
best_st = st
best_n = r['name']
elif s == best_s:
if st < best_st:
best_st = st
best_n = r['name']
curr_p += 1
return best_n
IBM ✅
_
💻 Live Coding | Projects | Interviews | OA & Hackathons Help
📩 DM: @codemaster004
🔥 HCLTech is Hiring! 🔥
💻 Role:
* Freshers Hiring / Off-Campus Drive
* India
🎓 Eligibility:
* Batch: 2026
* Freshers
📌 Key Requirements:
* Good understanding of foundational software engineering concepts
* Strong analytical and communication skills
👇 Click below to apply:
🔗 Application Link : https://freshers.hcltech.com/?utm_source=OffCampus&utm_medium=OffCampus_T1Institutions_Batch2026&utm_campaign=OffCampus_T1Institutions_Batch2026&utm_term=HCLTech
💻 Live Coding Test | Projects | Interviews | OA & Hackathons Help
📩 DM: @codemaster004
💻 Role:
* Freshers Hiring / Off-Campus Drive
* India
🎓 Eligibility:
* Batch: 2026
* Freshers
📌 Key Requirements:
* Good understanding of foundational software engineering concepts
* Strong analytical and communication skills
👇 Click below to apply:
🔗 Application Link : https://freshers.hcltech.com/?utm_source=OffCampus&utm_medium=OffCampus_T1Institutions_Batch2026&utm_campaign=OffCampus_T1Institutions_Batch2026&utm_term=HCLTech
💻 Live Coding Test | Projects | Interviews | OA & Hackathons Help
📩 DM: @codemaster004
CODING SOLUTION - Placement Jobs & Materials
Photo
import java.util.*;
class Main {
public static int solve(int n, int[] w1, int[] v1, int[] w2, int[] v2, int c) {
int[] dp = new int[c + 1];
for (int i = 0; i < n; i++) {
for (int w = c; w >= 0; w--) {
int maxVal = dp[w];
if (w >= w1[i]) {
maxVal = Math.max(maxVal, dp[w - w1[i]] + v1[i]);
}
if (w >= w2[i]) {
maxVal = Math.max(maxVal, dp[w - w2[i]] + v2[i]);
}
dp[w] = maxVal;
}
}
return dp[c];
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
if (!sc.hasNextInt()) return;
int n = sc.nextInt();
int[] w1 = new int[n];
for (int i = 0; i < n; i++) w1[i] = sc.nextInt();
int[] v1 = new int[n];
for (int i = 0; i < n; i++) v1[i] = sc.nextInt();
int[] w2 = new int[n];
for (int i = 0; i < n; i++) w2[i] = sc.nextInt();
int[] v2 = new int[n];
for (int i = 0; i < n; i++) v2[i] = sc.nextInt();
int c = sc.nextInt();
int result = solve(n, w1, v1, w2, v2, c);
System.out.println(result);
sc.close();
}
}
INFOSYS ✅
💻 Live Coding Test | Projects | Interviews | OA & Hackathons Help
📢 DM @Codemaster004
class Main {
public static int solve(int n, int[] w1, int[] v1, int[] w2, int[] v2, int c) {
int[] dp = new int[c + 1];
for (int i = 0; i < n; i++) {
for (int w = c; w >= 0; w--) {
int maxVal = dp[w];
if (w >= w1[i]) {
maxVal = Math.max(maxVal, dp[w - w1[i]] + v1[i]);
}
if (w >= w2[i]) {
maxVal = Math.max(maxVal, dp[w - w2[i]] + v2[i]);
}
dp[w] = maxVal;
}
}
return dp[c];
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
if (!sc.hasNextInt()) return;
int n = sc.nextInt();
int[] w1 = new int[n];
for (int i = 0; i < n; i++) w1[i] = sc.nextInt();
int[] v1 = new int[n];
for (int i = 0; i < n; i++) v1[i] = sc.nextInt();
int[] w2 = new int[n];
for (int i = 0; i < n; i++) w2[i] = sc.nextInt();
int[] v2 = new int[n];
for (int i = 0; i < n; i++) v2[i] = sc.nextInt();
int c = sc.nextInt();
int result = solve(n, w1, v1, w2, v2, c);
System.out.println(result);
sc.close();
}
}
INFOSYS ✅
💻 Live Coding Test | Projects | Interviews | OA & Hackathons Help
📢 DM @Codemaster004
#include <iostream>
#include <string>
using namespace std;
bool chk(int m, int n, int k, const string& o) {
long long c = 0;
int lst = 0;
for (int i = 0; i < n; ++i) {
if (o[i] == '1') {
int cur = i + 1;
c += (cur - lst - 1) / m;
lst = cur;
}
}
c += (n + 1 - lst - 1) / m;
return c <= k;
}
int solve(int n, int k, string o) {
int l = 1, r = n + 1;
int ans = r;
while (l <= r) {
int m = l + (r - l) / 2;
if (chk(m, n, k, o)) {
ans = m;
r = m - 1;
} else {
l = m + 1;
}
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
if (cin >> n >> k) {
string o;
cin >> o;
cout << solve(n, k, o) << "\n";
}
return 0;
}
Infosys ✅
💻 Live Coding Test | Projects | Interviews | OA & Hackathons Help
📢 DN @Codemaster004
#include <string>
using namespace std;
bool chk(int m, int n, int k, const string& o) {
long long c = 0;
int lst = 0;
for (int i = 0; i < n; ++i) {
if (o[i] == '1') {
int cur = i + 1;
c += (cur - lst - 1) / m;
lst = cur;
}
}
c += (n + 1 - lst - 1) / m;
return c <= k;
}
int solve(int n, int k, string o) {
int l = 1, r = n + 1;
int ans = r;
while (l <= r) {
int m = l + (r - l) / 2;
if (chk(m, n, k, o)) {
ans = m;
r = m - 1;
} else {
l = m + 1;
}
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
if (cin >> n >> k) {
string o;
cin >> o;
cout << solve(n, k, o) << "\n";
}
return 0;
}
Infosys ✅
💻 Live Coding Test | Projects | Interviews | OA & Hackathons Help
📢 DN @Codemaster004
CODING SOLUTION - Placement Jobs & Materials
Photo
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
long long solve(int n, vector<vector<int>>& g) {
if (n == 0) return 0;
vector<vector<long long>> dp(n, vector<long long>(n, -2e18));
dp[0][0] = g[0][0];
for (int s = 1; s <= 2 * n - 2; ++s) {
vector<vector<long long>> ndp(n, vector<long long>(n, -2e18));
int mn = max(0, s - n + 1);
int mx = min(s, n - 1);
for (int x1 = mn; x1 <= mx; ++x1) {
for (int x2 = mn; x2 <= mx; ++x2) {
int y1 = s - x1;
int y2 = s - x2;
long long prv = -2e18;
if (x1 > 0 && x2 > 0) prv = max(prv, dp[x1 - 1][x2 - 1]);
if (x1 > 0 && y2 > 0) prv = max(prv, dp[x1 - 1][x2]);
if (y1 > 0 && x2 > 0) prv = max(prv, dp[x1][x2 - 1]);
if (y1 > 0 && y2 > 0) prv = max(prv, dp[x1][x2]);
if (prv != -2e18) {
long long val = g[x1][y1];
if (x1 != x2) val += g[x2][y2];
ndp[x1][x2] = prv + val;
}
}
}
dp = ndp;
}
return dp[n - 1][n - 1];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
if (cin >> n) {
vector<vector<int>> g(n, vector<int>(n));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> g[i][j];
}
}
auto result = solve(n, g);
cout << result << "\n";
}
return 0;
}
Infosys ✅
💻 Live Coding Test | Projects | Interviews | OA & Hackathons Help
📢 DM @Codemaster004
#include <vector>
#include <algorithm>
using namespace std;
long long solve(int n, vector<vector<int>>& g) {
if (n == 0) return 0;
vector<vector<long long>> dp(n, vector<long long>(n, -2e18));
dp[0][0] = g[0][0];
for (int s = 1; s <= 2 * n - 2; ++s) {
vector<vector<long long>> ndp(n, vector<long long>(n, -2e18));
int mn = max(0, s - n + 1);
int mx = min(s, n - 1);
for (int x1 = mn; x1 <= mx; ++x1) {
for (int x2 = mn; x2 <= mx; ++x2) {
int y1 = s - x1;
int y2 = s - x2;
long long prv = -2e18;
if (x1 > 0 && x2 > 0) prv = max(prv, dp[x1 - 1][x2 - 1]);
if (x1 > 0 && y2 > 0) prv = max(prv, dp[x1 - 1][x2]);
if (y1 > 0 && x2 > 0) prv = max(prv, dp[x1][x2 - 1]);
if (y1 > 0 && y2 > 0) prv = max(prv, dp[x1][x2]);
if (prv != -2e18) {
long long val = g[x1][y1];
if (x1 != x2) val += g[x2][y2];
ndp[x1][x2] = prv + val;
}
}
}
dp = ndp;
}
return dp[n - 1][n - 1];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
if (cin >> n) {
vector<vector<int>> g(n, vector<int>(n));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> g[i][j];
}
}
auto result = solve(n, g);
cout << result << "\n";
}
return 0;
}
Infosys ✅
💻 Live Coding Test | Projects | Interviews | OA & Hackathons Help
📢 DM @Codemaster004
CODING SOLUTION - Placement Jobs & Materials
Photo
#include <bits/stdc++.h>
using namespace std;
struct St {
long long s;
int c;
bool operator<(const St& o) const {
if (s != o.s) return s < o.s;
return c < o.c;
}
};
St mx(St a, St b) {
return a < b ? b : a;
}
St get_mx(const vector<int>& a, long long lam) {
int n = a.size();
St d0 = {0, 0};
St d1 = {-(long long)a[0] - lam, 1};
for (int i = 1; i < n; ++i) {
St n0 = mx(d0, d1);
long long v = -(long long)a[i];
St n1_ext = {d1.s + v, d1.c};
St n1_str = {d0.s + v - lam, d0.c + 1};
St n1 = mx(n1_ext, n1_str);
d0 = n0;
d1 = n1;
}
return mx(d0, d1);
}
long long solve(int n, int k, vector<int>& a) {
long long base = 0;
for (int i = 0; i < n; ++i) {
base += a[i];
}
St r0 = get_mx(a, 0);
long long best = 0;
if (r0.c <= k) {
best = r0.s;
} else {
long long l = 0, r = 2e14;
while (l <= r) {
long long mid = l + (r - l) / 2;
St cur = get_mx(a, mid);
if (cur.c >= k) {
best = cur.s + mid * k;
l = mid + 1;
} else {
r = mid - 1;
}
}
}
return base + 2 * best;
}
INFOSYS ✅
💻 Live Coding Test | Projects | Interviews | OA & Hackathons Help
📢 DM @Codemaster004
using namespace std;
struct St {
long long s;
int c;
bool operator<(const St& o) const {
if (s != o.s) return s < o.s;
return c < o.c;
}
};
St mx(St a, St b) {
return a < b ? b : a;
}
St get_mx(const vector<int>& a, long long lam) {
int n = a.size();
St d0 = {0, 0};
St d1 = {-(long long)a[0] - lam, 1};
for (int i = 1; i < n; ++i) {
St n0 = mx(d0, d1);
long long v = -(long long)a[i];
St n1_ext = {d1.s + v, d1.c};
St n1_str = {d0.s + v - lam, d0.c + 1};
St n1 = mx(n1_ext, n1_str);
d0 = n0;
d1 = n1;
}
return mx(d0, d1);
}
long long solve(int n, int k, vector<int>& a) {
long long base = 0;
for (int i = 0; i < n; ++i) {
base += a[i];
}
St r0 = get_mx(a, 0);
long long best = 0;
if (r0.c <= k) {
best = r0.s;
} else {
long long l = 0, r = 2e14;
while (l <= r) {
long long mid = l + (r - l) / 2;
St cur = get_mx(a, mid);
if (cur.c >= k) {
best = cur.s + mid * k;
l = mid + 1;
} else {
r = mid - 1;
}
}
}
return base + 2 * best;
}
INFOSYS ✅
💻 Live Coding Test | Projects | Interviews | OA & Hackathons Help
📢 DM @Codemaster004
Forwarded from OFF CAMPUS JOBS INDIA
🔥 Amazon is Hiring! 🔥
💻 Role:
Software Dev Engineer - 1 (SDE-1) - Bengaluru
🎓 Eligibility:
2024 / 2025 batch
Bachelor’s degree
1+ YOE (Years of Experience)
📌 Key Requirements:
Experience in at least 1 programming language
Job Id: 10432823
👇 Click below to apply:
🔗 Application Link : https://www.amazon.jobs/en/jobs/10432823/software-development-engineer-i-finops-fp-a
💻 Role:
Software Dev Engineer - 1 (SDE-1) - Bengaluru
🎓 Eligibility:
2024 / 2025 batch
Bachelor’s degree
1+ YOE (Years of Experience)
📌 Key Requirements:
Experience in at least 1 programming language
Job Id: 10432823
👇 Click below to apply:
🔗 Application Link : https://www.amazon.jobs/en/jobs/10432823/software-development-engineer-i-finops-fp-a