SDE - 1

Given two Binary Search Trees, your task is to return a list of integers which contains the values that are present in both the Binary Search Trees.

For example:

If the binary search trees look like the ones below:

The only common values are 6 and 7, therefore we return the list [6, 7].

Given that integers are read from a data stream. Your task is to find the median of the elements read so far.

Median is the middle value in an ordered integer list. If the size of the list is even there is no middle value. So the median is the floor of the average of the two middle values.

For example :

[2,3,4] - median is 3.
[2,3] - median is floor((2+3)/2) = 2.

You are given a positive integer ‘N’. Your task is to find the total number of ‘1’ in the binary representation of all the numbers from 1 to N.

Since the count of ‘1’ can be huge, you are required to return it modulo 1e9+7.

Note:

Do not print anything, just return the number of set bits in the binary representation of all integers between 1 and ‘N’.

Design Rate limiter

Given two tables, need to normalise the tables so that data duplication is not done