Available question text
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.
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
- 0/1 Knapsack Problem with Time Complexity Optimization
Coding
- A question around around array and number and SQL about counting employee salary and showing them in descending order
Coding
- about your self coding questions framework questions
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
Google
Problem About Interns and Flats Using a Greedy Approach
Interview reported: Jan 26, 2025 · 1 source report
JUNIOR
Source snapshot: Nov 12, 2026
View source