The first round was a coding interview. I was given a graph-related problem involving ACL inheritance. There were a set of nodes and edges representing inheritance relationships, along with allow and deny permission lists. The task was to determine the final effective permissions for each node after considering inheritance.

The second round was another coding interview involving an N-ary tree. I was first asked to compute the maximum depth of the tree. The follow-up was to delete the minimum number of nodes so that the resulting tree had a maximum depth of at most k.

Given a set of nodes and edges. Connected nodes have an inheritance relationship. Two ACL lists are provided: Allow and Deny permissions. Permissions can propagate through the inheritance edges. Compute the final effective permissions for every node after inheritance.