Upload Button Icon Add office photos

Bank of America

Compare button icon Compare button icon Compare

Filter interviews by

Bank of America Associate Software Engineer Interview Questions and Answers

Updated 6 Jun 2022

Bank of America Associate Software Engineer Interview Experiences

1 interview found

I applied via Company Website and was interviewed before Jun 2021. There was 1 interview round.

Round 1 - One-on-one 

(1 Question)

  • Q1. About work experience

Interview Preparation Tips

Interview preparation tips for other job seekers - Be strong on your Technical skill and that is more than enough aprt from other skills.

Interview questions from similar companies

I was interviewed before Mar 2016.

Interview Questionnaire 

2 Questions

  • Q1. Some technical questions were asked
  • Q2. They spring hibernate MVC flow and core java and Oracle connectivity questions

Interview Preparation Tips

Round: Technical + HR Interview
Experience: There was a Team manager and his junior for the interview

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: 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 ]

Interview Questionnaire 

4 Questions

  • Q1. Tell me about your internship, B.Tech project(BTP), CV
  • Q2. Implement LRU cache.
  • Ans. 

    Implement LRU cache

    • LRU stands for Least Recently Used

    • It is a cache eviction policy that removes the least recently used item

    • It can be implemented using a doubly linked list and a hash map

    • Newly accessed items are moved to the front of the list

    • When the cache is full, the item at the end of the list is removed

  • Answered by AI
  • Q3. What is virtual memory? Will we need virtual memory even if we have infinite amount of RAM?
  • Ans. 

    Virtual memory is a memory management technique that allows a computer to use more memory than it physically has.

    • Virtual memory uses a combination of RAM and hard disk space to store data.

    • It allows programs to use more memory than is physically available.

    • If a program tries to access memory that is not currently in RAM, it will be swapped in from the hard disk.

    • Even if we had infinite RAM, virtual memory would still be n...

  • Answered by AI
  • Q4. Given an array, Find out maximum length of subarray where max of subarray <= 2*min of subarray
  • Ans. 

    Find maximum length of subarray where max <= 2*min.

    • Iterate through array and keep track of max and min values.

    • Update max length when condition is met.

    • Time complexity: O(n)

  • Answered by AI

Interview Preparation Tips

Round: Resume Shortlist
Experience: No CPI cut off and It was open for all departments.

Round: Test
Experience: In muliple choice question Mostly questions were base on maths, probability, c programs, algorithms, Systems. If you are prepared then Questions were not that much tough. Keep strong concepts of Operating systems. For subjective part, Some problems were from maths proofs, some were from probability, some were from algo. We had to write algorithms. etc
Duration: 180 minutes

Round: Problem Statement
Experience: Questions were doable.

Round: Interview
Experience: Everyone was cool, They made me feel comfortable and then started asking questions.
Tips: If you have good rank in online coding competition, do mention it in CV.Most of the students think that GS asks only probability-puzzles. They did not asked me any question on probability or puzzle. Everything they asked was based on Algorithms problems and Operating system. I think it depends on team for which they are hiring. Most important point is don’t lose hope because you have low CPI or you are not good at something. Keep Operating systems fundamental concepts strong.

General Tips: We should balance in Placement and Compititive online coding. Keep in mind Placements and Compititive online coding are some what different things. Keep on improving our mistakes on daily basis. I would strongly suggest you to do introspection daily it will help you to find out your weaknesses and strong points, where we are going wrong etc. There are two thing on which we shoud focus.1. Preparation (I have told everything requered for preparation).2. Get output of all hard work. How to keep our mind on 100% output while the actual exam(placement).For this, I used to go for physical exercise daily in the morning and medidate for 20-30 minutes. Along with exercise i used to do Sudarshan Kriya(Art of Living). Meditation has lot of power :).
Skill Tips: Keep your OS fundamentals strong. To improve codgin skills practice as many problems as you can. Regularly participate in online coding competitions it really helps to solve or approach any new problem. Many time instead of correct answer the approach to solve the problems is very important. How you think, How you approach the problem is checked in interview.
Skills: Coding Skills, Operating Systems , Problem solving skills
College Name: IIT Guwahati
Motivation: The name GS itself enogh for motivation.

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: The written test was quite similar to the typical CAT pattern. It contained sections on Reading Comprehension, Data Interpretation and Mathematics.

