from collections import deque
def heat_spread(grid):
n = len(grid)
m = len(grid[0])
new_grid = [row[:] for row in grid]
directions = [(-1,0), (1,0), (0,-1), (0,1)]
for i in range(n):
for j in range(m):
if grid[i][j] == 'H':
for dx, dy in directions:
ni, nj = i + dx, j + dy
if 0 <= ni < n and 0 <= nj < m and grid[ni][nj] == '.':
new_grid[ni][nj] = 'H'
return new_grid
def simulate_heat(grid, start_x, start_y, end_x, end_y):
n = len(grid)
m = len(grid[0])
queue = deque()
visited = set()
queue.append((start_x, start_y, 0, grid))
visited.add((start_x, start_y))
while queue:
x, y, days, curr_grid = queue.popleft()
if (x, y) == (end_x, end_y):
return days
next_grid = heat_spread(curr_grid)
directions = [(-1,0), (1,0), (0,-1), (0,1)]
for dx, dy in directions:
nx, ny = x + dx, y + dy
if 0 <= nx < n and 0 <= ny < m and next_grid[nx][ny] == '.' and (nx, ny) not in visited:
visited.add((nx, ny))
queue.append((nx, ny, days + 1, next_grid))
return -1
# Input Format
n = int(input())
grid = []
for _ in range(n):
grid.append(list(input().strip()))
start_x, start_y = map(int, input().split())
end_x, end_y = map(int, input().split())
print(simulate_heat(grid, start_x, start_y, end_x, end_y))
City Heatwave – Codevita
PYTHON
#include <iostream>
#include <vector>
using namespace std;
vector<int> p;
int f(int x) {
if (p[x] == x) return x;
return p[x] = f(p[x]);
}
void m(int x, int y) {
int rx = f(x);
int ry = f(y);
if (rx != ry) {
p[rx] = ry;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, q;
if (cin >> n >> q) {
p.resize(n + 1);
for (int i = 0; i <= n; ++i) {
p[i] = i;
}
for (int i = 0; i < q; ++i) {
int l, r;
cin >> l >> r;
m(l - 1, r);
}
if (f(0) == f(n)) {
cout << "Yes\n";
} else {
cout << "No\n";
}
}
return 0;
}
Amazon Hackathon ✅
#include <vector>
using namespace std;
vector<int> p;
int f(int x) {
if (p[x] == x) return x;
return p[x] = f(p[x]);
}
void m(int x, int y) {
int rx = f(x);
int ry = f(y);
if (rx != ry) {
p[rx] = ry;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, q;
if (cin >> n >> q) {
p.resize(n + 1);
for (int i = 0; i <= n; ++i) {
p[i] = i;
}
for (int i = 0; i < q; ++i) {
int l, r;
cin >> l >> r;
m(l - 1, r);
}
if (f(0) == f(n)) {
cout << "Yes\n";
} else {
cout << "No\n";
}
}
return 0;
}
Amazon Hackathon ✅
INFOSYS SP ✅
━━━━━━━━━━━━━━━
🚨 Need Help with Coding Exams, Projects, or Technical Interviews?
💯 Get Expert 1-on-1 Assistance
📩 DM Now ➜ @codemaster004
⚡ Live Coding Assessments ⚡ Online Assessments (OA) ⚡ Technical Interviews ⚡ Projects & Assignments ⚡ Hackathons & Coding Challenges
━━━━━━━━━━━━━━━
🚨 Need Help with Coding Exams, Projects, or Technical Interviews?
💯 Get Expert 1-on-1 Assistance
📩 DM Now ➜ @codemaster004
⚡ Live Coding Assessments ⚡ Online Assessments (OA) ⚡ Technical Interviews ⚡ Projects & Assignments ⚡ Hackathons & Coding Challenges
#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