CODING SOLUTION - Placement Jobs & Materials
Ir al canal en Telegram
🌀 ” Our Only Aim Is To Let Get Placed To You In A Reputed Company. “ Contact Admin: Mail me for collab offcampusjobsindiaadmin@gmail.com instagram.com/offcampusjobsindia_it Our Website : www.offcampusjobsindia.com
Mostrar más📈 Análisis del canal de Telegram CODING SOLUTION - Placement Jobs & Materials
El canal CODING SOLUTION - Placement Jobs & Materials (@codingsolution_it) en el segmento lingüístico de Inglés es un actor destacado. Actualmente la comunidad reúne a 129 376 suscriptores, ocupando la posición 152 en la categoría Carrera profesional y el puesto 1 684 en la región India.
📊 Métricas de audiencia y dinámica
Desde su creación el невідомо, el proyecto ha mostrado un crecimiento acelerado, reuniendo a 129 376 suscriptores.
Según los últimos datos del 24 octubre, 2026, el canal mantiene una actividad estable. En los últimos 30 días la variación de miembros fue de -889, y en las últimas 24 horas de -37, conservando un alto alcance.
- Estado de verificación: No verificado
- Tasa de interacción (ER): El promedio de interacción de la audiencia es 1.39%. Durante las primeras 24 horas tras publicar, el contenido suele obtener 0.44% de reacciones respecto al total de suscriptores.
- Alcance de las publicaciones: Cada publicación recibe en promedio 1 793 visualizaciones. En el primer día suele acumular 565 visualizaciones.
- Reacciones e interacción: La audiencia responde de forma activa: el promedio de reacciones por publicación es 0.
- Intereses temáticos: El contenido se centra en temas clave como t.me/codingsolution_it, vector, codevita, string, graduate.
📝 Descripción y política de contenido
El autor describe el recurso como un espacio para expresar opiniones subjetivas:
“🌀 ” Our Only Aim Is To Let Get Placed To You In A Reputed Company. “
Contact Admin:
Mail me for collab
offcampusjobsindiaadmin@gmail.com
instagram.com/offcampusjobsindia_it
Our Website :
www.offcampusjobsindia.com”
Gracias a la alta frecuencia de actualizaciones (últimos datos recibidos el 25 octubre, 2026), el canal mantiene la vigencia y un amplio alcance. La analítica demuestra que la audiencia interactúa activamente con el contenido, lo que lo convierte en un punto de referencia dentro de la categoría Carrera profesional.
129 376
Suscriptores
-3724 horas
-5037 días
-88930 días
Archivo de publicaciones
#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
+1
#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
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
🔥 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
+2
Wells Fargo ✅
💻 Live Coding Test | Projects | Interviews | OA & Hackathons
📩 DM: @codemaster004
+1
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
+1
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
![#include #include using namespace std; bool c(const vector& a, const vector& b) { return a[0] > b[0]; } int solve(](data:image/jpeg;base64,/9j/4AAQSkZJRgABAQAAAQABAAD/2wBDACgcHiMeGSgjISMtKygwPGRBPDc3PHtYXUlkkYCZlo+AjIqgtObDoKrarYqMyP/L2u71////m8H////6/+b9//j/2wBDASstLTw1PHZBQXb4pYyl+Pj4+Pj4+Pj4+Pj4+Pj4+Pj4+Pj4+Pj4+Pj4+Pj4+Pj4+Pj4+Pj4+Pj4+Pj4+Pj4+Pj/wAARCAAoAB4DASIAAhEBAxEB/8QAHwAAAQUBAQEBAQEAAAAAAAAAAAECAwQFBgcICQoL/8QAtRAAAgEDAwIEAwUFBAQAAAF9AQIDAAQRBRIhMUEGE1FhByJxFDKBkaEII0KxwRVS0fAkM2JyggkKFhcYGRolJicoKSo0NTY3ODk6Q0RFRkdISUpTVFVWV1hZWmNkZWZnaGlqc3R1dnd4eXqDhIWGh4iJipKTlJWWl5iZmqKjpKWmp6ipqrKztLW2t7i5usLDxMXGx8jJytLT1NXW19jZ2uHi4+Tl5ufo6erx8vP09fb3+Pn6/8QAHwEAAwEBAQEBAQEBAQAAAAAAAAECAwQFBgcICQoL/8QAtREAAgECBAQDBAcFBAQAAQJ3AAECAxEEBSExBhJBUQdhcRMiMoEIFEKRobHBCSMzUvAVYnLRChYkNOEl8RcYGRomJygpKjU2Nzg5OkNERUZHSElKU1RVVldYWVpjZGVmZ2hpanN0dXZ3eHl6goOEhYaHiImKkpOUlZaXmJmaoqOkpaanqKmqsrO0tba3uLm6wsPExcbHyMnK0tPU1dbX2Nna4uPk5ebn6Onq8vP09fb3+Pn6/9oADAMBAAIRAxEAPwCjaqCnTvVkR+1MskzCD9f51cWP60AV2TAHHcU7bipZEwhPpzURZR/EPzoAdZJiBf8AdBq0Af8AJpluuIlHoAP0qX5vT9KAGsMxN9KjeP15qcgmNge49KYxyoPqKAKKalGo/wDrVKNVi/yDRRQKwh1WP/INQnUECKoJ4AGcUUUBY//Z)
#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
+1
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
![#include #include using namespace std; vector p; int f(int x) { if (p[x] == x) return x; return p[x] = f(p[x]); } void m(int](data:image/jpeg;base64,/9j/4AAQSkZJRgABAQAAAQABAAD/2wBDACgcHiMeGSgjISMtKygwPGRBPDc3PHtYXUlkkYCZlo+AjIqgtObDoKrarYqMyP/L2u71////m8H////6/+b9//j/2wBDASstLTw1PHZBQXb4pYyl+Pj4+Pj4+Pj4+Pj4+Pj4+Pj4+Pj4+Pj4+Pj4+Pj4+Pj4+Pj4+Pj4+Pj4+Pj4+Pj4+Pj/wAARCAAoACMDASIAAhEBAxEB/8QAHwAAAQUBAQEBAQEAAAAAAAAAAAECAwQFBgcICQoL/8QAtRAAAgEDAwIEAwUFBAQAAAF9AQIDAAQRBRIhMUEGE1FhByJxFDKBkaEII0KxwRVS0fAkM2JyggkKFhcYGRolJicoKSo0NTY3ODk6Q0RFRkdISUpTVFVWV1hZWmNkZWZnaGlqc3R1dnd4eXqDhIWGh4iJipKTlJWWl5iZmqKjpKWmp6ipqrKztLW2t7i5usLDxMXGx8jJytLT1NXW19jZ2uHi4+Tl5ufo6erx8vP09fb3+Pn6/8QAHwEAAwEBAQEBAQEBAQAAAAAAAAECAwQFBgcICQoL/8QAtREAAgECBAQDBAcFBAQAAQJ3AAECAxEEBSExBhJBUQdhcRMiMoEIFEKRobHBCSMzUvAVYnLRChYkNOEl8RcYGRomJygpKjU2Nzg5OkNERUZHSElKU1RVVldYWVpjZGVmZ2hpanN0dXZ3eHl6goOEhYaHiImKkpOUlZaXmJmaoqOkpaanqKmqsrO0tba3uLm6wsPExcbHyMnK0tPU1dbX2Nna4uPk5ebn6Onq8vP09fb3+Pn6/9oADAMBAAIRAxEAPwBY402Kdg6CpAqjooFIgO0fSnhKAG4FG3NSbKXZQBXKLnlAfwoqx5dFADQlSBD6/rShOeeakCj0oENCUoUVIFHpRigYzbRUmKKBEAkAk2kN16kcVLvQfxr+dFFBTF82PH+sX86b58PeVP8AvoUUUEifaIP+eqf99UUUUAf/2Q==)
#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 ✅
SELECT
SUM(BALANCE) AS TOTAL_BALANCE,
COUNT(ACCOUNT_ID) AS ACCOUNT_COUNT
FROM
ACCOUNTS
WHERE
ACCOUNT_TYPE = 'Savings'
AND ACCOUNT_ID IN (
SELECT ACCOUNT_ID
FROM TRANSACTIONS
WHERE TRANSACTION_TYPE = 'Deposit'
);
Amazon Hackathon ✅
This is literally the cheapest way to learn from top IITs while still in college! 🎓
Masai Unlimited now at ₹99/week - for a limited time only ⚡
✅ AI, Data Science, ML, Product & more
⚡ iHub IIT Certifications
🤖 24×7 AI Tutor - ask doubts anytime
🌍 Learn in your Mother Tongue
No excuses left. Your future’s worth ₹99/week.
🔥 Join before prices go up!
👉 Sign up NOW: https://tinyurl.com/masai-unlimited-registration
Repost from OFF CAMPUS JOBS INDIA
Deloitte off Campus Drive
Job Profile : Associate Analyst
🎖 Eligibility : Any Graduate
🎖Batch - 2021 2025
Youtube - https://youtube.com/@offcampusjobsindia?si=i0EsNHXL-OlG3GuL
WhatsApp - https://whatsapp.com/channel/0029Va9upVdL2AU4AJeTCY3B
Instagram - https://www.instagram.com/offcampusjobsindia_it
🔗Apply Link
https://usijobs.deloitte.com/en_US/careersUSI/JobDetail/USI-EH26-EA-Growth-Purpose-CoAE-ODC-Associate-Analyst-Hyderabad/302302
This is literally the cheapest chance to learn from Top IITs while still in college! 🎓
Get Masai Unlimited & unlock:
✅ AI, Data Science, ML, Product Management & more
⚡ iHub IIT Certifications
🤖 24×7 AI Tutor — ask doubts anytime
🌍 Learn in YOUR language
No excuses. ₹1 isn’t the barrier, your mindset is.
🔥 Don’t wait — this offer can expire anytime.
👉 Sign up NOW:
https://tinyurl.com/masai-unlimited-registration
This is literally the cheapest chance to learn from Top IITs while still in college! 🎓
Get Masai Unlimited & unlock:
✅ AI, Data Science, ML, Product Management & more
⚡ iHub IIT Certifications
🤖 24×7 AI Tutor — ask doubts anytime
🌍 Learn in YOUR language
No excuses. ₹1 isn’t the barrier, your mindset is.
🔥 Don’t wait — this offer can expire anytime.
👉 Sign up NOW:
https://www.masaischool.com/unlimited
Repost from OFF CAMPUS JOBS INDIA
Accenture off Campus Drive
Job Profile : Application Support Engineers
🎖 Eligibility : Any Bachelor's Degree
🎖Batch - 2023, 2024, 2025
➡️ Detail Explanatin Video 👇
Youtube - https://youtube.com/@offcampusjobsindia?si=i0EsNHXL-OlG3GuL
WhatsApp - https://tinyurl.com/bdcr25cv
Instagram - https://www.instagram.com/offcampusjobsindia_it
🔗Apply Link
https://www.accenture.com/in-en/careers/jobdetails?id=ATCI-4817203-S1853038_en&title=Application+Support+Engineer