2 DSA questions were asked. 1 was based on Dynamic Programming and other one is based on strings. Questions were asked from resume as well and from fundamentals, topics like DBMS, OOPS
Questions d'entretien [1]
Question 1
Question was asked from Dynamic programming topic, and other fundamental questions of subjects like DBMS, OOPS, OS, Python, SQL
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. J'ai passé un entretien chez Infosys
Entretien
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.
Questions d'entretien [1]
Question 1
Find the Linked List Loop cycle and optimizes that.
J'ai passé un entretien chez Infosys (Hyderâbâd) en févr. 2026
Entretien
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.
Questions d'entretien [1]
Question 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.