BNY Software Developer Interview Questions, Process, and Tips

2 leetcode medium + 1 easy 3 hours

Q1. Grilled on CS concepts. how would you do compression on a text file? (huffman coding)
Add your answer

Mostly medium aptitude questions. you also need to write pseudocode for your solution

Round duration - 60 minutes
Round difficulty - Hard

The interview was scheduled for 10 am in the morning.
It started with a coding question related to Dynamic Programming Paradigm.
Then we further discussed the various data structures & algorithms and graph theory.
It was a mix of coding questions and theoretical concepts.
The interviewer was very nice and wanted to listen to various approaches that I gave.

Q1. 
Minimum Number of Taps to Water the Garden
Given a garden that extends along a one-dimensional x-axis from point 0 to point N, your task is to determine the minimum number of taps needed to water the enti...read more
Ans. 
Find the minimum number of taps needed to water the entire garden with given tap ranges.
• Iterate over each tap and find the maximum range it can cover.

• Sort the taps based on their starting point and ending point.

• Use a greedy approach to select the taps that cover the maximum range possible.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The interview included 2 coding questions and questions based on CSE core subjects.
The interview began with a question related to Linked List. After doing that I was asked many questions on CSE core concepts.
Then at last one more coding question was asked.

Q1. 
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 Cycle Detection Algorithm to determine if there is a cycle in the linked list.

• Maintain two pointers, one moving at twice the speed of the other, if they meet at some point, there is a cycle.

• If one of the pointers reaches the end of the list (null), then there is no cycle.
Answered by AI
Add your answer
Q2. 
Palindromic Substrings Problem Statement
You are given a string 'STR'. Your task is to determine the total number of palindromic substrings present in 'STR'.
Example:
Input:
"abbc"
Output:
5
Explana...read more
Ans. 
Count the total number of palindromic substrings in a given string.
• Iterate through each character in the string and expand around it to find palindromic substrings.

• Use dynamic programming to store the results of subproblems to avoid redundant calculations.

• Consider both odd and even length palindromes while counting.

• Example: For input 'abbc', the palindromic substrings are ['a', 'b', 'b', 'c', 'bb'], totaling 5.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

It was a technical+HR round with a senior member.
It was a discussion based on data structures. Map data-structure was discussed a lot then a few questions related to my projects and some HR questions.

Round duration - 60 Minutes
Round difficulty - Hard

HackerRank code pair feature was used.
A coding question related to Dynamic Programming was asked. Followed by questions on data structures, graph theory, etc.
The interviewer was very nice and seemed to be interested in listening to my approaches.

Q1. 
Minimum Number of Taps to Water the Garden
Given a garden that extends along a one-dimensional x-axis from point 0 to point N, your task is to determine the minimum number of taps needed to water the enti...read more
Ans. 
Find the minimum number of taps needed to water the entire garden using given tap ranges.
• Iterate over each tap and find the maximum range it can cover.

• Sort the taps based on their starting points and their maximum coverage ranges.

• Use a greedy approach to select the next tap that covers the maximum uncovered area.

• Keep track of the covered area and the number of taps used.

• Return the minimum number of taps required to wat
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

coding questions were asked. Difficulty level Medium.
SQL query, DBMS concepts, OOP concepts, CN concepts.
One question related to BST.

Q1. 
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 O(N) time complexity and O(1) space complexity.

• 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...read more
Answered by AI
Add your answer
Q2. 
Palindromic Substrings Problem Statement
You are given a string 'STR'. Your task is to determine the total number of palindromic substrings present in 'STR'.
Example:
Input:
"abbc"
Output:
5
Explana...read more
Ans. 
Count the total number of palindromic substrings in a given string.
• Iterate through each character in the string and expand around it to find palindromic substrings.

• Use dynamic programming to optimize the solution by storing previously calculated palindromic substrings.

• Consider both odd and even length palindromes while counting.

• Example: For input 'abbc', the palindromic substrings are ['a', 'b', 'b', 'c', 'bb'], totali
Answered by AI
Add your answer