Baazi Games Retention Manager Interview Questions and Answers

Aptitude test

Current affairs

Q1. Puzzle , sql related questions
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

The first round was scheduled in the evening time.
First of all interviewer introduced himself and after my introduction 
He directly shoot first DSA question. The question was easy but conceptual. I have solved some question with same concept and he ask me to share the screen and code in online compiler. Finally I was able to get correct output with all the use cases and I was like "Half work done!"
Then he asked me very core concepts of JavaScript along with that Some Output based questions.
Then finally he asked me theory questions on React along with my experience in React. 
The interviewer was very helpful as well as polite. I don't think if he will not help me during interview I could crack the interview

Q1. 
Is the Sentence a Pangram?
Ninja is relocating to a place called NinjaGram, and for school admission, he is required to identify if a given sentence is a pangram. Your task is to assist Ninja in determini...read more
Ans. 
Yes, the sentence is a pangram if it includes every letter of the English alphabet at least once.
• Check if the sentence contains all 26 letters of the English alphabet.

• Convert the sentence to lowercase to simplify the checking process.

• Use a set to keep track of the letters present in the sentence.

• Iterate through the sentence and add each unique letter to the set.

• After iterating, check if the set contains all 26 letters.
Answered by AI
Add your answer

2 papers- Online tricky questions-medium to high-level difficulty. Computer based

Q1. Basic Biology conceptual questions- What is DNA?
Add your answer
Q2. How does pasteurization work?
Ans. 
Pasteurization is a process of heating food or liquid to a specific temperature to kill harmful bacteria and increase shelf life.
• The process involves heating the substance to a temperature between 60-100°C for a specific time period.

• This kills most of the harmful bacteria and pathogens present in the substance.

• The process was developed by Louis Pasteur in the 19th century to prevent spoilage of wine and beer.

• Pasteuriza...read more
Answered by AI
Add your answer
Q3. Difference between mean, median, and mode?
Ans. 
Mean is the average of a set of numbers, median is the middle value, and mode is the most frequently occurring value.
• Mean is calculated by adding up all the numbers in a set and dividing by the total number of values.

• Median is the middle value in a set of numbers when they are arranged in order.

• Mode is the value that appears most frequently in a set of numbers.

• In a symmetrical distribution, the mean, median, and mode a...read more
Answered by AI
Add your answer

Round duration - 60 mins
Round difficulty - Medium

Q1. 
Railway Seat Berth Determination
Given a railway seat number represented as an integer, determine if it is a valid seat number and identify its berth type. Possible berth types include lower berth, middle...read more
Ans. 
Given a railway seat number, determine if it is valid and identify its berth type.
• Parse input integer 't' for number of test cases

• For each test case, check if seat number is valid (1 <= N <= 100)

• Identify berth type based on seat number and output the result

• Possible berth types are Lower, Middle, Upper, Side Lower, and Side Upper
Answered by AI
Add your answer

Round duration - 90 mins
Round difficulty - Hard

First they asked me to introduce myself then they started questioning on oops concept from basic to advance level such as inheritance, polymorphism, abstraction, exception handling , STL etc. Next they started questioning on data structures. They asked me the logic of “how to find the middle of a linked list”.

Q1. 
Matrix Symmetry Check
You are provided with a square matrix. Your task is to return true if the matrix is symmetric; otherwise, return false.
A symmetric matrix is characterized by its transpose being eq...read more
Ans. 
Check if a square matrix is symmetric by comparing it with its transpose.
• Iterate through the matrix and compare each element with its corresponding element in the transpose

• If any pair of elements do not match, return false immediately

• If all pairs match, return true at the end
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Students who qualified in first round gets link for this round, this round had 4 questions in total, out of which 1 was output based and 3 was DSA based.

