Bajaj Allianz General Insurance Interview Questions and Answers

The Flood Fill Algorithm is used to change the color of a particular region in an image and all its adjacent same-colored pixels.

• The image is represented as a 2D array of positive integers

• The starting pixel and new color are given

• Adjacent pixels are connected in up, down, left, or right directions

• Diagonal pixels are not considered adjacent

• Implement the Flood Fill Algorithm to replace the color of the given pixel and its adjacent same-colored pixels with the new color

• Repeat th...read more

Find the time it takes for a signal to travel from a given source node to all other nodes in a network.

• Use Dijkstra's algorithm to find the shortest path from the source node to all other nodes.

• Keep track of the minimum time taken to reach each node.

• If it is impossible for the signal to reach all nodes, return -1.

The task is to find the weight of the minimum spanning tree of a given connected undirected weighted graph.

• Implement Kruskal's algorithm to find the minimum spanning tree

• Use a disjoint set data structure to keep track of connected components

• Sort the edges in non-decreasing order of their weights

• Iterate through the sorted edges and add them to the minimum spanning tree if they don't create a cycle

• Return the sum of weights of the edges in the minimum spanning tree

The task is to implement the merge sort algorithm to sort a given sequence of numbers in non-descending order.

• Merge sort is a divide and conquer algorithm that recursively divides the input array into two halves until the size becomes 1.

• Then it merges the two sorted halves to produce a single sorted array.

• The time complexity of merge sort is O(n log n), where n is the size of the input array.

• The algorithm is efficient for large data sets and guarantees a stable sort.

• The imple...read more

Given an integer, find the maximum number of consecutive ones by flipping one bit.

• Iterate through the binary representation of the integer to find the longest sequence of ones.

• Track the current sequence of ones and the previous sequence to determine the maximum length after flipping one bit.

• Update the maximum length whenever a zero is encountered and keep track of the position of the zero for flipping.

• Return the maximum length of consecutive ones after flipping one bit for ea...read more

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 to use no more than O(S) extra space by using rolling arra...read more

Convert Postfix expression to Prefix expression by reversing the Postfix expression and then traversing it from left to right.

• Reverse the given Postfix expression

• Traverse the reversed expression from left to right

• If an operand is encountered, push it to the stack

• If an operator is encountered, pop two operands from the stack and concatenate them with the operator in the prefix form

• Push the resulting string back to the stack

• Repeat until the entire expression is processed

Given a set of stations connected by trains, find the cheapest fare from a source to a destination with a maximum number of stops.

• Iterate through all possible routes with up to 'K' stops using DFS or BFS.

• Keep track of the cost for each route and return the minimum cost found.

• If no route is found within the maximum stops, return -1.

• Consider using a graph data structure to represent the stations and trains.

• Handle multiple test cases by looping through each case.