Pergunta de entrevista da empresa Hivestack
They asks some basic questions about data structures and big-O notation of several algorithms.
Resposta da entrevista
Sigiloso
29 de jan. de 2020
I describes the working of a LinkedList. Explanation of a merge-sort with big-O complexity = O(nLogn)
1