BNY Mellon Interview Experience for SDE 2023

It was an on-campus hiring process.

Online OA.

1. 2 technical Interview round
2. 1 HR interview round

Online OA, 4 questions in 120 minutes, Hacker-rank on 13^th August 2023 (Sunday)

• Sum of Distances

There is an undirected tree, T, with edges of length 1. Initially, each of the nodes stores a value equal to the node number. Shuffle these values among the nodes in such a way that no node stores a value equal to its node number.

There are two values to determine:

1. The minimum possible sum of the distances between the initial and final positions of all values.

2. The maximum possible sum of the distances between the initial and final positions of all values.

Example

T_nodes = 4

T_from= [1, 2, 3]

T_to= [2, 3, 4]

In the minimum distance shuffle, node values are switched with their neighbours. The distance is 1 +1+1+1=4. In the maximum distance shuffle, the distance is 3+1+1+3=8. Return [3, 8].

Constraints

• 1 ≤ T_nodes ≤ 10⁵

• 1 ≤ T_from[i], T_to[i] ≤ T_nodes

• T_from[i] ≠ T_to[i]

• Cyber Beacon Detection

A network security administrator has noticed a rogue signal or beacon that is affecting the network. It originates from coordinate (x, y). and illuminates nodes within a radius R. The network is represented as a rectangular grid with a bottom left coordinate (x1,y1) and a top right coordinate (x2,y2). Write a program to determine the number of nodes in the network that are completely illuminated by the beacon’s signal.

Note: A point (x,y) is completely illuminated if its distance from the circle’s center is less than or equal to R

Given, x1 = 0, y1 = 0, x2 = 1, y2 = 1, x = 0, yl=-7 and R = 8

Constraints

• -10⁵ ≤ x1, x2, y1, y2, xl, yl ≤ 10⁵

• 1 ≤ R ≤ 10⁹

• Potential Attack Vector

Cyber security analysts are working on a firewall algorithm to identify potential attack vectors in the network. A potential attack vector of an array keys is defined as a trio of key values (i, j, x) where i and j are keys such that both keys[i] and keys[j] are divisible by the key x. For example, some valid potential attack vectors of keys = [1, 2, 4] are (0, 1, 1), (2, 0, 1), (0, 2, 1), (1, 2, 2), (2, 2, 4), etc assuming that indexing starts from 0.

1. Given a network of n keys and a 2-d array queries of dimensions q*2, for each query, find the number of potential attack vectors (i, j, x) such that queries[x][0] <= x <= queries[x][1]. Report an array of exactly q integers where the ith element of the array is the answer to the ith query.
2. Given, n = 3, keys = [6, 9, 10], q = 2 and queries = [[2, 3], [9, 10]]

Constraints

• 1 ≤ n ≤ 10⁵

• 1 ≤ keys[i] ≤ 10⁶

• 1 ≤ q ≤10⁵

• 1 ≤ queries[i][0] ≤ queries[i][1] ≤ 10⁶

• Bit Profit

Given int n, int k, 2 array, profit and indicators

We have to use a subset of indicators such that the bitwise OR of the indicators is less than or equal to k. Given the arrays, indicators and profit, find the maximum possible sum of estimated profits of indicators such that the bitwise OR of the indicators is less than or equal to a given integer k.

Constraints

• 1 ≤ n ≤ 10⁵

• 0 ≤ indicators[i] < 2³⁰

• 1 ≤ profit[i] ≤ 10⁹

• 0 ≤ k < 2³⁰

I had done 3^rd and 4^th questions

and 2nd question partially (13/15)

Shortlisted 36 students for interview out of 200-250.

Round 1 [Technical Interview]

18^th August 2023 (Friday) | 11:30 AM – 12:15 PM

For all interview rounds, we had to go to the placement block and give an interview from there; the interview was online on Microsoft Teams.

Introduction

• 2 DSA questions, easy level
• I have to write the code (code pair)

Reverse words in a given string

https://www.geeksforgeeks.org/reverse-words-in-a-given-string/

Example

input – how are you

output – you are how

Find minimum number of coins that make a given value

https://www.geeksforgeeks.org/find-minimum-number-of-coins-that-make-a-change/

I told her the greedy approach first, and she told me to write the code; then, I explained the DP approach and the problem in the greedy approach, but she was satisfied with the greedy approach.

1. Why do you want to join the BNY Mellon?
2. And discussion about projects from my resume.
3. Any questions for her?

Overall, the experience was good; she was friendly, and I was confident there would be a 2nd round for me.

24 were selected for round 2 out of 33

Round 2 [Technical Interview]

18^th August 2023 (Friday) | 04:00 PM – 04:45 PM

Introduction

• No DSA question (I was expecting DSA questions along with project and development discussion)
• What are data structures, and why do we use them?

Resume project discussion

1. Types of APIs?
2. If our app has any bug after deployment, how will we resolve it?
3. Why do we use testing frameworks?
4. One simple SQL query (write code)

OS

• RACE condition

OOPS

• Inheritance
• Polymorphism
• Given base and derived class, both have a function named fun(), then in which ways can I use the fun() function of the base class

She asked questions about every topic I mentioned in my resume and checked my knowledge.

Overall, the round was okay; I was not entirely confident of having the next round.

13 were selected for the HR round out of 24.

Final round round (HR round)

25^th August 2023 | 11:30 AM – 12:00 PM

Introduction

• He asked me to go through my resume.
• I did that and explained the projects and told other things from the resume. (took 8-10 minutes).

I had mentioned problem-solving, So he gave me 1 question: If I have to find the number of total cars in a particular city, what will be my approach? I told him the best way is to contact RTO. Then he put the limit on resources(no access to anything, just pen paper) and time(we want an estimated number in 10-15 minutes), then we discussed my approach, and he was happy with that.

• I had mentioned trading in interest, So he told me to tell me about my experience.

I told about my experience in crypto and ongoing SIP.

• What qualities do you have? Because of that, we should hire you.

Overall, it was good, just a normal talk/discussion-like thing.

Results were declared on 29^th August 2023.

11 were selected for the SDE role out of 13.

I was selected.