Sureify Labs Technology Sde1 Interview Questions and Answers

Merge sort is a divide-and-conquer algorithm that recursively divides an array into two halves, sorts them, and then merges them.

• Divide the array into two halves

• Recursively sort each half

• Merge the sorted halves

Find the product of all elements in the array except that element in linear time.

• Initialize a result array with the same length as the input array

• Calculate the product of all elements to the left of each element and store it in the result array

• Calculate the product of all elements to the right of each element and multiply it with the corresponding element in the result array

• Return the result array