🏢 BNY Mellon Internship Interview Experience

1. 🏢 Company and Role

• Company: BNY Mellon

• Role : SDE Intern

• Batch/Year of Graduation: 2028

• Branch: Computer Engineering

2. 📝 Application Process

• Applied On-Campus
  Approximately 500 people were shortlisted for the OA → 39 were selected for Interview Round 1 → 15 were selected for Interview Round 2 → 6 were selected + 4 were waitlisted
  

• Timeline:

  • Application Date: Mid June

  • Online Assessment Date: 25/7/2026

  • Interview Dates: 10/8/2026

  • Offer Date: 10/8/2026

3. 💻 Interview Rounds

Round 1: Online Assessment

• Type: DSA + Debugging, 1.5 hours
  

  • Description:
    This round consisted of 3 questions. There were 2 DSA questions and 1 debugging round, in which we had to select any one programming language such as JavaScript, Flask, etc.
    
    Question 1 :
    The first question was based on an array.
    
    https://www.geeksforgeeks.org/dsa/find-minimum-number-of-merge-operations-to-make-an-array-palindrome/?hl=en-IN

    The main idea involved a two-pointer/greedy approach.
    
    I was able to solve it in around 15 minutes.
    
    Question 2 :
    It was based on MEX
    
    https://leetcode.com/problems/lexicographically-maximum-mex-array/description/?hl=en-IN
    
    
    I was able to think of the brute force approach, but it would result in TLE for large inputs. Since partial test cases carried marks, I decided to implement the brute force approach.

    Initially, I was using two for loops ( O (2n) ) inside another for loop ( O(n) ), which resulted in an overall time complexity of O(n²). When I ran the code, only 1 test case passed.

    In the last 20 minutes, I tried to optimize the code as much as possible. I applied if statements and merged two for loops into one, reducing the time complexity from O(2n) to O(n).

    As a result, 14 out of 15 test cases passed. This turned out to be a game changer for my OA round.
    
    
    
    Question 3 :
    I did not get enough time to solve this question.
    

• Difficulty Level: Medium-Hard
  

• Your Experience: Sometimes, even a small optimization can make a big difference in a problem.

  ---

Round 2: 🧑‍💻 Technical Interview 1

• Type: Technical + Resume
  

  • Description:
    
    The interviewer first gave his introduction, followed by my introduction. He then asked me to explain my project, Mini WhatsApp, which is a real time chatting web application, along with its architecture diagram.

    I was feeling a bit nervous as it was my first interview, so I was not able to recall the architecture diagram properly. I drew a basic diagram and focused more on explaining how the application worked.

    He then asked several counter questions based on whatever I was explaining, and most of the discussion revolved around that one project.

    Then, he asked me to design a database schema to store flight information for the MakeMyTrip application and also asked one SQL query.

    At the end, he asked a DSA question. He gave a list of flight data containing the source and destination of each flight, along with a starting point and destination. The task was to print all the direct and indirect flight paths from the starting point to the destination.

    We can use BFS/DFS on a directed graph to solve this problem, but I was not able to think of that approach at the time.
    

• Difficulty Level: Medium - Hard
  

• Your Experience: I was not able to answer some of the counter questions, so I was not confident that I would qualify for Round 2. However, the final result also depends on the performance of the other candidates.

  ---

Round 3 : 💡Technical Interview 2

This was a short interview for me, lasting around 15 to 20 minutes.

The interviewer first asked for my introduction. Then he asked one DBMS question:

Explain normalization as if you were explaining it to a non technical person.

He then gave me a DSA question on merging two sorted linked lists and asked me to write the code on paper.

After that, he asked a few OOP concepts, and that was it.

Difficulty Level: Easy

4. 💡 Tips for Aspirants:

• Focus on DSA and CS fundamentals. Make sure you are comfortable with common DSA patterns, DBMS, OOP, OS, and SQL.

• Know your resume inside out. Be prepared to explain every project, technology, feature, and decision mentioned on your resume.

• Be confident and believe in yourself. Your interview may not go exactly as you expected, but don't assume the result before it is announced.

🎉 Final Outcome

SELECTED! ✅🎉