BuildINT Interview Questions and Answers

Round duration - 90 Miinutes
Round difficulty - Medium

The round has 2 sections each.

1) First Section consisted of 2 coding questions.
2) Second Section consisted of 28 multiple choice questions(MCQs)

Q1. 
Equation Solver Problem Statement
You are provided with an equation involving the addition of two numbers, where one of the numbers is missing and is represented as 'x'. Your task is to determine the valu...read more
Ans. 
Solve for the missing number 'x' in an equation involving addition of two numbers.
• Identify the summands and the result in the equation.

• Subtract the known summand from the result to find the missing number 'x'.

• Return the value of 'x' as the output.
Answered by AI
Add your answer
Q2. 
Anagram Pairs Verification Problem
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...read more
Ans. 
Determine if two strings are anagrams of each other by checking if they can be rearranged to form the other string.
• Create a frequency map of characters for both strings and compare them to check if they are equal.

• Sort both strings and compare them to see if they are equal.

• Use a set to store characters of one string and remove characters from the set while iterating through the other string.

• If the set is empty at the en
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

This was my first technical round and the interviewer mainly tested my problem solving skills.

Q1. 
Minimum Steps for a Knight to Reach Target
Given a square chessboard of size 'N x N', determine the minimum number of moves a Knight requires to reach a specified target position from its initial position...read more
Ans. 
Calculate minimum steps for a Knight to reach target position on a chessboard.
• Use BFS algorithm to find shortest path from Knight's starting position to target position.

• Consider all possible moves of the Knight on the chessboard.

• Track visited positions to avoid revisiting them during traversal.
Answered by AI
Add your answer

Round duration - 120 minutes
Round difficulty - Hard

Q1. 
Round Robin Scheduling Problem Statement
You are provided with 'N' processes, each having a process ID ranging from 1 to 'N'. Each process has an arrival time and a burst time. Additionally, you're given ...read more
Ans. 
Implement a round-robin scheduling algorithm to determine completion time for each process.
• Implement a round-robin scheduling algorithm with the given time quantum.

• Execute processes based on arrival time and process ID if arrival times are the same.

• Calculate completion time for each process based on burst time and time quantum.
Answered by AI
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

The round was scheduled at 10 AM on 2nd August, 2019, But it started a little late due to some issues in Lab devices. The test started in a full screen mode and no one was allowed to exit full screen mode.

Q1. 
Remainder When Divided By 11 Problem Statement
Determine the remainder when a given number, 'N' in the form of a string, is divided by 11.
Input:
The first line contains an integer 'T' denoting the numb...read more
Ans. 
Find the remainder when a given number is divided by 11.
• Convert the string number to an integer for easier calculation.

• Use the property that the remainder when a number is divided by 11 is the same as the remainder when the alternating sum of its digits is divided by 11.

• Repeat the process until you get a single digit number as the result.
Answered by AI
Add your answer
Q2. 
Missing Number Problem Statement
You are provided with an array named BINARYNUMS consisting of N unique strings. Each string represents an integer in binary, covering every integer from 0 to N except for ...read more
Ans. 
Given an array of unique binary strings representing integers from 0 to N, find and return the missing integer's binary representation.
• Iterate through the binary strings and convert them to integers.

• Calculate the sum of integers from 0 to N using the formula (N * (N + 1)) / 2.

• Subtract the sum of the integers in the array from the total sum to find the missing integer.

• Convert the missing integer to binary and return it
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

It was a F2F interview. The interviewer was very friendly and was working as an SDE II in Consumers team. He started with quick intro of himself and then asked mine. Then jumped into coding question. He was monitoring my every single activity throughout the interview and told me ignore whenever I type something on my laptop.

Q1. 
Fish Eater Problem Statement
In a river where water flows from left to right, there is a sequence of 'N' fishes each having different sizes and speeds. The sizes of these fishes are provided in an array c...read more
Ans. 
Given a river with fishes of different sizes and speeds, determine how many fishes survive after encounters.
• Iterate through the array of fishes and simulate encounters between fishes to determine survivors

• Use a stack to keep track of surviving fishes

• Compare sizes of fishes to determine which fish eats the other
Answered by AI
View 1 more answer
Q2. 
Fishmonger Toll Optimization Problem
A fishmonger needs to transport goods from a port to a market, crossing multiple states each requiring a toll. The goal is to minimize the toll costs while ensuring th...read more
Ans. 
The Fishmonger Toll Optimization Problem involves minimizing toll costs while ensuring timely delivery of goods from a port to a market.
• Given 'N' states and a time limit 'M', find the smallest toll amount to reach the market from the port within the given time.

• Use dynamic programming to solve the problem efficiently.

• Consider both time and toll matrices to calculate the minimum toll cost.

• Return -1 if it is not possible
Answered by AI
Add your answer

Round duration - 75 Minutes
Round difficulty - Medium

