No intro/behavioral questions asked.

45 minutes total

Questions I got asked:

(1) Given a calendar with working days and holidays and defined number of vacations/PTO you can take. Find how can you plan your PTO so that you get maximum number of days as vacation, and return maximun number of vacation days.

(2) Lowest Common Ancestor of a Binary Tree (where you cannot access the parent from a node)

I solved both did a dry run on the first and was asked time complexity for it. Got a solution for the second one but I needed some hints from the interviewer :(, I was not asked time complexity for the second one

Given 5 minutes for questions at the end