Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by BNY Team. If you also belong to the team, you can get access from here

BNY Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

BNY Application Developer Interview Questions and Answers

Updated 24 Feb 2025

BNY Application Developer Interview Experiences

5 interviews found

Interview experience
2
Poor
Difficulty level
-
Process Duration
-
Result
Selected Selected
Round 1 - Aptitude Test 

General aptitude questions

Round 2 - Group Discussion 

General group discussion topics

Round 3 - Technical 

(1 Question)

  • Q1. General oops, db concepts
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

Generat aptitude questions

Round 2 - Technical 

(1 Question)

  • Q1. More of programming
Round 3 - HR 

(1 Question)

  • Q1. General questions with basic tech questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Ne strong in technical

Application Developer Interview Questions Asked at Other Companies

asked in Oracle
Q1. Minimum Cost to Connect All Points Problem Statement Given an arr ... read more
asked in Fujitsu
Q2. Reverse Linked List Problem Statement Given a singly linked list ... read more
asked in Oracle
Q3. Puzzle: – Two persons X and Y are sitting side by side with a coi ... read more
asked in Oracle
Q4. Count Subsequences Problem Statement Given an integer array ARR o ... read more
asked in Oracle
Q5. Remove the Kth Node from the End of a Linked List You are given a ... read more
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Company Website and was interviewed before Oct 2022. There were 2 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - One-on-one 

(2 Questions)

  • Q1. Design pattern questions
  • Q2. Elaborated answers are expected

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident and be seriously prepared

I applied via Campus Placement and was interviewed before Feb 2021. There were 2 interview rounds.

Round 1 - Aptitude Test 

Basic aptitude test for screening

Round 2 - One-on-one 

(2 Questions)

  • Q1. Java oops concept were mainly asked
  • Q2. Data structures algorithm
  • Ans. 

    Data structures algorithm is a way of organizing and storing data in a computer so that it can be accessed and used efficiently.

    • Data structures are used to store and organize data in a way that allows for efficient access and manipulation.

    • Common data structures include arrays, linked lists, stacks, queues, trees, and graphs.

    • Algorithms are used to manipulate data structures in order to perform specific tasks, such as se...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare aptitude well.
For interview it was basic questions from java

Skills evaluated in this interview

BNY interview questions for designations

 Application Support Analyst

 (1)

 Developer

 (2)

 Software Developer

 (17)

 Senior Developer

 (2)

 Software Developer Intern

 (2)

 Full Stack Developer

 (1)

 Senior Database Developer

 (1)

 Senior Python Developer

 (1)

Application Developer Interview Questions & Answers

user image suganya ganesan

posted on 16 May 2017

I appeared for an interview before May 2016.

Interview Preparation Tips

Round: Test
Experience: Test of app and logical skills
Tips: Clear vision about English and smart tricks to identify solution
Total Questions: 50

Round: Group Discussion
Experience: Test of app and logical skills
Tips: Clear vision about English and smart tricks to identify solution
Duration: 50 minutes

Round: Group Discussion
Experience: We have to give up our points based on the topic
Tips: Required English fluency

College Name: KGiSL Institute of Technology

Interview questions from similar companies

I appeared for an interview in May 2017.

Interview Questionnaire 

