List of Questions for BNY Mellon

Posted
6 Apr 2022
284 reads

Summary

I wanted to share a compilation of detailed questions that were presented during my interview process at BNY Mellon.

How it went

I encountered these specific questions during my recent interview rounds at BNY Mellon. I hope that by sharing them, I can assist fellow LeetCoders in their preparation and learning journey. These problems required a solid understanding of data structures and algorithms, pushing me to think through various approaches.

Questions asked (4)

  1. 01

    Total Distance to Duplicate Elements

    Data Structures & Algorithms

    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].

  2. 02

    Minimum Moves to Sort Array by Moving to End

    Data Structures & Algorithms

    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.

  3. 03

    Maximum Gap After Removing Bars

    Data Structures & Algorithms

    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.

  4. 04

    Max K for KxK Submatrix Sum Threshold

    Data Structures & Algorithms

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

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Bny Mellon recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!