Bank of America Software Developer Interview Questions, Process, and Tips

Q1. Just formal questions
Add your answer

Q1. What is ML, Re train the model, mostly it depends on your area of expertise
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

This was the first round of Bank of America Recruitment. It was conducted on Hirevue Platform. The timing of the Test was 90 minutes . There were some precautions that we needed to take care off before sitting for the test like Good internet connectivity , Formal dress code. It was completely web proctored test where all the video, audio and screen is recorded.
There were 5 questions in the test. 3 questions of video recordings and 2 questions of Coding.
1) Describe about your education and work experience
---> This was the first question, we were given 30 seconds to prepare for the answer and there were a button to start video and we were given 3 minutes to answer the question. 

2) Why you are a best fit for this role?
---> This was also a video Question where we were given 30 sec to prepare and 3 minutes to answer

3) This was the coding Question.
Question - Write a program that , given an integer N , sums all the whole numbers from 1 through N(both inclusive) . Do not include in your sum any of the intermediate values ( 1 and N inclusive) that are divisible by 5 or 7.
Test Input - 10
Expected output - 33

4) This was also coding question related to strings
Question - Given a string s , little Johny defined the beauty of the string as the sum of the beauty of the letters in it. The beauty of each letter is an integer between 1 to 26, inclusive , and no two letters have the same beauty.  Johny does not care about whether the letters are uppercase or lowercase , so that does not affect the beauty of letter.

Test input - ABbCcc
Expected output - 152

5) Describe what approach you followed in 2nd coding question.
---> it was a video question in which we needed to define our approach for the above coding question.

Q1. 
Multiples of 2 and 3 Problem Statement
Ninja is engaged in a task involving divisors. He is given 'N' numbers, and his objective is to compute the sum of all numbers which are divisible by either 2 or 3.
...read more
Ans. 
Find the sum of numbers divisible by 2 or 3 from a given list of numbers.
• Iterate through the list of numbers and check if each number is divisible by 2 or 3.

• If a number is divisible by 2 or 3, add it to the sum.

• Return the final sum as the output.
Answered by AI
Add your answer
Q2. 
Beautiful String Problem Statement
Given a binary string STR containing either '0' or '1', determine the minimum number of operations needed to make it beautiful. A binary string is called beautiful if it...read more
Ans. 
The problem involves determining the minimum number of operations needed to make a binary string beautiful by ensuring it contains alternating 0s and 1s.
• Iterate through the binary string and count the number of operations needed to make it beautiful by flipping the bits as required.

• Keep track of the current bit and compare it with the next bit to determine if a flip operation is needed.

• Return the total number of operat
Answered by AI
Add your answer

Round duration - 70 minutes
Round difficulty - Medium

I got mail on 7th December at 10:30 pm about the next round which was to be held on next day at 9:40 am .
I got the link of 1st round at 9:30 am on 8th December. It was on Cisco Webex platform . This way of technical interview round was very unique for me because we only have to open video on webex and there we were given a line number to call by phone. We need to give answer on phone and video is on through webex.
My interview started by 9:45 am . First of all interviewer asked very famous question of Interview i.e.
"Tell me about yourself"
I have given proper answer of this question including my achievements , internships and education.
The interviewer was very friendly . He kept motivating me till end of interview. He took me to the right approach in many questions.

Q1. 
Alternate Print Problem Statement
Given two strings A and B, your task is to print these two strings in an alternating sequence by indices. That is, the first character of 'A', the first character of 'B',...read more
Ans. 
The task is to print two strings in an alternating sequence by indices.
• Iterate through both strings simultaneously and append characters alternately

• Handle the case where one string is longer than the other

• Use two pointers to keep track of the current index in each string
Answered by AI
Add your answer

Round duration - 63 minutes
Round difficulty - Hard

I got call from HR at 1:43 Pm , she asked me to prepare 2nd round of interview at 2:00 Pm . She sent me the link . I was waiting for next round when she again called me that my interview had shifted from 2 to 3:30 PM . 
I started my next round of interview with the same procedure i.e. the video is on through webex and the audio is through call on bridge line number.
This was Technical + HR both round. I were asked technical as well as HR related Questions
Again the interviewer was very friendly . He treated me very well and help me out in many questions.
I got a great experience from this interview. Overall It was a good learning for me.

Q1. 
Fourth Largest Element in the Array
Given an array consisting of integers, your task is to determine the fourth largest element in the array. If the array does not contain at least four distinct elements,...read more
Ans. 
Find the fourth largest element in an array of integers.
• Sort the array in descending order to easily find the fourth largest element.

• If the array has less than four distinct elements, return -2147483648.

• Handle edge cases like empty array or array with less than four elements.
Answered by AI
Add your answer
Q2. 
Merge Sort Problem Statement
You are given a sequence of numbers, ARR. Your task is to return a sorted sequence of ARR in non-descending order using the Merge Sort algorithm.
Explanation:
The Merge Sort...read more
Ans. 
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
• Divide the input array into two halves recursively until each array has only one element.

• Merge the sorted halves to produce a completely sorted array.

• Time complexity of Merge Sort is O(n log n).

• Example: Input - [3, 1, 4, 1, 5], Output - [1, 1, 3, 4, 5]
Answered by AI
Add your answer
Q3. 
Quick Sort Problem Statement
You are provided with an array of integers. The task is to sort the array in ascending order using the quick sort algorithm.
Quick sort is a divide-and-conquer algorithm. It ...read more
Ans. 
Yes, the quick sort algorithm can be enhanced to achieve NlogN complexity in the worst case by using a randomized pivot selection strategy.
• Randomized pivot selection: Choose a random element as the pivot to reduce the chances of worst-case scenarios.

• Median-of-three pivot selection: Select the median of the first, middle, and last elements as the pivot to improve partitioning.

• Optimizing partitioning: Use efficient parti...read more
Answered by AI
Add your answer
Q4. 
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...read more
Ans. 
Reverse a singly linked list of integers and return the head of the reversed linked list.
• Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.

• Use three pointers to keep track of the current, previous, and next nodes while reversing the linked list.

• Update the head of the reversed linked list as the last node encountered during the reversal process.
Answered by AI
View 1 more answer
Q5. 
Detect and Remove Loop in Linked List
For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the modified linked list.
Expected Complexity:
A...read more
Ans. 
Detect and remove loop in a singly linked list in place with O(n) time complexity and O(1) space complexity.
• Use Floyd's Cycle Detection Algorithm to identify the loop in the linked list.

• Once the loop is detected, use two pointers to find the start of the loop.

• Adjust the pointers to remove the loop and return the modified linked list.
Answered by AI
Add your answer
Q6. 
Binary Palindrome Check
Given an integer N, determine whether its binary representation is a palindrome.
Input:
The first line contains an integer 'T' representing the number of test cases. 
The next 'T'...read more
Ans. 
Check if the binary representation of a given integer is a palindrome.
• Convert the integer to binary and check if the binary string is a palindrome.

• Use bitwise operations to manipulate the binary representation of the integer.

• Consider edge cases like handling leading zeros in the binary representation.
Answered by AI
Add your answer
Q7. 
Find Pairs in a Doubly-Linked List
A sorted doubly-linked list of distinct positive integers is provided, along with an integer 'X'. Your task is to identify and print all unique pairs from the list whose...read more
Ans. 
Find pairs in a sorted doubly-linked list whose sum equals a given integer 'X'.
• Traverse the list from both ends to find pairs with sum equal to 'X'.

• Use two pointers approach to efficiently find the pairs.

• Handle cases where the sum is less than, equal to, or greater than 'X'.
Answered by AI
Add your answer