Upload Button Icon Add office photos

Bank of America

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Bank of America Senior .NET Developer Interview Questions and Answers

Updated 30 Jul 2024

Bank of America Senior .NET Developer Interview Experiences

1 interview found

Interview experience
2
Poor
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I applied via LinkedIn and was interviewed in Jun 2024. There was 1 interview round.

Round 1 - Technical 

(5 Questions)

  • Q1. Difference between Entity Framework and ADO.Net
  • Ans. 

    Entity Framework is an ORM that simplifies data access in .NET applications, while ADO.Net is a low-level data access technology.

    • Entity Framework is an Object-Relational Mapping (ORM) framework that allows developers to work with databases using .NET objects.

    • ADO.Net is a set of classes that allows developers to interact with data sources like databases directly using SQL commands.

    • Entity Framework provides higher level ...

  • Answered by AI
  • Q2. Explain Angular hooks or lifecycle
  • Ans. 

    Angular hooks or lifecycle are methods that allow developers to tap into key moments in a component's lifecycle.

    • Angular components have several lifecycle hooks such as ngOnInit, ngOnChanges, ngDoCheck, ngOnDestroy, etc.

    • These hooks allow developers to perform actions at specific points in a component's lifecycle, such as initialization, change detection, and destruction.

    • For example, ngOnInit is used to initialize data i...

  • Answered by AI
  • Q3. Difference between function and stored procedure in SQL
  • Ans. 

    Functions return a single value while stored procedures can perform multiple operations and return multiple values.

    • Functions return a single value while stored procedures can return multiple values.

    • Functions are used for computations and return values, while stored procedures are used for executing a sequence of statements.

    • Functions can be called from within SQL statements, while stored procedures are called using the ...

  • Answered by AI
  • Q4. Your professional experience
  • Ans. 

    I have over 8 years of experience as a Senior .NET Developer, working on various projects and technologies.

    • Developed web applications using ASP.NET MVC and Web API

    • Worked with SQL Server for database design and development

    • Implemented front-end using JavaScript frameworks like Angular and React

    • Experience with cloud platforms like Azure for deployment and hosting

  • Answered by AI
  • Q5. Projects architecture you have worked on?
  • Ans. 

    I have worked on projects with layered architecture, microservices, and monolithic architecture.

    • Layered architecture: Separation of concerns into presentation, business logic, and data access layers.

    • Microservices: Independent, loosely coupled services communicating over APIs.

    • Monolithic architecture: Single-tiered application with all components tightly integrated.

    • Example: Developed a web application using ASP.NET MVC w...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - The interview was schedule for 30 min. The interviewer arrived 20 min late, conducted interview for 10 min, and said they would reschedule, but I haven't heard back from HR.

Skills evaluated in this interview

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 

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

Interview Questionnaire 

11 Questions

  • Q1. Print all nodes at a distance k from a given node in binary tree?
  • Q2. RandN function : which generates random number in [1,2,3..N] with equal probability. Given rand5, write a code for rand7 using rand5
  • Ans. 

    Code for rand7 using rand5 function

    • Use rand5 twice to generate a number in [1,25] with equal probability

    • If the number is greater than 21, discard and try again

    • Otherwise, return (number mod 7) + 1

  • Answered by AI
  • Q3. Puzzle: Using all(8,8,3,3) and only operators(*,/,-,+), make 24
  • Q4. How do you implement LRU cache?
  • Ans. 

    LRU cache is implemented using a doubly linked list and a hash map.

    • Create a doubly linked list to keep track of the order of elements in the cache.

    • Create a hash map to store the key-value pairs of the cache.

    • When a new element is added, check if the cache is full. If it is, remove the least recently used element from the linked list and the hash map.

    • When an element is accessed, move it to the front of the linked list to...

  • Answered by AI
  • Q5. Your current project in Company? A lot of questions from CV? Discussion went on for about 15 minutes?
  • Q6. Then had a lot of questions around java script and java. About different design patterns and web services
  • Q7. A lot of questions around java, collections frameworks, multi threading and so on. (This took a good 25-30 minutes )
  • Q8. A strategy question. It would be asked depending on which team you are being interviewed for.Mine was some apple seller problem. Here knowledge of real world scenario helps. Advice is to observe things aro...
  • Q9. Write down function to select pivot element randomly in Quick Sort
  • Ans. 

    Function to randomly select pivot element in Quick Sort

    • Generate a random index within the range of the array

    • Return the element at the randomly generated index as the pivot

  • Answered by AI
  • Q10. He asked me what is a data structure and why do we use one. Explained him. He asked some real life example of stack and queue. All I could gave him was programming examples but when he insisted on real li...
  • Q11. As we were talking very much on each question. He felt like talking more and from tech he went around for some biggest learning from a mistake/biggest achievement of life kind of questions. There were oth...

