Envié una solicitud electrónica. Acudí a una entrevista en Infosys (Greater Noida)
Entrevista
First, there was an online assessment consisting of 4 coding questions.
To qualify for the interview, it was required to solve around 1.5 questions.
I successfully passed all test cases of the Easy-level question.
I also passed 11 out of 12 test cases for a Medium-level question.
Based on this performance, I was shortlisted for the interview.
Interview Round
In the interview, the discussion mainly focused on DSA, SQL, and projects:
DSA Question (Basic – Strings)
Find the frequency of a given substring in a given string.
SQL Question
Find the 2nd highest salary using:
RANK
DENSE_RANK
DSA Conceptual Question
Explanation of the Sieve of Eratosthenes algorithm.
Project Discussion
Detailed discussion about my projects
Explanation of my role, implementation, and problem-solving approach
Solicité el puesto a través de la escuela superior o la universidad. Acudí a una entrevista en Infosys (Noida)
Entrevista
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
Solicité el puesto a través de la escuela superior o la universidad. Acudí a una entrevista en Infosys
Entrevista
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.
Preguntas de entrevista [1]
Pregunta 1
Find the Linked List Loop cycle and optimizes that.
Acudí a una entrevista en Infosys (Hyderabad) en feb 2026
Entrevista
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.
Preguntas de entrevista [1]
Pregunta 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.