BNY Software Developer Interview Questions, Process, and Tips

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. 
1. Brute force
2. Optimised it using Dynamic Programming
3. Edge cases
Answered Anonymously
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. 
1. It was a standard question so I told the approach
2. Wrote the code and checked the edge cases
Answered Anonymously
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. 
1. Brute Force
2. Optimised it using DP
3. Edge cases
Answered Anonymously
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. Minimum Number Of Taps To Water Garden
• The idea to approach the problem is to convert the Ranges array into a list of intervals and sort them.
• As we need to choose minimum taps so at first we will find the farthest tap which we will choose so that it will cover the 0th coordinate and after choosing this coordinate we will update the leftmost coordinate with the right of the current chosen tap. This will act as the left b...read more
Answered Anonymously
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. Outer And Inner Loop
We are going to have two loops outer-loop and inner-loop 
1. Maintain a count of the number of nodes visited in outer-loop.
2. For every node of the outer-loop, start the inner loop from head.
3. If the inner-loop visits the node next to the outer-loop node, then return true, else repeat the process for the next iteration of outer-loop.
4. If outer-loop reaches the end of list or null, then return false.
Space ...read more
Answered Anonymously
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. Brute Force Approach
1. Initialize a count variable with 0 to keep track of the number of palindromic substrings.
2. Let n be the length of the input string. Run a double nested loop. The outer loop will go from i = 0 to i = n - 1, and the inner loop will go from j = i to j = n - 1. i and j denote the start and end indices of a substring in the input string.
3. Check whether the substring from index i to j forms a palindrome.
   • If it...read more
Answered Anonymously
Add your answer