There were 2 rounds. One purely technical, other little technical + HR. In the first interview, the interviewer asked me 4 DSA questions, about my projects and few questions regarding them, DBMS and ended it with my hobbies.
DSA : Give algorithm to find GCD of 2 numbers, then for 3 numbers. Write Fibonacci algorithm for nth number ( I wrote iterative with space for 3 integers. There is also a log(n) solution, you may check it out ). Give me all numbers in the array with exactly count = 2. Above questions were quite easy. Just this next one was quite good : You have a binary string, find the number of all substrings having equal number of 0s and 1s.
(I did it using hashmap of pair.) In the second interview, which was mostly non-technical, the interviewer still asked me what data structure would you use to implement the solve sudoku question. ( I answered : set )
The following metrics were computed from 2 interview experiences for the BNY SDE-Intern role in New Delhi, India.
BNY's interview process for their SDE-Intern roles in New Delhi, India is fairly selective, failing a large portion of engineers who go through it.
Candidates reported having very good feelings for BNY's SDE-Intern interview process in New Delhi, India.