It was a F2F interview. The interviewer was very friendly and was working as an SDE III in Payments team. He started with quick intro of himself and then asked mine. He asked me about the project I mentioned in my resume and some questions regarding the project. Then jumped into coding question. He was monitoring my every single activity throughout the interview.

Q1. 
Battalions and Tanks Problem Statement
Given 'N' battalions and 'M' tanks, along with an array representing the number of soldiers in each battalion, you need to allocate the tanks such that the maximum r...read more
Ans. 
Allocate tanks to battalions to minimize maximum ratio of soldiers per tank.
• Calculate the ratio of soldiers to tanks for each battalion.

• Sort the ratios in ascending order.

• Return the maximum ratio from the sorted list.
Answered by AI
Add your answer
Q2. 
Diagonal Traversal of a Binary Tree
Given a binary tree of integers, find its diagonal traversal. Refer to the example for clarification on diagonal traversal.
Example:
Explanation:
Consider lines at a...read more
Ans. 
Diagonal traversal of a binary tree involves printing nodes at the same diagonal in a specific order.
• Traverse the tree in a diagonal manner, starting from the root node and moving towards the right child and then the left child.

• Use a queue to keep track of nodes at each level of the tree.

• Print the nodes in the order they are encountered while traversing the tree diagonally.
Answered by AI
Add your answer

Round duration - 120 minutes
Round difficulty - Medium

28 MCQ's + 2 coding question

Q1. 
Dice Throws Problem Statement
You are given D dice, each having F faces numbered from 1 to F. The task is to determine the number of possible ways to roll all the dice such that the sum of the face-up num...read more
Ans. 
The task is to determine the number of possible ways to roll all the dice such that the sum of the face-up numbers equals the given 'target' sum.
• Use dynamic programming to solve the problem efficiently.

• Create a 2D array to store the number of ways to achieve each sum with different number of dice.

• Iterate through the dice and sum possibilities to fill up the array.

• Return the result modulo 10^9 + 7.

• Optimize the solution ...read more
Answered by AI
Add your answer
Q2. 
Count Set Bits Problem Statement
Given a positive integer N, compute the total number of '1's in the binary representation of all numbers from 1 to N. Return this count modulo 1e9+7 because the result can...read more
Ans. 
Count the total number of set bits in the binary representation of numbers from 1 to N modulo 1e9+7.
• Use bitwise operations to count the set bits in each number from 1 to N.

• Consider using dynamic programming to optimize the solution.

• Remember to return the count modulo 1e9+7 to handle large results.
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Hard

Coding Round 
Brief Introduction in starting and then two DSA questions(medium and hard)

Q1. 
Postorder Traversal Problem Statement
You are given the root node of a binary tree consisting of 'N' nodes. Your task is to return its postorder traversal. The postorder traversal of a binary tree is defi...read more
Ans. 
Return the postorder traversal of a binary tree given its root node.
• Traverse left subtree

• Traverse right subtree

• Visit root node

• Use recursion to solve

• Example: [4, 5, 2, 3, 1]
Answered by AI
Add your answer
Q2. 
Longest Increasing Subsequence Problem Statement
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...read more
Ans. 
Find the length of the longest strictly increasing subsequence in an array of integers.
• Use dynamic programming to keep track of the longest increasing subsequence ending at each element.

• Initialize an array to store the lengths of the longest increasing subsequences.

• Iterate through the array and update the lengths array based on the current element and previous elements.

• Return the maximum value in the lengths array as t
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Coding Round 
No introduction
3 DSA Questions

Q1. 
Sort an Array in Wave Form
You are given an unsorted array ARR. Your task is to sort it so that it forms a wave-like array.
Input:
The first line contains an integer 'T', the number of test cases.
For ea...read more
Ans. 
Sort an array in a wave-like pattern where each element is greater than or equal to its neighbors.
• Iterate through the array and swap elements to form the wave pattern.

• Start by sorting the array in non-decreasing order.

• Swap adjacent elements to form the wave pattern.

• Return the modified array as the output.
Answered by AI
Add your answer
Q2. How would you implement a data structure to show the three last watched movies on Amazon Prime?
Ans. 
Implement a data structure to show the three last watched movies on Amazon Prime.
• Use an array data structure to store the last watched movies.

• Keep track of the order in which the movies were watched to display the most recent ones first.

• Update the array whenever a new movie is watched, shifting older movies to make room for the new ones.
Answered by AI
Add your answer
Q3. 
Data Structure with Insert, Delete, and GetRandom Operations
Design a data structure that supports four operations: insert an element, remove an element, search for an element, and get a random element. E...read more
Ans. 
Design a data structure supporting insert, delete, search, and getRandom operations in constant time.
• Use a combination of hashmap and array to achieve O(1) time complexity for each operation.

• For insert operation, check if element exists in hashmap, if not add to array and hashmap.

• For remove operation, check if element exists in hashmap, if yes, remove from array and hashmap.

• For search operation, check if element exists...read more
Answered by AI
Add your answer