Dream11 Senior Software Engineer Interview Questions and Answers

Identify data structure based on insertion and deletion order

• If insertion and deletion follow LIFO order, it is a stack

• If insertion follows FIFO order and deletion follows LIFO order, it is a queue

• If insertion and deletion follow priority order, it is a priority queue

Find maximum element in an array in less than O(N)

• Use divide and conquer approach

• Compare maximum of left and right subarrays

• Recursively find maximum element

To find the right view of a binary tree, we need to traverse the tree and keep track of the rightmost node at each level.

• Traverse the tree using level order traversal

• At each level, keep track of the rightmost node

• Add the rightmost node to the result array

• Return the result array

Find two missing numbers from an unsorted array in O(n) time complexity.

• Calculate the sum of all numbers from 1 to n using the formula n*(n+1)/2

• Calculate the sum of all numbers in the given array

• Subtract the sum of array from the sum of all numbers to get the sum of missing numbers

• Use the sum of missing numbers and the sum of squares of all numbers from 1 to n to calculate the missing numbers using simultaneous equatio

To find average salary without disclosing any one salary

• Collect salaries of all employees

• Add all salaries and divide by total number of employees

• Do not disclose any individual salary

Divide a golden brick into minimum parts to pay daily salary to a worker.

• The number of parts needed will depend on the daily salary of the worker.

• The size of the parts should be equal.

• The parts should be small enough to cover the daily salary but large enough to minimize the number of parts.

• The formula to calculate the number of parts is: number of parts = total value of the golden brick / daily salary