Available question text
Given a list of manager→employee relationships and a target manager, return all employees who directly or indirectly report to that manager. Build the org graph and perform a DFS/BFS from the manager to collect all reachable subordinates across multiple levels while avoiding revisiting nodes.
Related questions
Continue with questions that share topics or the same question type.
- 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.
Coding
- Coding test: Given a simple mockup implement that UI. Some CSS is already provided and an API to fetch the data also exists. The recruiter prep doc talked about structuring the code well, making sure all functions work, write CSS and write tests. There is no way you can do it all in 1 hour, so it's probably best to ask the interviewer what they expect
Coding
- Count Unique Characters of All Substrings of a Given String
Coding
- Find All People With Secret
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Amazon
Leetcode 1270. All People Report to the Given Manager
Reported Dec 11, 2024 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source