BNY Mellon || Software Developer | Fresher | Pune, India | Oncampus
Summary
I successfully secured a Software Developer role as a fresher at BNY Mellon, following an on-campus interview process that included an online coding assessment and three rounds covering a range of technical topics, data structures & algorithms, and behavioral questions, culminating in an offer.
Full Experience
I recently received an offer from BNY Mellon and am sharing my interview experience. As a 2023 graduate from a Top Tier-2 college, I was applying for a Software Developer position, with potential locations in Pune or Chennai.
Online Coding Assessment
This round consisted of four coding problems conducted on the HackerRank platform. The difficulty breakdown was one easy, two medium, and one hard problem. I managed to solve all of them, though the hard question only passed 5/15 test cases. Interestingly, candidates who solved one easy, one medium, and partially one medium problem also qualified for the interviews.
Round 1: Technical Interview (Elimination)
This round took place around 2 PM the day after the coding assessment and lasted about 1 hour and 10 minutes. My interviewer was a Team Leader at BNY Mellon. After mutual introductions, she inquired about my hackathon project involving NLP and asked a few questions on NLP and Dialogflow. We then moved to OOPS concepts, where I answered questions on basic inheritance, the Diamond problem (and its resolution in C++), various types of constructors and their differences, the effect of access modifiers on constructors, and a standard object slicing question. I explained these topics by writing code on OneNote and demonstrating changes as requested, predicting the output. In DBMS, I was asked to find the employee with the third highest salary, which required using a join and Nth highest salary logic. For DSA, I solved a problem live on a code pair platform where I had to execute my code against test cases: Convert Binary Number in a Linked List to Integer. The interviewer was very friendly, and I received a call for the second round within half an hour of completing this interview, scheduled for 4 PM (though it started at 5 PM due to technical difficulties).
Round 2: Technical Interview (Elimination)
The second round commenced at 5 PM on the same day and lasted 40 minutes. This interview was conducted by a person at the same level as the previous interviewer. After my introduction, she directly transitioned into Operating Systems. We discussed the basics of memory management, paging, segmentation, fragmentation, some concepts related to TLB, and virtual memory. Following this, she posed a medium-hard level DSA question: "You have given one vector of strings, arrange strings in such an order that no two strings with same initials will come consecutively." I couldn't run my code, but the approach I explained was correct, and she seemed satisfied with it. This interviewer was not as friendly and appeared disinterested for most of the interview. Despite my low hopes, I received a call for the final HR round about three hours later.
Round 3: HR Interview (Final Round)
The final HR round was scheduled for 11 PM on the same day and lasted 30 minutes. It was conducted by a Manager with extensive experience at BNY Mellon. The discussion began with my internship work. Subsequently, I faced standard HR questions such as, "Why do you want to join BNY Mellon?", "What is it that you are most proud of?", and a follow-up question, "Have you inspired anyone from your village?", based on my previous answer. I was also given a puzzle: "There are n people in a party. They do handshake with each other exactly once. Find the total number of handshakes." I confirmed if the manager was from a technical background before asking three questions of my own, which he found very impressive and answered enthusiastically.
Interview Questions (7)
Write a SQL query to find the employee with the third highest salary. This typically involves using joins and logic for Nth highest salary.
Given a vector of strings, arrange them in an order such that no two consecutively placed strings have the same initial character.
Question about motivations for joining BNY Mellon.
Question about what I am most proud of in my life or career.
A follow-up question asking if I had inspired anyone from my village, based on a previous answer.
Given n people at a party, if each person shakes hands with every other person exactly once, find the total number of handshakes.
Preparation Tips
I dedicated four months to intense LeetCode practice, supplementing it with two years of competitive programming on other platforms like CodeChef (where I achieved a 5-star rating) and Codeforces (expert). My LeetCode statistics include solving over 450 problems, comprising more than 70 hard, 300+ medium, and around 100 easy questions. This extensive practice honed my problem-solving skills across various data structures and algorithms, which proved crucial during the interviews.