Interview Preparation Tips

General Tips: I recently interviewed with Goldman Sachs, and had 4 rounds of interview with them at their campus in Bangalore.
Skills: Algorithm, Data structure
College Name: na

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Apr 2023. There were 3 interview rounds.

Round 1 - Coding Test 

It was a hackerrank test

Round 2 - Technical 

(2 Questions)

  • Q1. About my projects
  • Q2. DBMS OS and OOPS
Round 3 - HR 

(1 Question)

  • Q1. Why do you want to join UBS

Interview Preparation Tips

Interview preparation tips for other job seekers - Confidence matters
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

Quants, DSA, Logical, Analytical, OS, DBMS

Round 2 - Technical 

(2 Questions)

  • Q1. Please introduce yourself
  • Ans. 

    I am a software developer with 5 years of experience in Java and Python.

    • 5 years of experience in Java and Python

    • Strong problem-solving skills

    • Experience with Agile development practices

  • Answered by AI
  • Q2. Why UBS and what excited you
  • Ans. 

    I chose UBS because of its reputation for innovation and global presence.

    • UBS is known for its cutting-edge technology and commitment to digital transformation

    • The opportunity to work on a global scale with diverse teams excited me

    • UBS's focus on continuous learning and development aligns with my career goals

  • Answered by AI
Interview experience
4
Good
Difficulty level
Hard
Process Duration
2-4 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed in Oct 2023. There was 1 interview round.

Round 1 - Coding Test 

About 2 hours long interview in 3 sets one technical and 2 HR rounds

Contribute & help others!
anonymous
You can choose to be anonymous

Bank of America Interview FAQs

How many rounds are there in Bank of America Senior .NET Developer interview?
Bank of America interview process usually has 1 rounds. The most common rounds in the Bank of America interview process are Technical.
What are the top questions asked in Bank of America Senior .NET Developer interview?

Some of the top questions asked at the Bank of America Senior .NET Developer interview -

  1. Difference between function and stored procedure in ...read more
  2. Difference between Entity Framework and ADO....read more
  3. Explain Angular hooks or lifecy...read more

Recently Viewed

INTERVIEWS

Bank of America

No Interviews

INTERVIEWS

Agumentik Software

No Interviews

INTERVIEWS

Quantiphi Analytics Solutions Private Limited

No Interviews

INTERVIEWS

Sanmar Group

No Interviews

INTERVIEWS

Deloitte

No Interviews

INTERVIEWS

Simplilearn

No Interviews

INTERVIEWS

Mazars

No Interviews

INTERVIEWS

Crowe Horwath

No Interviews

INTERVIEWS

Skill Lync

No Interviews

INTERVIEWS

Iris Software

No Interviews

Tell us how to improve this page.

Bank of America Senior .NET Developer Interview Process

based on 1 interview

Interview experience

2
  
Poor
View more

Interview Questions from Similar Companies

ICICI Bank Interview Questions
4.0
 • 2.4k Interviews
HDFC Bank Interview Questions
3.9
 • 2.1k Interviews
IDFC FIRST Bank Interview Questions
3.9
 • 641 Interviews
IndusInd Bank Interview Questions
3.5
 • 601 Interviews
Wells Fargo Interview Questions
3.9
 • 569 Interviews
HSBC Group Interview Questions
4.0
 • 491 Interviews
Yes Bank Interview Questions
3.7
 • 429 Interviews
View all
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.9
Compare

Goldman Sachs

3.5
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