Question d’entretien chez Meta
They asked me Largest histogram problem .
Réponse à la question d'entretien
Utilisateur anonyme
7 sept. 2017
I started with the naive algorithm O(n^2) and then improved it to O(n log(n)) and after the interviewer asked me to improve more I finally improved it to O(n).