Challenge: Dynamic Programming

Explore how to apply dynamic programming to create an optimal guest list for a company party under hierarchy constraints. Learn to use recursion and tree traversal to maximize the total 'fun' score while ensuring supervisors and subordinates do not attend together. Implement the solution step-by-step in C++ and enhance your problem-solving skills.