Algorithms: Write an algorithm to list elements of a Fibonacci series; There are two unsorted arrays (with no repeating elements) – find the median of the combined array (use a 3rd array if you wish). Find the median of the combined array without using a 3rd array (basically trying to find a memory efficient algo).

Question

Accepted Answer

Algorithm to list Fibonacci series and find median of combined array with and without 3rd array

For Fibonacci series, start with 0 and 1, then add previous two numbers to get next number
For finding median of combined array, merge the two arrays and sort them, then find the middle element(s)
For finding median without 3rd array, use two pointers to traverse both arrays simultaneously and keep track of previous and current elements

Top Directi Product Manager interview questions & answers

Popular interview questions of Product Manager