Pergunta de entrevista da empresa Affirm
Q: Given a list of strings, find the smallest unique substring for each string.
Resposta da entrevista
Sigiloso
6 de mar. de 2020
Worst case was around O(n^4). We spoke about using modified tries and talked about using a rolling hash (Rabin Karp algorithm).