BNY Mellon interview experience Real time questions & tips from candidates to crack your interview
Software Developer
BNY Mellon
3 rounds | 2 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 8-9 months
Topics: Data Structures, Algorithms(basic), DBMS, Operating systems, basics of web development.
Tip 1 : Try to code the data structures that you have learned to understand things better
Tip 2 : Try to solve the problem even if it is the worst possible solution you think and then try to optimize don't jump to get the
best possible solution
Tip 3 : Discuss things among peers it helps to improve the understanding, even try to teach someone anything new you learn, this is very helpful during the interviews as you will have habit of explaining things :) .
Application process
Where: Campus
Eligibility: 7+ cgpa
Tip 1 : Try to be honest in the resume don't write something you don't know, most of the time it backfires.
Tip 2 : Try to make 2 good projects for cv and know about the challenges you can face on the project and think about how you can solve that challenge.
Interview rounds
01
Round
Medium
Online Coding Test
Duration150
Interview date17 Oct 2019
Coding problem0
evening time
02
Round
Medium
Face to Face
Duration45 Minutes
Interview date2 Dec 2019
Coding problem1
Face to face interview.
1. Duplicate In Array
Easy
15m average time
85% success
0/40
Asked in companies
You are given an array ‘ARR’ of size ‘N’ containing each number between 1 and ‘N’ - 1 at least once. There is a single integer value that is present in the array twice. Your task is to find the duplicate integer value present in the array.
For example:
Consider ARR = [1, 2, 3, 4, 4], the duplicate integer value present in the array is 4. Hence, the answer is 4 in this case.
Note :
A duplicate number is always present in the given array.
Problem approach
Initially I thought about sorting then, using map I got a better solution
03
Round
Medium
Face to Face
Duration45 minutes
Interview date2 Dec 2019
Coding problem1
1. Puzzle
There is an 8 by 8 chessboard in which two diagonally opposite corners have been cut off. You are given 31 dominos, and a single domino can cover exactly two squares. Can you use the 31 dominos to cover the entire board?
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
Software Developer
3 rounds | 3 problems
Interviewed by BNY Mellon
Selected 
0 views
0 comments
0 upvotes
Software Engineer
3 rounds | 3 problems
Interviewed by BNY Mellon
Selected 0 views
0 comments
0 upvotes
Software Engineer
3 rounds | 3 problems
Interviewed by BNY Mellon
Selected 0 views
0 comments
0 upvotes
Software Developer
4 rounds | 9 problems
Interviewed by BNY Mellon
Selected 1064 views
0 comments
0 upvotes
Companies with similar interview experiences
Software Developer
3 rounds | 3 problems
Interviewed by HCL Technologies
Selected 3597 views
1 comments
0 upvotes
Software Developer
3 rounds | 6 problems
Interviewed by Arcesium
Selected 1748 views
0 comments
0 upvotes
Software Developer
3 rounds | 5 problems
Interviewed by HCL Technologies
Selected 4293 views
0 comments
0 upvotes