Problem About Interns and Flats Using a Greedy Approach
This problem involves assigning interns to flats using a greedy algorithm. The goal is to optimize the allocation based on certain criteria, such as minimizing the distance between interns and their assigned flats or maximizing the satisfaction of the interns with their assignments. The problem requires a strategic approach to ensure the best possible outcome given the constraints.
Asked at:
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
Late January, 2025
Junior
Problem about interns and flats using a greedy approach
Mid September, 2024
Junior
Assign interns to apartments based on their preferences for shared or single-occupancy units, given limited availability of each type.
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.