iB Hubs Bdm Executive Interview Questions and Answers

Q1. Related to delivery and implementation of education programs
Add your answer

Q1. Previous exposure to consulting or banking? or to the startup ecosystem?
Ans. 
Yes
• I have previous exposure to both consulting and banking.

• I have worked as a consultant for a management consulting firm for 3 years.

• During my time as a consultant, I worked on various projects for clients in the banking industry.

• I have also worked as a financial analyst at a leading bank for 2 years.

• In addition, I have been actively involved in the startup ecosystem as an advisor and mentor to several startups.
Answered by AI
Add your answer

Q1. Why do you want to work at Invest India?
Ans. 
I want to work at Invest India because of their reputation, opportunities for growth, and alignment with my career goals.
• Invest India has a strong reputation in the industry and is known for its successful projects and initiatives.

• I believe that working at Invest India will provide me with ample opportunities for professional growth and development.

• The organization's mission and values align closely with my own career ...read more
Answered by AI
Add your answer

Asked for excel test and tested my email etiquette .

Q1. Where do you stay
Add your answer
Q2. How do you travel
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

This was a MCQ round. 30 ques in 30 mins consisting of difficult quantitative aptitude questions were to be solved.

Round duration - 60 minutes
Round difficulty - Medium

In this test round, 2 coding questions were given. Either write the code or pseudo code

Q1. 
N Queens Problem
Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.
Explanation:
A queen can attack another queen if they ar...read more
Ans. 
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard without threatening each other.
• Use backtracking algorithm to explore all possible configurations.

• Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.

• Generate all valid configurations and print them out.
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

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round with questions on DSA.

Q1. 
Reverse Words in a String: Problem Statement
You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...read more
Ans. 
Reverse words in a string while handling leading, trailing, and multiple spaces.
• Split the input string by spaces to get individual words

• Reverse the order of the words

• Join the reversed words with a single space in between
Answered by AI
Add your answer
Q2. 
Circular Linked List Detection
You are provided with the head of a linked list containing integers. Your task is to determine if the linked list is circular.
Note:
• A linked list is considered circula...read more
Ans. 
Detect if a given linked list is circular by checking if it forms a closed loop.
• Traverse the linked list using two pointers, one moving at double the speed of the other.

• If the two pointers meet at any point, the linked list is circular.

• If the faster pointer reaches the end of the list (NULL), the linked list is not circular.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.