BCG Assistant Research and Development Manager Interview Questions and Answers

Round duration - 90 minutes
Round difficulty - Medium

This test consists of two coding questions and some MCQ regarding computer fundamentals.

Q1. 
Kevin and His Cards Problem Statement
Kevin has two packs of cards. The first pack contains N cards, and the second contains M cards. Each card has an integer written on it. Determine two results: the tot...read more
Ans. 
Find total distinct card types and common card types between two packs of cards.
• Create a set to store distinct card types when combining both packs.

• Iterate through each pack and add card types to the set.

• Find the intersection of card types between the two packs to get common card types.
Answered by AI
Add your answer
Q2. 
Allocate Books Problem Statement
Given an array of integers arr, where arr[i] represents the number of pages in the i-th book, and an integer m representing the number of students, allocate all the books ...read more
Ans. 
Allocate books to students in a way that minimizes the maximum number of pages assigned to a student.
• Iterate through all possible allocations of books to students.

• Calculate the maximum number of pages assigned to a student for each allocation.

• Return the minimum of these maximums as the result.
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

It was a technical round that is based on DSA and computer fundamentals.

Q1. 
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 - prev, current, and next to reverse the linked list in O(N) time and O(1) space complexity.

• Update the head of the reversed linked list as the last node encountered during the reversal process.
Answered by AI
Add your answer
Q2. 
Sort 0 1 2 Problem Statement
Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
Input:
The first line contains an integer 'T' representing the n...read more
Ans. 
Sort an array of 0s, 1s, and 2s in linear time complexity.
• Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.

• Swap elements based on the values encountered to sort the array in-place.

• Time complexity should be O(N) and space complexity should be O(1).
Answered by AI
Add your answer