Havells Interview Questions and Answers

Find the maximum total booked minutes possible in a conference room for given meeting durations with a 15-minute break between meetings.

• Iterate through the list of meeting durations and calculate the maximum total booked minutes by considering the 15-minute break constraint.

• Keep track of the total booked minutes and skip consecutive meetings that violate the break constraint.

• Return the maximum total booked minutes for each test case.

Calculate total unique paths from top-left to bottom-right corner of a matrix by moving only right or down.

• Use dynamic programming to solve this problem efficiently.

• Create a 2D array to store the number of unique paths for each cell.

• Initialize the first row and first column with 1 as there is only one way to reach them.

• For each cell, the number of unique paths is the sum of the paths from the cell above and the cell to the left.

• Return the value in the bottom-right corner of t...read more

The task is to implement a function that reorders edges in a directed acyclic graph to ensure a directed path exists from every node to node 0 with minimum edge reversals.

• Iterate through the graph to find the shortest path from each node to node 0.

• Determine the number of edge reversals needed to create a directed path from each node to node 0.

• Implement a function that performs the edge reversal operation efficiently.

• Consider using graph traversal algorithms like BFS or DFS to...read more

Find the minimum number of dice throws required to reach the last cell on a 'Snake and Ladder' board.

• Use Breadth First Search (BFS) algorithm to find the shortest path from the starting cell to the last cell.

• Maintain a queue to keep track of the cells to be visited next.

• Consider the effect of snakes and ladders on the movement of the player.

• Handle the boundary conditions and constraints specified in the problem statement.

• Return the minimum number of throws required to reach t...read more

Calculate the intersection point of two lines on a 2D plane with precision up to six decimal places.

• Parse input integers for each test case

• Implement line intersection algorithm

• Handle precision up to six decimal places in output

• Return -1.000000 -1.000000 if lines do not intersect