BNY Mellon interview experience Real time questions & tips from candidates to crack your interview

Software Developer

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

Interview preparation journey

expand-icon
Journey
I started doing competitive programming in the 2nd semester of my B.Tech. and picked up a coding platform (focusing on topic-based DSA) in the 4th semester. I kept doing some development courses and built projects using the MERN stack whenever I got some time (summer/winter breaks). Just covering all these points helped me crack the interviews.
Application story
BNY Mellon visited my college for recruitment, so I applied through my college placement cell. The company visited in August.
Why selected/rejected for the role?
I was selected for this role because I was good in all DSA topics, had projects that could be discussed in interviews, and didn't panic during interviews (I was confident about my preparation).
Preparation
Duration: 6 months
Topics: Data Structures, Algorithms, OOPS, DBMS, OS, C++, NodeJS, MongoDB, ExpressJS
Tip
Tip

Tip 1: Prepare each topic on DSA, do at least 20 medium-level questions, and for topics like DP and graphs, do 50 questions.  
Tip 2: Don't ignore personal projects; make 2 good projects.  
Tip 3: Prepare core subjects towards the end of your preparation.  
Tip 4: Participate in contests on coding platforms; it helps in solving problems in a time-bound environment.

Application process
Where: Campus
Eligibility: Above 6 CGPA
Resume Tip
Resume tip

Tip 1 : Mention two good projects
Tip 2 : Mention any good rankings in coding competitions

Interview rounds

01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date10 Aug 2022
Coding problem4

1. Sort Array

Moderate
15m average time
85% success
0/80
Asked in companies
Tata Consultancy Services (TCS)BNY MellonAdobe

You are given an array consisting of 'N' positive integers where each integer is either 0 or 1 or 2. Your task is to sort the given array in non-decreasing order.

Note :
1. The array consists of only 3 distinct integers 0, 1, 2.
2. The array is non-empty.
Try solving now

2. Kth largest element in the unsorted array

Moderate
10m average time
90% success
0/80
Asked in companies
FacebookUberMicrosoft

You are given an array consisting of 'N' distinct positive integers and a number 'K'. Your task is to find the kth largest element in the array.

Example:
Consider the array {2,1,5,6,3,8} and 'K' = 3, the sorted array will be {8, 6, 5, 3, 2, 1}, and the 3rd largest element will be 5.
Note:
1) Kth largest element in an array is the kth element of the array when sorted in non-increasing order. 

2) All the elements of the array are pairwise distinct.
Try solving now

3. Task Scheduler

Moderate
35m average time
65% success
0/80
Asked in companies
UberFacebookOracle

A ninja needs to complete ‘n’ tasks. Each task is represented by an uppercase letter of the English alphabet. Different letters are assigned to different tasks. A ninja can complete tasks in any order. He takes one unit of time to complete one task. For each unit of time, he could complete either one task or just be idle.

Ninja easily gets bored by doing the same task again. So he decided to keep at least ‘t’ units of time between any two same tasks.

You are given a string ‘tasks’ consisting of ‘n’ uppercase letters of the English alphabet, representing the tasks ninja need to complete, and an integer ‘t’ representing the least units of time between any two same tasks. Find out the minimum total units of time ninja will take to complete all ‘n’ tasks.

Try solving now

4. Shortest path in an unweighted graph

Moderate
25m average time
70% success
0/80
Asked in companies
AmazonMicrosoftJP Morgan

The city of Ninjaland is analogous to the unweighted graph. The city has ‘N’ houses numbered from 1 to ‘N’ respectively and are connected by M bidirectional roads. If a road is connecting two houses ‘X’ and ‘Y’ which means you can go from ‘X’ to ‘Y’ or ‘Y’ to ‘X’. It is guaranteed that you can reach any house from any other house via some combination of roads. Two houses are directly connected by at max one road.

A path between house ‘S’ to house ‘T’ is defined as a sequence of vertices from ‘S’ to ‘T’. Where starting house is ‘S’ and the ending house is ‘T’ and there is a road connecting two consecutive houses. Basically, the path looks like this: (S , h1 , h2 , h3 , ... T). you have to find the shortest path from ‘S’ to ‘T’.

For example
In the below map of Ninjaland let say you want to go from S=1 to T=8, the shortest path is (1, 3, 8). You can also go from S=1 to T=8  via (1, 2, 5, 8)  or (1, 4, 6, 7, 8) but these paths are not shortest.

altImage

Try solving now
02
Round
Medium
Video Call
Duration45 minutes
Interview date18 Aug 2022
Coding problem2

1. Count Palindromic Subsequences

Hard
20m average time
80% success
0/120
Asked in companies
MyntraRIVIGOBNY Mellon

A subsequence of a string is achieved by removing some (possibly 0) characters without changing the order of the remaining characters.


You have been given a string 's'.


Find the number of non-empty palindromic subsequences (not necessarily be distinct) in string 's' and return that number modulo 10 ^ 9 + 7.


Example :
Input: 's' = "pqqr"

Output: 5

Explanation: The subsequences are:

p

q

q

r

qq

Please note that both "q" are considered different.
Try solving now

2. Wildcard Pattern Matching

Hard
50m average time
30% success
0/120
Asked in companies
OlaAmazonOptum

Given a text and a wildcard pattern of size N and M respectively, implement a wildcard pattern matching algorithm that finds if the wildcard pattern is matched with the text. The matching should cover the entire text not partial text.

The wildcard pattern can include the characters ‘?’ and ‘*’

 ‘?’ – matches any single character 
 ‘*’ – Matches any sequence of characters(sequence can be of length 0 or more)
Try solving now
03
Round
Medium
Video Call
Duration45 minutes
Interview date18 Oct 2023
Coding problem2

1. C++ Questions

Explanation of pointers. (Learn)

What are Structs? (Learn)

What are exceptions? (Learn)

2. Conceptual Question

Explain REST API, and why I used express in my project. (Learn

04
Round
Easy
HR Round
Duration25 minutes
Interview date18 Oct 2023
Coding problem1

1. Basic HR Questions

Where do you see yourself in 5 years?

Biggest failure/success.

What new technical skills have you picked up in the last 12 months?

 

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 3 + 2 * 4 based on operator precedence?

Choose another skill to practice
Similar interview experiences
company logo
Software Developer
3 rounds | 2 problems
Interviewed by BNY Mellon
982 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by BNY Mellon
0 views
0 comments
0 upvotes
company logo
Software Developer
3 rounds | 3 problems
Interviewed by BNY Mellon
0 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 6 problems
Interviewed by BNY Mellon
1155 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Developer
3 rounds | 8 problems
Interviewed by Tata Consultancy Services (TCS)
0 views
0 comments
0 upvotes
company logo
Software Developer
2 rounds | 3 problems
Interviewed by Tata Consultancy Services (TCS)
2388 views
0 comments
0 upvotes
company logo
Software Developer
3 rounds | 3 problems
Interviewed by HCL Technologies
1980 views
1 comments
0 upvotes