Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
BNY Mellon interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

BNY Mellon
upvote
share-icon
4 rounds | 8 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 6 Months
Topics: DSA,Competitive programming, full stack development, OS, DBMS, CN,
Tip
Tip

Tip 1 : Focus more on DSA and CP( Try to solve problems daily)
Tip 2 : Focus on CS fundamentals
Tip 3 : Try to make atleast 1 big good project( if possible try to participate in a hackathon or in any open source)

Application process
Where: Referral
Eligibility: 7 CGPA
Resume Tip
Resume tip

Tip 1 : Prepare resume consisting of only things you actually have done during your college time.
Tip 2 : Only one page is enough and good.

Interview rounds

01
Round
Hard
Online Coding Interview
Duration90 Minutes
Interview date9 Apr 2022
Coding problem0

This was an online coding round conducted on the Hackerrank platform and consisted of 4 questions.

1st question : (Easy - medium): Question was based on finding the kth largest element at some stages of iteration(slight variation of kth largest element question but problem was designed in such a way that was not easy to understand) , I solved it fully.
2nd question: (Medium-Hard): This question was based on greedy approach.( just like 4th problem of Div-2 on code chef , I solved 12 out off 13 test cases)
3rd Problem(Hard): It was difficult problem , as It required lot more pre-computation(do not remember the problem but difficulty was hard. I solved it partially.
4th problem(Hard): It was hard problem based on graphs where I had to apply DP to it as well(actual question do not remember).I solved it partially(but more than half).

I never saw it before that BNY Mellon asking such difficult questions in coding round itself. But I got selected for the interview round after a week(so those who solved more than 55% got selected for interviews I guess).

02
Round
Medium
Video Call
Duration45 minutes
Interview date21 Apr 2022
Coding problem3

This round mainly focused on data structures and algorithm skills. Their focus was mainly on accuracy and how you write the code.

1. Covid Vaccination

Moderate
0/80
Asked in companies
GoogleCurefitMicrosoft

We are suffering from the Second wave of Covid-19. The Government is trying to increase its vaccination drives. Ninja wants to help the Government to plan an effective method to help increase vaccination following safety measures. Time is running out. Can you help the nation?

You are given two positive integers: ‘n,’ ‘maxVaccines’ denoting the number of days for which this vaccination drive will go on and the total number of vaccines available for the drive, respectively. You have to find the number of vaccines administered each day. You are also given a number ‘dayNumber,’ and we are interested to know the maximum number of vaccines that can be administered on ‘dayNumber’ th day.

The rules of the vaccination drive :

1. There should be a positive number of vaccines administered each day during the vaccination drive.

2. The absolute difference between the number of vaccines in two consecutive days should not exceed 1.

3. The sum of all the elements of the vaccines array does not exceed maxVaccines, that is, you cannot administer more vaccines than what is provided to you.

4. Vaccines administered on ‘dayNumber’ th day should be maximized.

Try solving now

2. React Question

Based on React Js concepts as it was mentioned in my resume.

3. Rearrange Linked List

Moderate
22m average time
80% success
0/80
Asked in companies
AmazonIntuitOptum

You have been given a singly Linked List in the form of 'L1' -> 'L2' -> 'L3' -> ... 'Ln'. Your task is to rearrange the nodes of this list to make it in the form of 'L1' -> 'Ln' -> 'L2' -> 'Ln-1' and so on. You are not allowed to alter the data of the nodes of the given linked list.

For example:
If the given linked list is 1 -> 2 -> 3 -> 4 -> 5 -> NULL.

Then rearrange it into 1 -> 5 -> 2 -> 4 -> 3 -> NULL. 
Try solving now
03
Round
Medium
Video Call
Duration80 minutes
Interview date25 Apr 2022
Coding problem3

This was the round we discussed a lot of things together(both me and interviewer , He had 12+ years of experience from same company).

1. Best Time to Buy and Sell Stock

Moderate
20m average time
80% success
0/80
Asked in companies
IntuitOptumOYO

You are given an array/list 'prices' where the elements of the array represent the prices of the stock as they were yesterday and indices of the array represent minutes. Your task is to find and return the maximum profit you can make by buying and selling the stock. You can buy and sell the stock only once.

Note:

You can’t sell without buying first.
For Example:
For the given array [ 2, 100, 150, 120],
The maximum profit can be achieved by buying the stock at minute 0 when its price is Rs. 2 and selling it at minute 2 when its price is Rs. 150.
So, the output will be 148.
Try solving now

2. System Design Question

Let's say you are buying to shops to buy some fruits with different prices and any time you go to checkout, they tell you what is the price of what you bought.
but variations like you are giving off on the 3 items of same type if a person is getting. and so many other variations too..
I wrote code for all the variations , to cross check He asked me to run it on some test cases I coded successfully. and he got satisfied with those solutions.

3. Puzzle

Puzzle related to jugs with different capacities and dispersion tank.
we discussed lot of use cases of this puzzle and also I tried to give best answer using the Round robin way. Then he asked me how will you select the time quantum if capacity of each jug is same. I told to take average of them so that response time will be faster and no jug will go to starvation....He got satisfied. and then He discussed about the some concepts of vertical scaling and so on.

Problem approach

Actually He wanted to know whether I am able to code when different situations are put up and how much can I think of solutions to advance problems.

04
Round
Hard
Video Call
Duration60 minutes
Interview date9 May 2022
Coding problem2

Technical + Managerial Round

1. Minimum Cost Path

Moderate
25m average time
70% success
0/80
Asked in companies
Goldman SachsOlaSalesforce

You have been given a matrix of ‘N’ rows and ‘M’ columns filled up with integers. Find the minimum sum that can be obtained from a path which from cell (x,y) and ends at the top left corner (1,1).

From any cell in a row, we can move to the right, down or the down right diagonal cell. So from a particular cell (row, col), we can move to the following three cells:

Down: (row+1,col)
Right: (row, col+1)
Down right diagonal: (row+1, col+1)
Problem approach

Created a DP 2-D table.
solved for the first row and first column 
then from cell with index (1,1) to any (r,c) running a loop and finding that what is smallest distance from top and bottom and keeping that in that table at that index. and so on...

Try solving now

2. Basic HR Questions

1) Why do you want to join BNY mellon.
2) Show me the what kind of projects did you make( by showing the screen).
3) What all you know about BNY mellon and what It does and awards won by it.
and there were some more Questions from my Resume too.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is the index number of the last element of an array with 9 elements?

Choose another skill to practice
Join the Discussion
1 reply
Vaneela Khatri 8 May, 2023

Very helpful 

0 replies
0 upvotes
Reply
Report
Similar interview experiences
company logo
SDE - 1
2 rounds | 3 problems
Interviewed by BNY Mellon
4968 views
3 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by BNY Mellon
0 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by BNY Mellon
1441 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 8 problems
Interviewed by BNY Mellon
1046 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
1 rounds | 2 problems
Interviewed by Tata Consultancy Services (TCS)
0 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 4 problems
Interviewed by Tata Consultancy Services (TCS)
5725 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 3 problems
Interviewed by Tata Consultancy Services (TCS)
2174 views
0 comments
0 upvotes