Domanda di colloquio di Microsoft

Longest increasing sequence from leetcode

Risposta di colloquio

Anonimo

3 apr 2023

I tried brute force approach, the interviewer expected disjoint-set union-find algorithm but I missed the mark completely