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

# SDE - 1

BNY Mellon
3 rounds | 7 Coding problems

## Interview preparation journey

Preparation
Duration: 8 months
Topics: 1. DSA (most imp) as they are interested in testing your problem-solving skills.2. Practice communicating while you code.3. Prepare everything that you have mentioned in your resume.4. CSE core subjects: OOP, DBMS, CN, Operating System
Tip

Tip 1 : Focus on building your problem-solving skills.
Tip 2 : Do not ignore the CSE core subject and projects.
Tip 3 : Give mock interviews so that you can communicate effectively in the interview.

Application process
Where: Campus
Eligibility: Female candidates, BE/BTech/ M.E/M.Tech/ MCA/ M.Sc. & MS Maths and Computing, CGPA 7 and above No current/active backlogs
Resume tip

Tip 1 : Keep it short and crisp
Tip 2 : Make your resume according to the job requirement
Tip 3 : Don't add fake projects etc
Tip 4 : Have 1-2 descent project in your resume

## Interview rounds

01
Round
Hard
Video Call
Duration60 minutes
Interview date23 Nov 2020
Coding problem2

The interview was scheduled for 10 am in the morning.
It started with a coding question related to Dynamic Programming Paradigm.
Then we further discussed the various data structures & algorithms and graph theory.
It was a mix of coding questions and theoretical concepts.
The interviewer was very nice and wanted to listen to various approaches that I gave.

### 1. Minimum Number Of Taps To Water Garden

Hard
15m average time
85% success
0/120

#### You are given an integer N, and an array named “ranges” of size N + 1(0-indexed). The ith tap, if opened, can water the gardener from point (i - ranges[i]) to (i + ranges[i]) including both. The task is to find the minimum number of taps that should be open to water the whole garden, return -1 if the garden can not be watered.

##### Example :

``````Can you solve the problem in O(N) time?
``````
Problem approach

1. Brute force
2. Optimised it using Dynamic Programming
3. Edge cases

### 2. Data Structures

What is a BST, what are other types of trees?
Theoretical questions based on the Graph data structure.
Where graph traversals algorithms are used?

Tell about different traversal algorithms and write the order of printing of nodes.

Problem approach

Have clear concepts.

02
Round
Medium
Video Call
Duration60 minutes
Interview date9 Dec 2020
Coding problem4

The interview included 2 coding questions and questions based on CSE core subjects.
The interview began with a question related to Linked List. After doing that I was asked many questions on CSE core concepts.
Then at last one more coding question was asked.

### 1. Cycle Detection in a Singly Linked List

Moderate
15m average time
80% success
0/80

#### A cycle occurs when a node's next points back to a previous node in the list.

##### Example:
``````In the given linked list, there is a cycle, hence we return true.
``````

Problem approach

1. It was a standard question so I told the approach
2. Wrote the code and checked the edge cases

### 2. Palindromic Substrings

Moderate
20m average time
80% success
0/80

#### You have been given a string STR. Your task is to find the total number of palindromic substrings of STR.

##### Example :
``````If the input string is "abbc", then all the possible palindromic substrings would be: ["a", "b", "b", c", "bb"] and hence, the output will be 5 since we have 5 substrings in total which form a palindrome.
``````
##### Note :
``````A string is said to be a 'Palindrome' if it is read the same forwards and backwards.
For example, “abba” is a palindrome, but “abbc” is not.

A 'Substring' is a contiguous sequence of characters within a string.
For example, "a", "b", "c", "ab", "bc", "abc" are substrings of "abc".
``````
Problem approach

1. Brute Force
2. Optimised it using DP
3. Edge cases

### 3. DBMS

Write a SQL query: Employee and department table is given you need to find the salary of employees in each department
Which databases have you used?
Difference between SQL and NoSQL? (Learn)
What is the CAP theorem?

Problem approach

Tip 1 : Practice writing SQL queries
Tip 2 : Make a note of all DBMS imp concepts and most common interview questions
Tip 3 : Before the interview, go through last moment notes om GFG

### 4. General Questions

- Switch vs Hub
- Which data structure is used in switches?
- TCP vs UDP

Problem approach

Tip 1 : Read mostly asked interview questions from Geeks for Geeks before interviews

03
Round
Medium
HR Round
Duration30 minutes
Interview date17 Dec 2020
Coding problem1

It was a technical+HR round with a senior member.
It was a discussion based on data structures.

Map data-structure was discussed a lot then a few questions related to my projects and some HR questions.

### 1. Data Structures

2. Favourite programming language?
4. How hashing is done in maps?
5. What is the Hash function? What will happen if a hash function returns 1 always?
6. Difference between a map and an unordered map?
The interviewer discussed a lot about map data structure.
7. Discussed the automation project which was mentioned in my resume.
8. What are the challenges that you've faced till now?
9. What technology you've worked on? Why you choose Django? What is ORM?
10. Which databases have you used? Where have you used it?

Problem approach

Tip 1 : Have a clear understanding of the internal implementation of data structures
Tip 2 : Know your projects and tech used
Tip 3 : Research a bit about the company

Here's your problem of the day

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

What does ROLLBACK do in DBMS?

Start a Discussion
Similar interview experiences
SDE - 1
2 rounds | 3 problems
Interviewed by BNY Mellon
4809 views
SDE - 1
3 rounds | 6 problems
Interviewed by BNY Mellon
0 views
SDE - 1
3 rounds | 6 problems
Interviewed by BNY Mellon
1401 views
SDE - 1
2 rounds | 8 problems
Interviewed by BNY Mellon
1006 views
Companies with similar interview experiences
SDE - 1
1 rounds | 2 problems
Interviewed by Tata Consultancy Services (TCS)
0 views