Question d’entretien chez Front
flatten the array, given a large file find out topK elements. Write code for these problems.
Réponse à la question d'entretien
Utilisateur anonyme
23 janv. 2019
I answered correctly with best time complexity. 1: Using recursion. It was pretty easy 2; Using min heap