6 Questions

  • Q1. Can string class be extended
  • Ans. 

    Yes, the string class can be extended in most programming languages.

    • Inheritance can be used to extend the functionality of the string class.

    • By creating a new class that inherits from the string class, additional methods and properties can be added.

    • Extending the string class allows for customization and adding specific functionality to strings.

    • Example: In Python, the string class can be extended by creating a new class

  • Answered by AI
  • Q2. What are the implecit object in JSP
  • Ans. 

    Implicit objects in JSP are predefined objects that are available for use without any declaration or initialization.

    • Implicit objects in JSP include request, response, session, application, out, config, pageContext, page, exception, and others.

    • These objects provide access to various aspects of the JSP environment and can be used to perform common tasks.

    • For example, the request object allows access to HTTP request parame...

  • Answered by AI
  • Q3. How does hash map works
  • Ans. 

    A hash map is a data structure that uses a hash function to map keys to values.

    • Hash map stores key-value pairs

    • It uses a hash function to compute an index for each key

    • Collisions can occur when two keys hash to the same index

    • Hash maps provide fast access to values based on their keys

  • Answered by AI
  • Q4. Difference between string buffer and string builder
  • Ans. 

    StringBuffer and StringBuilder are both used to manipulate strings, but StringBuffer is thread-safe while StringBuilder is not.

    • StringBuffer is synchronized, making it safe for use in multi-threaded environments.

    • StringBuilder is not synchronized, making it faster but not thread-safe.

    • StringBuffer is preferred when multiple threads are involved, while StringBuilder is preferred for single-threaded scenarios.

    • Both classes p...

  • Answered by AI
  • Q5. What is MVC
  • Ans. 

    MVC is a software architectural pattern that separates an application into three main components: Model, View, and Controller.

    • Model represents the data and business logic of the application.

    • View is responsible for displaying the user interface.

    • Controller handles user input, updates the model, and interacts with the view.

    • MVC promotes separation of concerns and modularity in software development.

    • Example: In a web applica...

  • Answered by AI
  • Q6. What are the annotation used in RESTFULL web services
  • Ans. 

    Annotations used in RESTful web services

    • 1. @Path - Specifies the URI path for the resource

    • 2. @GET - Specifies that the method handles HTTP GET requests

    • 3. @POST - Specifies that the method handles HTTP POST requests

    • 4. @PUT - Specifies that the method handles HTTP PUT requests

    • 5. @DELETE - Specifies that the method handles HTTP DELETE requests

    • 6. @PathParam - Binds the value of a URI template parameter to a method paramete...

  • Answered by AI

Interview Preparation Tips

Skills: Java Application Development

Skills evaluated in this interview

Interview Preparation Tips

Round: Technical Interview
Experience: Technical on paper test questions:(dis was only for 12 among d 26 shortlisted ppl after apti...others directly had interviews)
5 wer selected in this test who wer nw sent for interviews
TECHNICAL INTERVIEW: (pls list the questions asked in all the rounds)
26 shortlisted after apti (14 directly for interviews & 12 had one more technical on paper test...mentioned above)
der wer min 2 technical rounds for each of them...max were 5

- You are given course dependencies
A->B,C
B->D
C->A
D->nothing
The above dependencies mean...if you want to take course A...you should take courses B and C first....To take B,Course D must be taken first....D is an independent course and can be taken without any prior requirements.
Now you are told these dependencies.Come up with an appropriate data structure to represent these dependencies.Then write a code that finds out all the courses that the student can take up...in this case the student can first take course D because its independent.Now that course D has been taken he can next take up B as it depends on B alone...But the courses A and C can never be taken because they depend on each other...So here all the courses that can be taken are B and D.
After i wrote the code....he asked for all possible test cases
-Given an array of length N....It can be filled with nos. only from 1 to N....find which nos are repeated in the array
-Given pointers to two nodes in a binary tree....find their least common ancestor...each node has pointer to only the parent node...not the left and right child..
-In a binary tree(Not necessarily a BST)...suppose the weight of any node is defined as the product of the key value of the node and the level of the node(Root at level 1)...find the node with maximum weight in the binary tree
-A sorted array of size n is right circularly rotated k times and this rotated array is given to you as input...Find out the value of k in log n time .
-There are some processes running at time T....and there are processes running at time T+30.
You have to find out
1)Which processes died at time T+30,which were alive at time T
2)Which are the new processes at time T+30,which were not there at time T
3)Which are the processes that were there at time T and are still running at time T+30
What data structure will you use to represent the process lists and write code to find out the answers to the 3 questions above
-Given a binary search tree...and a target sum...starting at the root...which all paths add up to the target sum?...if there are multiple paths....return the path with least no. of nodes.


College Name: Veermata Jijabai Technological Institute, Mumbai [ VJTI ]

I appeared for an interview before Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

