18 questions · from 3 interviews

Bny Mellon interview questions

Every question candidates reported from their Bny Mellon interviews, most frequently asked first. Each links to the write-up it came from, so you can see the round and how it went.

Bny Mellon coding and DSA questions

  1. 01

    Reverse a String Without Built-in Functions

    Write code to reverse a given string without using any built-in string manipulation functions.

    Easy · From BNY Mellon | SDE | On Campus | Selected | Fresher

  2. 02

    STL Hashmap and Set Usage

    Write code utilizing C++ STL containers like std::unorderedmap (hashmap) and std::set .

    Medium · From BNY Mellon | SDE | On Campus | Selected | Fresher

  3. 03

    Detect Cycle in Linked List

    Explain how to identify a cycle in a linked list, specifically detailing the Hare and Tortoise (Floyd's Cycle-Finding) algorithm and the concept of slow and fast pointers.

    Medium · From BNY Mellon | SDE | On Campus | Selected | Fresher

  4. 04

    Convert Binary Number in a Linked List to Integer

    Given head which is a reference node to a singly-linked list. The value of each node in the linked list is either 0 or 1. The linked list holds the binary representation of a number. Return the decimal value of the number in the linked list.

    Easy · From BNY Mellon || Software Developer | Fresher | Pune, India | Oncampus

  5. 05

    Arrange Strings by Non-Consecutive Initials

    Given a vector of strings, arrange them in an order such that no two consecutively placed strings have the same initial character.

    Medium · From BNY Mellon || Software Developer | Fresher | Pune, India | Oncampus

  6. 06

    Total Distance to Duplicate Elements

    Given an array of integers, print out an array where at each index i, the total distance from i to every other duplicate element of i in the array is shown. For example, if the array was [1,3,1,1,2], the answer would be: [5,0,3,4,0].

    From List of Questions for BNY Mellon

  7. 07

    Minimum Moves to Sort Array by Moving to End

    Given an array of distinct integers, you may sort it by moving any element to the end of the array. Find the minimum number of moves to sort the array.

    From List of Questions for BNY Mellon

  8. 08

    Maximum Gap After Removing Bars

    Given N horizontal bars (numbered 1,2,...,N) and M vertical bars (1,2,...,M). There are list of X horizontal bars and Y vertical bars given which needs to be removed. After removal of given list of bars, we need to return the maximum gap which has been formed.

    From List of Questions for BNY Mellon

  9. 09

    Max K for KxK Submatrix Sum Threshold

    Find maximum value of k such that each kXk submatrix has sum less than or equal to givenSum.

    From List of Questions for BNY Mellon

Bny Mellon behavioural and HR questions

  1. 01

    Why BNY Mellon?

    Question about motivations for joining BNY Mellon.

    From BNY Mellon || Software Developer | Fresher | Pune, India | Oncampus

  2. 02

    Proudest Achievement

    Question about what I am most proud of in my life or career.

    From BNY Mellon || Software Developer | Fresher | Pune, India | Oncampus

  3. 03

    Inspiring Others

    A follow-up question asking if I had inspired anyone from my village, based on a previous answer.

    From BNY Mellon || Software Developer | Fresher | Pune, India | Oncampus

Bny Mellon other questions

  1. 01

    SQL Column Concatenation

    Explain or demonstrate how to concatenate multiple columns in SQL.

    Easy · From BNY Mellon | SDE | On Campus | Selected | Fresher

  2. 02

    SQL Joins and Complexities

    Discuss different types of SQL Joins and their time/space complexities.

    Medium · From BNY Mellon | SDE | On Campus | Selected | Fresher

  3. 03

    Handshakes in a Party Puzzle

    Solve a puzzle related to the number of handshakes in a party.

    Easy · From BNY Mellon | SDE | On Campus | Selected | Fresher

  4. 04

    Water Jug Problem

    Solve the classic Water Jug Problem, typically involving two jugs of different capacities and a target amount of water.

    Medium · From BNY Mellon | SDE | On Campus | Selected | Fresher

  5. 05

    Employee with Third Highest Salary

    Write a SQL query to find the employee with the third highest salary. This typically involves using joins and logic for Nth highest salary.

    Medium · From BNY Mellon || Software Developer | Fresher | Pune, India | Oncampus

  6. 06

    Handshake Puzzle

    Given n people at a party, if each person shakes hands with every other person exactly once, find the total number of handshakes.

    Easy · From BNY Mellon || Software Developer | Fresher | Pune, India | Oncampus

Bny Mellon interview questions FAQ

What questions are asked in Bny Mellon interviews?

Candidates reported 18 distinct questions across 3 Bny Mellon interviews. 9 coding and DSA questions, 3 behavioural and HR questions, 6 other questions.

How difficult are Bny Mellon interview questions?

Of the questions candidates rated, 45% were easy, 55% medium and 0% hard.