Quant Research Intern

You have been given an integer ‘N’. You are supposed to find the number of all possible strings of length ‘N’ where each character of the string is either ‘R’, ‘B’ or ‘G’. In the final string, there must be at least ‘r’ characters of ‘R, at least ‘b’ characters of ‘B’ and at least ‘g’ characters of ‘G’.

You are given an undirected graph with ‘N’ vertices and ‘M’ edges. Each edge has a particular type as described below:

An edge with type 1 can only be traversed by a person ‘A’.

An edge with type 2 can only be traversed by a person ‘B’.

An edge with type 3 can be traversed by both persons ‘A’ and ‘B’.

Your task is to determine the maximum number of edges that can be removed such that after removing these edges, all the nodes can still be traversed by both ‘A’ and ‘B’.

Explain Moment generating function and kurtosis

Expected number of tosses to get n heads variation

Monte hall problem with 2 doors opened out of 4 doors variation