es
Feedback
INFOSYS EXAM SOLUTIONS

INFOSYS EXAM SOLUTIONS

Ir al canal en Telegram

🔥Guys plz Stop fearing for daily exams 📝 👨‍💻 @srksvk is here to help you all at lowest cost possible.💪 🌀 ” Our Only Aim Is To Let Get Placed To You In A Reputed Company 🔥Effort from our side = 💯 📱Main Channel: @coding_are 📱Tel I'd : @srksvk

Mostrar más

📈 Análisis del canal de Telegram INFOSYS EXAM SOLUTIONS

El canal INFOSYS EXAM SOLUTIONS (@coding_are) en el segmento lingüístico de Inglés es un actor destacado. Actualmente la comunidad reúne a 13 544 suscriptores, ocupando la posición 14 897 en la categoría Educación y el puesto 30 554 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 13 544 suscriptores.

Según los últimos datos del 29 julio, 2026, el canal mantiene una actividad estable. En los últimos 30 días la variación de miembros fue de 301, y en las últimas 24 horas de 36, conservando un alto alcance.

  • Estado de verificación: No verificado
  • Tasa de interacción (ER): El promedio de interacción de la audiencia es 6.07%. Durante las primeras 24 horas tras publicar, el contenido suele obtener 2.28% de reacciones respecto al total de suscriptores.
  • Alcance de las publicaciones: Cada publicación recibe en promedio 820 visualizaciones. En el primer día suele acumular 308 visualizaciones.
  • Reacciones e interacción: La audiencia responde de forma activa: el promedio de reacciones por publicación es 3.
  • Intereses temáticos: El contenido se centra en temas clave como placement, gaurntee, suree, capgemini, infosy.

📝 Descripción y política de contenido

El autor describe el recurso como un espacio para expresar opiniones subjetivas:
🔥Guys plz Stop fearing for daily exams 📝 👨‍💻 @srksvk is here to help you all at lowest cost possible.💪 🌀 ” Our Only Aim Is To Let Get Placed To You In A Reputed Company 🔥Effort from our side = 💯 📱Main Channel: @coding_are 📱Tel I'd : @srks...

Gracias a la alta frecuencia de actualizaciones (últimos datos recibidos el 30 julio, 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 Educación.

13 544
Suscriptores
+3624 horas
+1957 días
+30130 días
Archivo de publicaciones
Capgemini exam successfully completed by remote access Gaming and codeing round done with all tests cases passed ✅ Contact fo
+2
Capgemini exam successfully completed by remote access Gaming and codeing round done with all tests cases passed ✅ Contact for placement exam @srksbk

All exam help available Infosys Accenture pre exam Amazon Capgemini exam help available Contact fast and book your slots Contact @srksvk 200% suree clearance gaurntee ✅ Note - all company interview help available with sure clearance

All exam help available Infosys Accenture pre exam Amazon Capgemini exam help available Contact fast and book your slots Contact @srksvk 200% suree clearance gaurntee ✅ Note - all company interview help available with sure clearance

Josh technology 3 rounds exam successfully completed by remote access 👍👍👍👍 3/3 code done with all tests cases passed ✅ Co
+2
Josh technology 3 rounds exam successfully completed by remote access 👍👍👍👍 3/3 code done with all tests cases passed ✅ Contact for placement exam @srksvk

Josh technology exam successfully completed by remote access 👍👍👍👍👍👍 2/2 code done with all tests cases passed ✅ 35/35 M
+2
Josh technology exam successfully completed by remote access 👍👍👍👍👍👍 2/2 code done with all tests cases passed ✅ 35/35 MCQ done with all tests cases passed ✅ Contact for placement exam @srksvk

All exam help available Infosys Accenture pre exam Amazon Capgemini exam help available Contact fast and book your slots Contact @srksvk 200% suree clearance gaurntee ✅ Note - all company interview help available with sure clearance

Ibm exam successfully completed by remote access 👍👍👍 2/2 code done with all tests cases passed ✅ Contact for placement exa
+2
Ibm exam successfully completed by remote access 👍👍👍 2/2 code done with all tests cases passed ✅ Contact for placement exam @srksvk

Ibm exam successfully completed by remote access 👍👍👍 2/2 code done with all tests cases passed ✅ Contact for placement exa
+1
Ibm exam successfully completed by remote access 👍👍👍 2/2 code done with all tests cases passed ✅ Contact for placement exam @srksvk

All exam help available Infosys Accenture pre exam Amazon Capgemini exam help available Contact fast and book your slots Contact @srksvk 200% suree clearance gaurntee ✅ Note - all company interview help available with sure clearance

10am Swiggy exam successfully completed by remote access 👍👍👍👍👍 3/3 code done with all tests cases passed ✅✅ Contact for
+2
10am Swiggy exam successfully completed by remote access 👍👍👍👍👍 3/3 code done with all tests cases passed ✅✅ Contact for placement exam @srksvk

All exam help available Infosys Accenture pre exam Amazon Capgemini exam help available Contact fast and book your slots Contact @srksvk 200% suree clearance gaurntee ✅ Note - all company interview help available with sure clearance

26 April Infosys exam successfully completed by remote access 👍👍👍👍 5/5 slot done with all tests cases passed ✅✅ Contact f
+8
26 April Infosys exam successfully completed by remote access 👍👍👍👍 5/5 slot done with all tests cases passed ✅✅ Contact for placement exam @srksvk

Next code in 5 min

Everyone

Now share this group

https://t.me/coding_are Share this group ✅

import sys input = sys.stdin.readline def solve(N: int, C1: int, C2: int, C3: int, penalties: list) -> int: INF = 10**30 dp = [INF] * (N + 1) dp[0] = 0 for i in range(1, N + 1): dp[i] = min(dp[i], dp[i - 1] + C1 + penalties[i - 1]) if i >= 2: dp[i] = min(dp[i], dp[i - 2] + C2 + penalties[i - 2]) if i >= 3: dp[i] = min(dp[i], dp[i - 3] + C3 + penalties[i - 3]) return dp[N]

import java.util.*;

class Main {

public static int solve(int n,int k,int[] v,int[] w){

long sumA=0,sumB=0;
ArrayList<Integer> list=new ArrayList<>();

for(int i=0;i<n;i++){
if(v[i]==1)sumA+=w[i];
else sumB+=w[i];
list.add(w[i]);
}

if(sumA>sumB)return 0;

Collections.sort(list,Collections.reverseOrder());

int ops=0;

for(int x:list){
if(ops==k)break;
sumA+=x;
sumB-=x;
ops++;
if(sumA>sumB)return ops;
}

return -1;
}

public static void main(String[] args){
Scanner sc=new Scanner(System.in);

int n=sc.nextInt();
int k=sc.nextInt();

int[] v=new int[n];
for(int i=0;i<n;i++)v[i]=sc.nextInt();

int[] w=new int[n];
for(int i=0;i<n;i++)w[i]=sc.nextInt();

System.out.println(solve(n,k,v,w));
}
}

Go through function name

long long solve(int n,int low,int high,vector<int>& arr){ long long res=0,cur=0,MOD=1000000007; for(int i=0;i<n;i++){ if(arr[i]>=low && arr[i]<=high){ cur++; }else{ res=(res + (cur*(cur+1))/2)%MOD; cur=0; } } res=(res + (cur*(cur+1))/2)%MOD; return res; }