Round: Technical + HR Interview
Experience: There were 2 interviewers in the first interview, one was a technical guy and the other was from HR. They asked me a few very simple puzzles, a few basic programming questions (swapping the value of two variables etc.), questions related to the development cycle of software products. The HR guy asked stuff like what do you want to achieve in life? Strengths, weaknesses etc.

Round: Case Study Interview
Experience: The third interview was the most important one (and I guess that was the deciding interview). The interviewer started with questions like why finance? Which companies are you sitting for? Then he gave me a case study:

Interview Questionnaire 

2 Questions

  • Q1. Oops, os, dbms, project
  • Q2. Why hsbc, why should I hire you.
  • Ans. 

    I have a strong background in software engineering and a passion for innovation, making me a valuable asset to HSBC.

    • I have a proven track record of successfully delivering high-quality software solutions in previous roles.

    • I am highly skilled in various programming languages and technologies, including Java, Python, and SQL.

    • I have experience working in agile development environments, allowing me to adapt quickly to chan...

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: 4 sections, 15 questions each. Sections on apti, english, programming, technical.
Tips: Time management, complete english and technical first
Duration: 1 hour
Total Questions: 60

Round: Group Discussion
Experience: We were asked which super hero would you like to be. Shared the information. Always present the positives and negatives and emphasize that despite of being negatives
Tips: Think everything through before speaking
Duration: 40 minutes

Round: Technical Interview
Experience: Prepare well, anything can be asked on the things written on your resume

Round: HR Interview
Experience: Sell yourself. Tell them why you would be the best candidate.
Tips: Tell your advantages of being a fresher that you would be comfortable in any technology

College Name: Acropolis institute of technology and research

I was interviewed before Mar 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical round with questions on DSA and OS.

  • Q1. 

    LRU Cache Design Problem Statement

    Design and implement a data structure for a Least Recently Used (LRU) cache that supports the following operations:

    • get(key) - Retrieve the value associated with the...
  • Ans. 

    Design and implement a Least Recently Used (LRU) cache data structure that supports get and put operations with a specified capacity.

    • Implement a doubly linked list to keep track of the order of keys based on their usage.

    • Use a hashmap to store key-value pairs for quick access and updates.

    • When a key is accessed or updated, move it to the front of the linked list to mark it as the most recently used.

    • When the cache reaches...

  • Answered by AI
  • Q2. 

    Maximum of All Subarrays of Size K

    Given an array of non-negative integers and an integer K representing the length of a subarray, your task is to determine the maximum elements for each subarray of size ...

  • Ans. 

    Find the maximum elements for each subarray of size K in a given array.

    • Iterate through the array and maintain a deque to store the indices of elements in decreasing order.

    • Pop elements from the deque that are out of the current window.

    • Keep track of the maximum element in each subarray of size K.

    • Return the maximum elements for each subarray.

  • Answered by AI
  • Q3. What is virtual memory?
  • Ans. 

    Virtual memory is a memory management technique that allows a computer to compensate for physical memory shortages by temporarily transferring data from RAM to disk storage.

    • Virtual memory allows programs to use more memory than is physically available on the system.

    • It helps in multitasking by allowing multiple programs to run simultaneously without running out of memory.

    • Virtual memory uses a combination of RAM and disk...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAGoldman Sachs interview preparation:Topics to prepare for the interview - Coding Skills, Operating Systems , Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 5 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 Questionnaire 

