Dabur Interview Questions and Answers

The task is to find the total number of ways to make change for a specified value using given denominations.

• Use dynamic programming to solve this problem efficiently.

• Create a 2D array to store the number of ways to make change for each value using different denominations.

• Initialize the base cases and then iterate through the denominations to fill up the array.

• The final answer will be in the last cell of the array corresponding to the specified value.

Validate if a given binary tree is a Binary Search Tree (BST) or not.

• Check if the left subtree of a node contains only nodes with data less than the node's data.

• Check if the right subtree of a node contains only nodes with data greater than the node's data.

• Recursively check if both the left and right subtrees are also binary search trees.

• Example: For each node, ensure all nodes in its left subtree are less and all nodes in its right subtree are greater.

Identify the duplicate integer in an array of size N containing numbers between 1 and N-1.

• Iterate through the array and keep track of the frequency of each element using a hashmap.

• Return the element with a frequency greater than 1 as the duplicate integer.

• Ensure the constraints are met and a duplicate number is guaranteed to be present in the array.

The program finds the number that occurs the maximum times in an array of integers.

• Iterate through the array and count the frequency of each number using a dictionary.

• Keep track of the number with the maximum frequency and its index.

• Return the number with the maximum frequency and the lowest index.

Find the next smaller element for each element in an array.

• Iterate through the array from right to left and use a stack to keep track of elements.

• Pop elements from the stack until a smaller element is found or the stack is empty.

• If a smaller element is found, that is the next smaller element. If the stack is empty, there is no smaller element.

The problem is to color a graph with two colors such that no two connected vertices have the same color.

• Use a graph coloring algorithm such as Depth First Search (DFS) or Breadth First Search (BFS).

• Start with an arbitrary vertex and color it with one color (e.g., blue).

• Color all its adjacent vertices with the other color (e.g., red).

• Continue this process for all connected components of the graph.

• If at any point, you encounter two adjacent vertices with the same color, it is n...read more