Passa al contenutoPassa al piè di pagina
  • Lavori
  • Aziende
  • Stipendi
  • Per le aziende

      Migliora la tua carriera

      Scopri le tue potenzialità di guadagno, trova lavori da sogno e condividi approfondimenti su lavoro e vita privata in forma anonima.

      employer cover photo
      employer logo
      employer logo

      Infosys

      Azienda coinvolta

      Circa
      Recensioni
      Stipendi e benefit
      Lavori
      Colloqui
      Colloqui
      Ricerche correlate: Recensioni su Infosys | Offerte di lavoro di Infosys | Stipendi di Infosys | Benefit di Infosys
      Colloqui di InfosysColloqui per specialist programmer L1 presso InfosysColloquio di Infosys


      Glassdoor

      • Chi siamo
      • Contattaci

      Aziende

      • Account Business gratuito
      • Spazio per le aziende
      • Blog per le aziende

      Informazioni

      • Aiuto
      • Linee guida
      • Condizioni d'uso
      • Privacy e scelte pubblicitarie
      • Non vendere né condividere le mie informazioni
      • Strumento per l'accettazione dei cookie

      Lavora con noi

      • Inserzionisti
      • Carriere
      Scarica l'app

      • Cerca:
      • Aziende
      • Lavori
      • Località

      Copyright © 2008-2026. Glassdoor LLC. "Glassdoor," "Worklife Pro," "Bowls" e il relativo logo sono marchi registrati di Glassdoor LLC.

      Aziende seguite

      Non lasciarti sfuggire opportunità e informazioni privilegiate seguendo le aziende dove vorresti lavorare.

      Ricerche di lavoro

      Ricevi suggerimenti e aggiornamenti personalizzati avviando le tue ricerche.

      Colloquio per specialist programmer L1

      9 dic 2025
      Candidato anonimo a colloquio
      Nessuna offerta
      Esperienza neutra
      Colloquio difficile

      Candidatura

      Ho presentato la mia candidatura tramite un selezionatore. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso Infosys nel mese di dic 2025

      Colloquio

      The interview process was quite lengthy and poorly organized. My interviews were rescheduled three times, and during the first two attempts the panel didn’t join at all. When the final interview finally took place, the interviewer appeared disengaged and not very approachable. Despite the role being focused on JavaScript, no JS-related questions were asked. Instead, they only presented a single dynamic programming problem with a time-based output requirement, which didn’t align well with the job description. Overall, the experience felt unstructured and did not give a clear picture of the role or expectations.

      Domande di colloquio [1]

      Domanda 1

      You are given three integers X, Y and Z and two arrays A and B both of length N. You are also given an integer sum which is initially equal to 0. You must perform N operations and in each ith operation you must do only one of the following: 1. 2. 3. Subtract B[i] from sum. Decrease both of X and Y by 1, then add A[i] * X * Y *Z to sum. Decrease both of Y and Z by 1, then add A[i] * X * Y *Z to sum. However, after each operation, X, Y and Z must all remain greater than or equal to 0. Find the maximum sum you can obtain after performing all operations. Sample Input: 2 1 2 2 0 0 10 5 Sample output: 0 Explanation: Here, N = 2, X = 1, Y = 2, Z = 2 A = [0, 0] B = [10, 5] It is given that in starting, sum = 0 operation 1: Apply type 2 operation (i.e. Decrease both of X and Y by 1, then add A[1]*X*Y*Z to sum) X = 0, Y = 1, Z = 2 sum = sum + 0*0*1*2 = 0 operation 2: Apply type 3 operation (i.e. Decrease both of Y and Z by 1, then add A[2]*X*Y*Z to sum) X = 0, Y = 0, Z = 1 sum = sum + 0*0*0*1 = 0 Hence, answer is the final value of sum i.e. sum = 0.
      Rispondi alla domanda
      1

      Altre recensioni di colloqui per specialist programmer L1 presso Infosys

      Colloquio per specialist programmer L1

      6 giu 2026
      Dipendente anonimo
      Noida
      Offerta accettata
      Esperienza positiva
      Colloquio nella media

      Candidatura

      Ho presentato la mia candidatura tramite l'università. Ho sostenuto un colloquio presso Infosys (Noida)

      Colloquio

      Interview began with a DSA question (medium level array based), after which Multiple Sql queries, join and related discussion. After this 2 More DSA Questions and questions related to resume

      Domande di colloquio [1]

      Domanda 1

      Merge 2 Sorted Arrays Anagram related DP Sql
      Rispondi alla domanda

      Colloquio per specialist programmer L1

      2 feb 2026
      Candidato anonimo a colloquio
      Nessuna offerta
      Esperienza positiva
      Colloquio difficile

      Candidatura

      Ho presentato la mia candidatura tramite l'università. Ho sostenuto un colloquio presso Infosys

      Colloquio

      Firstly introduce yourself than coding question moderate to advance. In last they asked some sql query. In coding questions they asked the moderate to hard level of problem and optimize all of them .In sql they asked about the join query and window function.

      Domande di colloquio [1]

      Domanda 1

      Find the Linked List Loop cycle and optimizes that.
      Rispondi alla domanda

      Colloquio per specialist programmer L1

      11 feb 2026
      Dipendente anonimo
      Hyderabad
      Offerta accettata
      Esperienza positiva
      Colloquio nella media

      Candidatura

      Ho sostenuto un colloquio presso Infosys (Hyderabad) nel mese di feb 2026

      Colloquio

      This is a onCampus Process... We had 2 rounds 1 coding test and other one is In-person Interview coding test involves 4 dsa Questions and Interview is mostly on dsa, core subjects, and sql.

      Domande di colloquio [1]

      Domanda 1

      Round 1: (Coding test) We have been asked to solve 4 DSA questions in 3hrs Question1: Should be easy mostly but in our slot it was a medium level question we need to extract length of max subarray with xor of all elemnts equal to given x and no elemnt in the subarray should occur more than k times. Question 2: This a easy question on array modification and simple counting Question 3 and Question 4: Thes are Hard Question which need to be solved using segment trees. I solved 1st question half , 2nd question fully and 4th question half. so i was selected for l1 role which is typically 11lpa Interview process: They started with core cs and dbms questions like unique key vs primary key, what is multithreading, internal fragmentation,normal forms, e.t.c Next they asked 2 sql queries one involving like and other involing groupby and aggregation functions Next they asked DSA question: in an array we should have index ia[j] count number of pairs satisifying this condition asked to write optimal solution which i wrote (it is O(nlogn). And a very small project discussion.
      Rispondi alla domanda