Question d’entretien chez Snap

Solve this impossible leetcode hard problem that involves figuring out an alogrithms that can crack any RSA encryption in O(1) time. All jokes aside, it was a question about topological sorting. You have to find manager and employees given a list of their names and ids and print them out in a pyramid sideway pyramid.