11 Questions

  • Q1. What is the difference between multi tasking, multi processing and multi programming operating systems with examples ?
  • Ans. 

    Multi tasking, multi processing, and multi programming are different approaches to managing tasks in an operating system.

    • Multi tasking allows multiple tasks to run concurrently on a single processor.

    • Multi processing involves multiple processors running tasks simultaneously.

    • Multi programming allows multiple programs to be loaded into memory and executed concurrently.

    • Examples of multi tasking operating systems include Wi...

  • Answered by AI
  • Q2. Tell me about memory allocation (stack vs. heap)?
  • Ans. 

    Memory allocation refers to the process of assigning memory to programs during runtime.

    • Stack allocation is done automatically and is limited in size.

    • Heap allocation is done manually and is larger in size.

    • Stack memory is used for local variables and function calls.

    • Heap memory is used for dynamic memory allocation.

    • Memory leaks can occur if heap memory is not properly managed.

  • Answered by AI
  • Q3. You have two threads one printing even numbers in order and other odd numbers. Design an algorithm so that it prints numbers in natural order?
  • Ans. 

    Use a shared variable and synchronization mechanisms to ensure natural order printing of numbers.

    • Create two threads, one for printing even numbers and the other for printing odd numbers.

    • Use a shared variable to keep track of the current number to be printed.

    • Implement synchronization mechanisms like locks or semaphores to ensure only one thread can access the shared variable at a time.

    • Each thread should check if it is i...

  • Answered by AI
  • Q4. Print a matrix in spiral order?
  • Ans. 

    Printing a matrix in spiral order

    • Start from the first element and print it

    • Move in a spiral order towards the center of the matrix

    • Repeat until all elements are printed

  • Answered by AI
  • Q5. Thread class and Runnable Interface?
  • Ans. 

    Thread class and Runnable Interface are used for multithreading in Java.

    • Thread class is a predefined class in Java that provides methods to create and control threads.

    • Runnable interface is used to define a task that can be executed by a thread.

    • Thread class implements Runnable interface.

    • Thread class provides more control over threads than Runnable interface.

    • Example: Thread t = new Thread(new MyRunnable()); t.start();

    • Exa...

  • Answered by AI
  • Q6. What’s the difference between a Linked List and an ArrayList and give me an example of when to use which?
  • Ans. 

    Linked List is a dynamic data structure while ArrayList is a static data structure.

    • Linked List is best for frequent insertion and deletion operations.

    • ArrayList is best for frequent access operations.

    • Linked List uses more memory than ArrayList.

    • ArrayList is faster than Linked List for accessing elements.

    • Use Linked List when you need to frequently add or remove elements from the list.

    • Use ArrayList when you need to frequen

  • Answered by AI
  • Q7. Questions of OS concepts?
  • Q8. A role play scenario was given. With a clear instruction on I don’t need to know the basis and the hypothetical assumption was presented. I was told that I was expected to respond to the given scenario, in...
  • Q9. Why are you interested in a career in investment banking?
  • Ans. 

    I am not interested in a career in investment banking.

    • I am more interested in a career in software development

    • I enjoy problem-solving and creating innovative solutions through coding

    • Investment banking does not align with my passion and skill set

  • Answered by AI
  • Q10. Why have you chosen to apply to J.P. Morgan?
  • Ans. 

    I have chosen to apply to J.P. Morgan because of their reputation, global presence, and opportunities for growth.

    • J.P. Morgan has a strong reputation in the financial industry.

    • They have a global presence with offices in multiple countries.

    • The company offers various opportunities for career growth and development.

    • J.P. Morgan is known for its innovative technology solutions in the financial sector.

    • I am impressed by their ...

  • Answered by AI
  • Q11. Have you ever made a mistake? Tell us about it?
  • Ans. 

    Yes, I have made a mistake in my previous project.

    • I underestimated the complexity of a task and ended up missing the deadline.

    • I failed to properly test a feature, resulting in a bug that affected user experience.

    • I accidentally deleted an important file without having a backup.

    • I misunderstood a requirement and implemented a feature incorrectly.

  • Answered by AI

Interview Preparation Tips

Round: Test
Total Questions: 1

General Tips: Interview Process: Aptitude test&#44; followed by 3 rounds of interview. Interview process was very good. Just be positive to clear the interview.
Check this link before appearing for interview with JP Morgan. It will help  -----
Skills: Algorithm, Data structure, Stack
College Name: Na

Skills evaluated in this interview

Bank of America Interview FAQs

How many rounds are there in Bank of America Associate Software Engineer interview?
Bank of America interview process usually has 1 rounds. The most common rounds in the Bank of America interview process are One-on-one Round.

Tell us how to improve this page.

Bank of America Associate Software Engineer Salary
based on 5 salaries
₹6 L/yr - ₹19 L/yr
105% more than the average Associate Software Engineer Salary in India
View more details
Team Lead
2.3k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Assistant Manager
1.9k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Team Developer
1.9k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
1.1k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Manager
1.1k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Bank of America with

JPMorgan Chase & Co.

4.0
Compare

BA Continuum

4.1
Compare

Wells Fargo

3.8
Compare

Goldman Sachs

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