There were 33 questions in total. The objective questions were simple.

  • Q1. 

    Sort Big List Dates Problem Statement

    Mary is an enthusiastic party-goer who struggles with remembering event dates. Help Mary by sorting a given list of event dates in an ascending order.

    Example:

    Inpu...
  • Ans. 

    Sort a list of event dates in ascending order based on year, month, and day.

    • Sort the list of dates based on year, then month, and finally day.

    • Use a sorting algorithm to rearrange the dates in ascending order.

    • Ensure the constraints are met for each date in the list.

  • Answered by AI
  • Q2. 

    Pair Sum Problem Statement

    You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.

    Note:
    ...
  • Ans. 

    Given an array and a target sum, find all pairs of elements that add up to the target sum.

    • Iterate through the array and for each element, check if the complement (target sum - current element) exists in a hash set.

    • If the complement exists, add the pair to the result list.

    • Sort the pairs based on the first element and then the second element.

    • Handle edge cases like duplicate elements and pairs with the same values.

    • Example...

  • Answered by AI
  • Q3. 

    Maximum Sum Problem Statement

    Given an integer N, your task is to recursively break it into three integer parts: N / 2, N / 3, and N / 4. You need to compute the maximum sum possible by dividing the numbe...

  • Ans. 

    Given an integer N, recursively break it into three parts and find the maximum sum possible.

    • Recursively divide N into N/2, N/3, and N/4 to find the maximum sum

    • Compare the sum obtained by dividing N with the sum of N itself

    • Return the maximum sum for each test case

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMorgan Stanley interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview before Mar 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical Interview round with questions based on DSA.

  • Q1. 

    Duplicate Integer in Array

    Given an array ARR of size N, containing each number between 1 and N-1 at least once, identify the single integer that appears twice.

    Input:

    The first line contains an integer...
  • Ans. 

    Identify the duplicate integer in an array containing numbers between 1 and N-1.

    • Iterate through the array and keep track of the frequency of each element using a hashmap.

    • Return the element with a frequency greater than 1 as the duplicate integer.

    • Ensure the constraints are met and a duplicate number is guaranteed to be present.

  • Answered by AI
  • Q2. 

    Sum Root to Leaf Numbers

    You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...

  • Ans. 

    Calculate the total sum of all root to leaf paths in a binary tree formed by concatenating node values.

    • Traverse the binary tree from root to leaf nodes, keeping track of the current path sum

    • Add the current node value to the path sum and multiply by 10 for each level

    • When reaching a leaf node, add the final path sum to the total sum

    • Return the total sum modulo (10^9 + 7)

  • Answered by AI
  • Q3. 

    Topological Sort Problem Statement

    You are given a directed acyclic graph (DAG). Your task is to perform topological sorting of the graph and return any valid ordering.

    Explanation:

    A directed acyclic g...

  • Ans. 

    Implement a function to perform topological sorting on a directed acyclic graph (DAG) and return any valid ordering.

    • Create a graph data structure to represent the DAG

    • Use depth-first search (DFS) to perform topological sorting

    • Maintain a visited array to keep track of visited nodes

    • Return the ordering of nodes after DFS traversal

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical interview round with questions based on DSA.

  • Q1. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...

  • Ans. 

    Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the LCA.

    • Handle cases where one node is an ancestor of the other.

    • Consider edge cases like when X or Y is the root node.

    • Implement a recursive or iterative solution to find the LCA efficiently.

  • Answered by AI
  • Q2. 

    Rotated Array Minimum Finder

    You are provided with a sorted array that has undergone 'K' rotations (the exact value of 'K' is unknown). A rotation involves shifting each element of the array to the right,...

  • Ans. 

    Implement a function to find the minimum number in a rotated sorted array efficiently.

    • Use binary search to find the minimum element in the rotated array.

    • Compare the mid element with the start and end elements to determine which half of the array to search next.

    • Continue the binary search until the minimum element is found.

  • Answered by AI
  • Q3. 

    Maximum Binary Tree Construction Problem

    Given an array TREE of 'N' unique integers, construct a maximum binary tree using the following rules:

    1. The root of this tree is the maximum number in TREE.
    2. T...
  • Ans. 

    Construct a maximum binary tree from an array of unique integers following specific rules.

    • Find the maximum number in the array to set as the root of the tree.

    • Recursively construct the left subtree with elements before the maximum number.

    • Recursively construct the right subtree with elements after the maximum number.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMorgan Stanley interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: The test was for two and half hours where 1 hour was for general aptitude, 1 hr was for coding aptitude(either on java or C or C++as you choose) and 1/2 an hour for two coding questions.

