Company Hierarchy Tree - OOD Coding Interview

Question

## Problem

Design a `CompanyHierarchy` class representing an org chart. Each employee has an `emp_id`, `name`, `salary`, and at most one manager.

```python
class CompanyHierarchy:
    def add_employee(self, emp_id: int, name: str, salary: int, manager_id: int | None) -> None: ...
    def remove_employee(self, emp_id: int) -> None:  # re-parent direct reports to removed employee's manager
        ...
    def get_reports(self, emp_id: int, direct_only: bool = True) -> list[int]: ...
    def total_salary_under(self, emp_id: int) -> int: ...  # sum salaries of entire subtree
    def path_to_ceo(self, emp_id: int) -> list[int]: ...  # emp_id up to root, inclusive
```

**Example:**
```
ch = CompanyHierarchy()
ch.add_employee(1, "CEO", 500000, None)
ch.add_employee(2, "VP", 200000, 1)
ch.add_employee(3, "Eng", 150000, 2)
ch.total_salary_under(1)  -> 850000
ch.path_to_ceo(3)         -> [3, 2, 1]
ch.remove_employee(2)
ch.path_to_ceo(3)         -> [3, 1]
```

## Follow-ups
- What is the time complexity of `total_salary_under` without caching? How would you cache it?
- How do you detect if adding an employee would create a cycle?
- Extend to support temporary "acting" manager assignments without modifying the permanent tree.

Company Hierarchy Tree - OOD Coding Interview

Question Details

Full Details

Topics

More from Atlassian