Q1. 
Validate Binary Tree Nodes Problem
You are provided with 'N' binary tree nodes labeled from 0 to N-1, where node i has two potential children, recorded in the LEFT_CHILD[i] and RIGHT_CHILD[i] arrays. Dete...read more
Ans. 
The task is to determine if the given binary tree nodes form exactly one valid binary tree.
• Check if there is only one root node (a node with no parent)

• Check if each node has at most one parent

• Check if there are no cycles in the tree

• Check if all nodes are connected and form a single tree
Answered by AI
Add your answer

Round duration - 75 minutes
Round difficulty - Medium

This round was of 70-75 minutes and had 3 coding questions of easy to medium level. There was some restrictions like we cannot use built-in functions in both second and third subjective round.

Q1. 
Balanced Binary Trees Problem Statement
You are provided with an integer 'H'. Your task is to determine and print the maximum number of balanced binary trees possible with height 'H'.
A balanced binary t...read more
Ans. 
The maximum number of balanced binary trees possible with a given height is to be counted and printed.
• A balanced binary tree is one in which the difference between the left and right subtree heights is less than or equal to 1.

• The number of balanced binary trees can be calculated using dynamic programming.

• The number of balanced binary trees with height 'H' can be obtained by summing the product of the number of balanced...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This was face to face interview round of 60 minutes. It was mostly based on DSA, some questions was also asked related to my projects and DBMS. Interviewer was kind and good.

Q1. 
Wave Array Sorting Problem
Your goal is to sort a given unsorted array ARR such that it forms a wave array.
Explanation:
After sorting, the array should satisfy the wave pattern conditions:
• ARR[0] &...read more
Ans. 
The task is to sort an array in a wave form, where each element is greater than or equal to its adjacent elements.
• Iterate through the array and swap adjacent elements if they do not follow the wave pattern

• Start from the second element and compare it with the previous element, swap if necessary

• Continue this process until the end of the array

• Repeat the process for the remaining elements

• Return the sorted wave array
Answered by AI
Add your answer
Q2. 
Maximum Sum BST Problem Statement
You are presented with a Binary Tree 'root', which may not necessarily be a Binary Search Tree (BST). Your objective is to identify the maximum sum of node values in any ...read more
Ans. 
The task is to find the maximum sum of node values of any subtree that is a Binary Search Tree(BST).
• Traverse the binary tree in a bottom-up manner

• For each node, check if it forms a BST and calculate the sum of its subtree

• Keep track of the maximum sum encountered so far

• Return the maximum sum
Answered by AI
Add your answer

Round duration - 135 minutes
Round difficulty - Hard

This was the final technical round, it was around 2.5 hours long and based on mostly DSA and little bit Projects, DBMS, OS. Josh mainly focus on DSA and on Tree Data Structure in interview.

Q1. 
Pair Sum in BST Problem Statement
Given a Binary Search Tree (BST) and a target value K, determine if there exist two unique elements in the BST such that their sum equals K.
Input:
An integer T, the nu...read more
Ans. 
The task is to check if there exist two unique elements in the given BST such that their sum is equal to the given target 'K'.
• Traverse the BST in-order and store the elements in a sorted array

• Use two pointers, one at the beginning and one at the end of the array

• Check if the sum of the elements at the two pointers is equal to the target 'K'

• If the sum is less than 'K', move the left pointer to the right

• If the sum is grea...read more
Answered by AI
Add your answer
Q2. 
Find Nodes at Distance K in a Binary Tree
Your task is to find all nodes that are exactly a distance K from a given node in an arbitrary binary tree. The distance is defined as the number of edges between ...read more
Ans. 
The task is to find all nodes in a binary tree that are at a distance K from a given node.
• Implement a function that takes the binary tree, target node, and distance K as input.

• Use a depth-first search (DFS) algorithm to traverse the tree and find the nodes at distance K.

• Keep track of the distance from the current node to the target node while traversing.

• When the distance equals K, add the current node to the result lis...read more
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

This was the simple 20 minutes round