Gulgan Business Solution Interview Questions and Answers

Find the minimum cost to reach a destination in a matrix with specified rules.

• Use Breadth First Search (BFS) algorithm to explore all possible paths from the starting point to the destination.

• Keep track of the cost incurred at each cell and update it as you move through the matrix.

• Return the minimum cost to reach the destination or -1 if it is unreachable.

• Consider edge cases such as when the starting point is the destination or when the destination is blocked.

Find the maximum elements for each subarray of size 'K' in a given array of non-negative integers.

• Iterate through the array and maintain a deque to store the indices of elements in decreasing order.

• Pop elements from the deque if they are out of the current window of size 'K'.

• The front of the deque will always have the index of the maximum element for the current window.

Given a singly linked list with integers separated by '0', merge nodes between '0's into a single node with sum of included nodes.

• Traverse the linked list and keep track of sum between zeroes

• Merge nodes between zeroes by updating the sum in the merged node

• Update the linked list by removing the nodes between zeroes

• Handle edge cases like list starting and ending with '0'

Convert a given array representing a min-heap into a max-heap.

• Iterate through the array and swap parent nodes with their children to convert min-heap to max-heap.

• Maintain the heap property by comparing parent with its children and swapping if necessary.

• Ensure the final array satisfies the max-heap property where parent nodes are greater than their children.

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

• Create a graph representation of the board with snakes and ladders as edges.

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

• Keep track of visited cells and the number of dice throws at each cell.

• Handle cases where the last cell is unreachable by returning -1.

• Consider the special cases where the last cell is reached through a lad...read more