BNY Interview Questions, Process, and Tips

Q1. Prepaid and accrual.. Accounting questions
Add your answer

Round duration - 180 Minutes
Round difficulty - Hard

There will be 4 programming questions( 3 medium, 1 hard) 
Participants can attempt as many questions as they can within the test duration. The more the number of questions they attempt and get correct, the better their chances of getting shortlisted for interviews.
It was camera monitored. Don't change the tab while attempting the test.

Q1. 
Ways To Make Coin Change
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...read more
Ans. 
The task is to find the total number of ways to make change for a specified value using given denominations.
• Use dynamic programming to keep track of the number of ways to make change for each value up to the target value.

• Iterate through each denomination and update the number of ways to make change for each value based on the current denomination.

• The final answer will be the number of ways to make change for the target...read more
Answered by AI
View 1 more answer
Q2. 
Count Ways to Reach the N-th Stair Problem Statement
You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...read more
Ans. 
The problem involves finding the number of distinct ways to climb N stairs by taking 1 or 2 steps at a time.
• Use dynamic programming to solve the problem efficiently.

• The number of ways to reach the Nth stair is the sum of the number of ways to reach the (N-1)th stair and the (N-2)th stair.

• Handle base cases for N=0 and N=1 separately.

• Consider using modulo operation to avoid overflow when dealing with large numbers.
Answered by AI
Add your answer
Q3. 
Merge Two Sorted Linked Lists Problem Statement
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
...read more
Ans. 
Merge two sorted linked lists into a single sorted linked list without using additional space.
• Create a dummy node to start the merged list

• Compare the values of the two linked lists and add the smaller value to the merged list

• Move the pointer of the merged list and the respective linked list with the smaller value

• Continue this process until one of the linked lists is fully traversed

• Append the remaining elements of the o
Answered by AI
Add your answer
Q4. 
Pattern Matching Problem Statement
Given a pattern as a string and a set of words, determine if the pattern and the words list align in the same sequence.
Input:
T (number of test cases)
For each test ca...read more
Ans. 
Given a pattern and a list of words, determine if the words align with the pattern.
• Iterate through the pattern and words simultaneously to check for alignment.

• Use a hashmap to store the mapping between characters in the pattern and words.

• Return 'True' if the words match the pattern sequence, else return 'False'.
Answered by AI
Add your answer

Round duration - 75 Minutes
Round difficulty - Easy

This round was held online over Webex and CodePair (a screen-sharing code editor ).
The interviewer made it clear in the beginning that he wanted to know me as a person, what my interests are, and how well I am as a problem solver. The interview started with my introduction, my interests, coding languages I am comfortable with, my previous internship experiences, and my projects. He then asked some questions about OOPS and data structures. After judging my problem-solving skills and thought process from previous questions, he gave me 2 coding questions to solve. I was able to solve both of them.

Q1. 
Minimum Operations Problem Statement
You are given an array 'ARR' of size 'N' consisting of positive integers. Your task is to determine the minimum number of operations required to make all elements in t...read more
Ans. 
The minimum operations problem involves finding the minimum number of operations required to make all elements in an array equal.
• Iterate through the array to find the maximum and minimum values.

• Calculate the difference between the maximum and minimum values.

• The minimum number of operations needed is the difference between the maximum and minimum values.
Answered by AI
Add your answer
Q2. 
Cycle Detection in a Singly Linked List
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next points back to a previous node in the ...read more
Ans. 
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
• Use Floyd's Tortoise and Hare algorithm to detect a cycle in the linked list.

• Initialize two pointers, slow and fast, and move them at different speeds through the list.

• If there is a cycle, the fast pointer will eventually meet the slow pointer.

• If the fast pointer reaches the end of the list (null), there is no cycle
Answered by AI
Add your answer