Appleseniorset. de 2025
A question very similar to Leetcode 855 Exam Room.
Manage an exam room of n seats where seat() places the next student at the index that maximizes the distance to the nearest occupied seat (ties broken by smallest index) and leave(p) frees a seat. The challenge is to design a data structure—typically interval tracking with a max-heap and ordered set—to pick and merge the largest empty segments efficiently for up to 10^4 operations with n up to 10^9.
Use esses exemplos para entender em que contexto ela costuma cair e adaptar sua prática.
A question very similar to Leetcode 855 Exam Room.
Nenhum anexo público associado a esta pergunta.
No app você encontra perguntas parecidas, compara empresas e aprofunda essa busca com mais filtros.