BNY Mellon | SDE-1 (Fresher) | Pune/Chennai

Company: BNY Mellon
Status: Selected
Qualification: B.E. Chemical Engineering 2024 Grad (Tier - 1)
Position: Software Developer 1
Location: Pune/Chennai
Date of offer: August 2023

Online Assessment - (DSA) - 2 hours
Platform: Hackerrank

This round had 4 questions = 1 easy (Basic sort and implementation) + 2 medium (1 Backtracking and 1 0/1 knapsack) + 1 hard (DP). I was able to solve all 4.

1st Interview - (Technical) - 30 mins
Interviewer - Vice President

Introduce yourself.
Which languages do you know? (I answered C++ and Python).
What are the difference and similarity between C++ and Python?
Explain, implement and code Merge Sort.
Find factors of a number using recursion.
Display Fibonacci series upto K elements.

2nd Interview - (Technical) - 1 hr 20 mins
Interviewer - Senior Vice President

Asked about previous interview.
Theory questions from DBMS (Sql vs No-Sql, How data is stored in No-SQL etc)
SQL queries (Started with 2 tables and incresed difficult after each answer, at last it was 4 tables and stopped after I couldn't answer a question)
Asked about Frontend back-end (Which I didn't know as my projects were on AI/ML). I answered the questions intuitively. Eg - (What do you mean by Authentication? What is the difference between authentication and authorisation etc).
Given a Database of 5 million rows from which a backend is fetching data and displaying in frontend. How can you reduce the latency of data being shown in frontend? How can you optimise search of a row in the database? How can you optimise the searching of the rows whose name starts with 'G' in the database?
Asked about my projects and questions related to the tech stack and libraries used.
DSA - Given an array containing numbers including 0. Shift all zeroes to the right side and all nonzeros to the left keeping their order same. (At first say the approach and then code it).
DSA - What is hashmap? Can you implement a hashmap?(I couldn't, he gave some hints to implement it and I finally made a hashmap type function which works in less then O(n) time, finally it was like an array of linked lists where each array element was sorted linkedlist where each index of array was the value = (key % size of array), I had to code its key insertion and finding key and deleting it. Overall it was an abstract question I think to test my skills how I approach an unknown problem and give solution)
OS - What is the difference between multi-threading and multi-processing?
OS - What is deadlock?
HR - Where do you see yourself in 5 years from now?
Then he asked if I had any questions (I asked about the roles a fresher gets and their work) and interview ended.

3rd Interview - (HR + Technical) - 1 hr
Interviewer - Director

Introduction and question about previous interviews.
DSA - Given a document as a string. Find the longest palindromic word(s) in the document. Do it using recursion. (Approach first then code)
Low level system design - Design a lift system in an apartment with 42 floors where each floor has 2 switches for going up and down and elevator has switchs for each floor. There is a screen at each floor where it shows which elevator is coming to pick a passenger. A lift can carry multiple passengers.
DBMS - What is Normalisation? How many types are there? What is 1NF? What is BCNF?
OS - What is thread and process? How do you see and end process in windows? Do you know commands to see and end processes in Linux? How do processes communicate?
HR - As you have done Chemical engineering why do you want SDE job?
HR - Why do you want to join BNY?
Do you have any questions? (I asked about his role in the company. He drew a chart in a page and explained all the working of BNY and also his work in the company)(I also asked 2-3 small questions). After this the interview ended.

My Coding Stats

Leetcode : 2136 (Knight) 750+ probelm solved
Codeforces: 1616 ( Expert)
Codechef: 1940 (4*)
GFG: 1182 Coding Score, 300+ problems solved

BNY Mellon | SDE-1 (Fresher) | Pune/Chennai | August 2023 (Selected)

Hope this post helped !!