Meta screening

Screening Round

Questions:

1. Given two lists, A and B where length of both lists is the same, find the minimum sum of A[i] + B[j] such that j >= i. 0 < A[i], B[j].
2. Lowest Common Ancestor of a Binary Tree - same problem with the condition that the root is not given but nodes have pointers to their parent instead of children.