Round: Technical Interview
Experience: In technical round they asked puzzles, aptitude questions and basic C coding. I was asked to write the code for two questions(one was on sort and search) and was asked the logic of two questions.They asked basics of linked lists, stacks, queues. Infact they were not very interested in the syntax and were pressing on the logic

General Tips: Being a non software branch students is not at all a problem. The company took 4 interns where 3 were from core branches. The fact that we had to work in JAVA and most of us didn't know JAVA, the company only looks for aptitude and ability to learn. So if you don't know anything, tell frankly that you don't know that part, rather than guessing. Be thorough with what you know and confidentially answer all the questions.
Also do not be tensed and take things lightly, if the interviewer is joking. Be candid.
Skill Tips: Learn basics of coding from books . Aptitude can be done from sites likes geeks for geeks, etc. The level of aptitude is not very high and infact the coding aptitude is also theoretical and does not involve in depth knowledge.
Skills:
College Name: NIT Surathkal

BNY Interview FAQs

How many rounds are there in BNY Application Developer interview?
BNY interview process usually has 2-3 rounds. The most common rounds in the BNY interview process are Aptitude Test, One-on-one Round and Technical.
How to prepare for BNY Application Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at BNY. The most common topics and skills that interviewers at BNY expect are Application Development, Financial Services, Administration, Technology Solutions and Change Management.
What are the top questions asked in BNY Application Developer interview?

Some of the top questions asked at the BNY Application Developer interview -

  1. Data structures algori...read more
  2. General questions with basic tech questi...read more
  3. Java oops concept were mainly as...read more

Tell us how to improve this page.

BNY Application Developer Interview Process

based on 3 interviews

1 Interview rounds

  • Aptitude Test Round
View more

Interview Questions from Similar Companies

Wells Fargo Interview Questions
3.8
 • 570 Interviews
Citicorp Interview Questions
3.7
 • 568 Interviews
Bajaj Finserv Interview Questions
4.0
 • 523 Interviews
HSBC Group Interview Questions
3.9
 • 487 Interviews
American Express Interview Questions
4.2
 • 364 Interviews
UBS Interview Questions
3.9
 • 336 Interviews
Morgan Stanley Interview Questions
3.7
 • 291 Interviews
View all
BNY Application Developer Salary
based on 239 salaries
₹3 L/yr - ₹9.5 L/yr
60% less than the average Application Developer Salary in India
View more details

BNY Application Developer Reviews and Ratings

based on 74 reviews

4.0/5

Rating in categories

3.9

Skill development

4.2

Work-life balance

3.7

Salary

3.6

Job security

4.0

Company culture

3.6

Promotions

3.7

Work satisfaction

Explore 74 Reviews and Ratings
Analyst
1.9k salaries
unlock blur

₹3 L/yr - ₹10 L/yr

Senior Analyst
1.8k salaries
unlock blur

₹3.8 L/yr - ₹15 L/yr

Senior Associate
1.2k salaries
unlock blur

₹11.7 L/yr - ₹25.7 L/yr

Intermediate Representative
1.1k salaries
unlock blur

₹2.9 L/yr - ₹7.5 L/yr

Vice President
1k salaries
unlock blur

₹15.9 L/yr - ₹53 L/yr

Explore more salaries
Compare BNY with

Bajaj Finserv

4.0
Compare

Wells Fargo

3.8
Compare

JPMorgan Chase & Co.

3.9
Compare

HSBC Group

3.9
Compare
Did you find this page helpful?
Yes No
write
Share an Interview