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

Clear (1)

BNY Application Developer Interview Questions and Answers

Updated 2 Jul 2024

BNY Application Developer Interview Experiences

4 interviews found

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
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 Resume 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

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

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

Application Developer Interview Questions & Answers

user image suganya ganesan

posted on 16 May 2017

I was interviewed 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

BNY interview questions for designations

 Application Support Analyst

 (1)

 Developer

 (2)

 Software Developer

 (17)

 Senior Developer

 (2)

 Software Developer Intern

 (2)

 Senior Database Developer

 (1)

 Full Stack Developer

 (1)

 Senior Python Developer

 (1)

Interview questions from similar companies

I was interviewed 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 was interviewed 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

Interview Preparation Tips

Round: Test
Experience: Online Test (General aptitude, C aptitude ,Programming problems).

General Tips: Study basics of C and DSA well. Utilize the last summer vacations for studying for placements. Be confident and Honest.
Yes it is challenging and exhausting. It tests your patience. But final reward is also great so we must keep going toward it.
Skill Tips: Online coding sites such as Codechef, etc. Narasimha Karumanchi for data structures and algorithm will help in preparation.
Skills:
College Name: NIT Surathkal

I applied via Campus Placement

Interview Questionnaire 

2 Questions

  • Q1. How can a chemical Engineer help citi?
  • Ans. 

    A chemical engineer can help Citi by providing expertise in process optimization, risk management, and sustainability.

    • Optimizing Citi's manufacturing processes to reduce costs and increase efficiency

    • Developing risk management strategies to ensure compliance with environmental regulations

    • Implementing sustainable practices to reduce Citi's environmental impact

    • Providing technical expertise in chemical reactions and materi...

  • Answered by AI
  • Q2. He asked me about my JEE Rank, preparations

Interview Preparation Tips

Round: HR Interview
Experience: I had done many web and android apps. They asked me about my institute experience, things I have done here. It was an easy walk for me.

Skills: SQL, Java Programming
Duration: 2
College Name: IIT Madras

Interview Questionnaire 

4 Questions

  • Q1. One coding question.
  • Q2. Questions on Data Structures
  • Q3. Logical Question: You are a captive. If you say the right answer, the assasin will hang you, if you say the wrong answer, he will shoot you. How do you escape?
  • Q4. Other aptitude questions

Interview Preparation Tips

Round: Other Interview
Experience: One year since I took the interview, so no idea exactly what questions they asked. But I was asked to write the code on paper in front of him and was asked to debug it. Some puzzles and aptitude questions along with other basic coding questions. It was great that the guy was interactive and started asking about my projects and college life.
Btw the answer to the logical question is: I should say " you will shoot me". Paradoxical.
Tips: Feel free to ask anything that you would like to know from them. Also frankly say that you don't know a certain topic if you have no clue what it is about. They don't like people wasting their time.

Round: HR Interview
Experience: This was not exactly a technical interview. He asked me to write a code to find the day of week when a certain date in any year of the calendar is given. I answered it and then he starting asking general questions as to why do u want to join the company, etc.
I gave answers to most of them convincingly. But I kept him engaged by explaining my life at college, the extra curriculars I did at college. Also I asked him about his experience as a software engineer. I asked him to reflect upon his career and how I should approach about my career.
Tips: The best part about HR interviews is they expect you to ask them lots and lots of questions. The more they are engaged, the more are your chances of impressing and getting selected. And more importantly, ask the interviewer about his experience with the present firm. This also works with my manager when ever he has a one on one with me :P
Cheers and all the best.

Skills: Soft Skills, General Aptitude, LOGICAL THINKING ABILITIES, Coding Skills And Knowledge On Data Structures
College Name: IIT Hyderabad
Contribute & help others!
anonymous
You can choose to be anonymous

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 Resume Shortlist.
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

Recently Viewed

INTERVIEWS

UBS

No Interviews

SALARIES

ANZ Banking Group

REVIEWS

Electronica Finance

No Reviews

INTERVIEWS

KGISL

No Interviews

SALARIES

Dolat Capital Market

No Salaries

DESIGNATION

LIST OF COMPANIES

Dolat Capital Market

Overview

COMPANY BENEFITS

Dolat Capital Market

No Benefits

JOBS

HCLTech

No Jobs

REVIEWS

Dolat Capital Market

No Reviews

Tell us how to improve this page.

BNY Application Developer Interview Process

based on 2 interviews

Interview experience

4.5
  
Good
View more
BNY Application Developer Salary
based on 239 salaries
₹3 L/yr - ₹9.5 L/yr
59% 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

₹0 L/yr - ₹0 L/yr

Senior Analyst
1.7k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Associate
1.2k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Intermediate Representative
1.1k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Vice President
1.1k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare BNY with

State Street Corporation

3.7
Compare

Northern Trust

3.7
Compare

HSBC Group

3.9
Compare

JPMorgan Chase & Co.

4.0
Compare
Did you find this page helpful?
Yes No
write
Share an Interview
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent