Bank Of America interview experience Real time questions & tips from candidates to crack your interview

Software Engineer

Bank Of America

2 rounds | 4 Coding problems

Anonymous

Fresher | Sep 2023

Selected

Interview preparation journey

Journey

It was an on-campus placement opportunity. I had to apply for it through the college placements portal. There were many openings for the 2024 position, but I chose Software Engineering. I am currently in my 4th year. Before this, I interned at Google and regularly practised on coding platforms. I also served as the head of the competitive coding department in one of the clubs at my college. Additionally, I was a Microsoft Engage mentee.

Application story

It was on campus so we had to apply for it from our college placements portal. There were a lot of postings, but I picked Software Engineering.

Why selected/rejected for the role?

I was selected for this role. Throughout the interview process, I performed well in all the rounds, and as a result, they chose me for the position.

Preparation

Duration: 6 months

Topics: Data Structures, Database Management Systems, Object Oriented Programming, Networking, Algorithms

Tip

Tip 1: Practising on coding platforms is very important
Tip 2: Have a really good ATS-friendly resume
Tip 3: Have a strong knowledge of the base concepts

Application process

Where: Campus

Eligibility: 6 CGPA

Resume tip

Tip 1: Keep it simple and to one page.
Tip 2: Resume should be ATS Friendly.

Interview rounds

Round

Medium

Online Coding Test

Duration60 minutes

Interview date27 Sep 2023

Coding problem2

The selection process comprised a coding round, followed by a video interview. The interview questions were pre-recorded, and there were no interviewers present during the session.

1. M-Coloring Problem

Moderate

15m average time

85% success

0/80

Asked in companies

You are given an undirected graph as an adjacency matrix consisting of 'v' vertices and an integer 'm'.

You need to return 'YES' if you can color the graph using at most 'm' colors so that no two adjacent vertices are the same. Else, return 'NO'.

For example:

Input:
If the given adjacency matrix is:
[0 1 0]
[1 0 1]
[0 1 0] and 'm' = 3.

Output: YES

Explanation:
The given adjacency matrix tells us that 1 is connected to 2 and 2 is connected to 3. We can use three different colors and color all three nodes.
Hence we return true.

Problem approach

One can see that the number of ways to traverse this tree is basically is product of factorials of the number of childs of each node in a n-ary tree. We can use something like a level order traversal to count the childs of a node, then calculate factorials at each node and multiply the factorials calculated at each node.

Try solving now

2. Count Set Bits

Hard

15m average time

85% success

0/120

Asked in companies

Write a function that takes the binary representation of an unsigned integer and returns the number of '1' bits it has.

Problem approach

In each iteration, we use the bitwise AND operation n & (n - 1) to clear the rightmost set bit.
We count the number of iterations until n becomes 0, and that count is the set bit count.
Let's apply the Hamming Weight algorithm step by step:

Initial state: 10110101, set bit count = 0
After the 1st iteration: 10110100, set bit count = 1
After the 2nd iteration: 10110000, set bit count = 2
After the 3rd iteration: 10100000, set bit count = 3
After the 4th iteration: 10000000, set bit count = 4
After the 5th iteration: 00000000, set bit count = 5
The final set bit count is 5, and that's the number of '1' bits in the binary representation of 10110101.

Try solving now

Round

Easy

Video Call

Duration45 minutes

Interview date2 Oct 2023

Coding problem2

It was an online interview. I was asked questions about a lot of things. I was asked about my previous projects, my past internships, and a little bit of the basics of the fundamentals of my courses.

1. Technical Question

How do you declare an array? (Link)

2. Basic HR Questions

1. Explain about the projects you did.
2. Explain the work you did in your previous internship.
3. What is a friend class?
4. How do you declare an array?
5. What are the different stages of making a software solution?