Question d’entretien chez Microsoft
Longest increasing sequence from leetcode
Réponse à la question d'entretien
Utilisateur anonyme
3 avr. 2023
I tried brute force approach, the interviewer expected disjoint-set union-find algorithm but I missed the mark completely