A recruiter contacted me on LinkedIn and asked if I would like to interview for Facebook London.

Unfortunately, I couldn't clear the first round. The recruiter was very professional and shared clear feedback within two days, explaining the reason for my rejection.

I had to solve two questions in 35 minutes.

As I hadn't practiced well, I struggled with syntax and language and couldn't provide an optimized solution for the first question.

First Question: Print all combinations from the dictionary which will result in number N.

Input: Dictionary: { "flag":4.5, "temp":2 ,"foo":9} N: 11

Output: "Flag"*2 + "temp"*1 "Foo"*1 + "temp"*1

Second Question: Return a list of root-to-leaf sums (in left-to-right order) from the given tree.

Input: 1 /
2 3 /
4 5

Output: [7, 8, 4]