Ho sostenuto un colloquio presso BNY (Chennai) nel mese di lug 2023
Colloquio
it was a hard process of 3 rounds, to note it was on campus process, all three were technical rounds, they asked as per my resume, and dsa questions on linkedlist and heap sort and also asked about current technologies
Ho presentato la mia candidatura tramite l'università. Ho sostenuto un colloquio presso BNY
Colloquio
The interview process was of 4 rounds, 1st of which was GD, followed by 2 technical rounds and 1 Hr round. The interview was on campus . Technical questions were tricky and included core CS topics.
Online Assessment:
The first stage was the Online Assessment, which was quite challenging. It consisted of four coding questions — two of medium difficulty and two hard. I successfully solved both medium-level questions. After the assessment, 25 students were shortlisted for the interview process.
Interview 1: Technical Interview
This round lasted around 30–40 minutes. I was asked two DSA questions — one based on Greedy Algorithms and the other on Dynamic Programming. I was able to solve the DP question completely but couldn’t optimize the space complexity for the Greedy problem. Following that, I was asked a few Computer Science fundamentals questions related to OOPs and DBMS. The interview concluded with discussion about my projects.
Interview 2: Technical Round (Not for Everyone)
Some candidates had an additional technical round focused on discussions related to projects and development. I did not go through this round, so I have limited information about it.
Interview 3: Technical + HR Round
In this round, I was asked one simple DSA problem, followed by one or two questions on Computer Science fundamentals. After that, the interviewer asked a few aptitude questions and concluded with some HR-related questions.
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso BNY (Bengaluru) nel mese di set 2023
Colloquio
2 rounds of interview - DSA round and other Manager round, 1st round medium difficulty and 2nd round kind of easy . I was asked implementation of trees string related questions oops and project related questions.
Domande di colloquio [1]
Domanda 1
implementation of tree oops project related questions