Bank of America Software Testing Engineer Interview Questions and Answers

Round duration - 90 Minutes
Round difficulty - Medium

Coding round was conducted in the morning for 1.5 hours from 10:00 am to 11:30 am. Exam was conducted on HACKEREARTH which is a user-friendly platform with various edge test-cases. Since exam was done through online mode due to COVID-19, therefore camera was on for invigilation. A well working camera and microphone were needed for successful completion of exam.

Q1. 
Words Magic with Prefix Replacement Problem
Ninja is provided with a dictionary of words, WORDS, and a sentence, SENTENCE, which consists of words separated by spaces. The goal is to minimize the size of ...read more
Ans. 
The goal is to minimize the size of a sentence by replacing words with prefixes from a given dictionary.
• Iterate through each word in the sentence and check if a prefix exists in the dictionary

• Replace the word with the smallest prefix found in the dictionary

• Repeat the process for all words in the sentence
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

The coding round consisted of 3 coding questions. 1st question was of 20 marks, 2nd and 3rd of 50 marks.

Q1. 
Minimum Number of Operations Problem Statement
Given an array 'ARR' consisting of 'N' positive integers, determine the minimum number of operations needed to make all elements of the array equal. You may ...read more
Ans. 
Determine minimum operations to make all array elements equal using addition, subtraction, multiplication, or division.
• Iterate through array to find the minimum and maximum values

• Calculate the difference between the maximum and minimum values

• Return the difference as the minimum number of operations needed
Answered by AI
Add your answer
Q2. 
Avoiding Traps Problem Statement
Given an array of obstacles' coordinates, determine the minimal jump length to reach beyond all obstacles starting from coordinate 0 while avoiding landing on any obstacle...read more
Ans. 
Find the minimal jump length to bypass all obstacles while avoiding landing on any obstacle.
• Iterate through the obstacle coordinates to find the maximum coordinate.

• Calculate the minimum jump length needed to bypass all obstacles.

• Ensure the jump length consistently avoids all obstacle points.

• The final jump can overshoot the line's end point.
Answered by AI
Add your answer
Q3. 
Longest Consecutive Sequence Problem Statement
You are given an unsorted array/list ‘ARR’ of ‘N’ integers. Your task is to return the length of the longest consecutive sequence.
The consecutive sequence ...read more
Ans. 
Find the length of the longest consecutive sequence in an unsorted array of integers.
• Sort the array to make it easier to identify consecutive sequences.

• Use a set to store unique elements and check for consecutive numbers.

• Track the length of consecutive sequences and update the maximum length found.

• Handle duplicates by counting only one occurrence in the consecutive sequence.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

Timing: 10:15 - 11:00 am.
The interview was online from home.

Round duration - 45 minutes
Round difficulty - Medium

Timing: 2:15 - 3:00 PM
The interview was online from home.
There were a few audio cuts in the video call but we were able to manage regardless.

Q1. 
Reverse a String Problem Statement
Given a string STR containing characters from [a-z], [A-Z], [0-9], and special characters, determine the reverse of the string.
Input:
The input starts with a single i...read more
Ans. 
Reverse a given string containing characters from [a-z], [A-Z], [0-9], and special characters.
• Iterate through the characters of the string in reverse order and append them to a new string.

• Use built-in functions like reverse() or StringBuilder in languages like Python or Java for efficient reversal.

• Handle special characters and numbers along with alphabets while reversing the string.

• Ensure to print each reversed string
Answered by AI
Add your answer