Domanda di colloquio di Hivestack
They asks some basic questions about data structures and big-O notation of several algorithms.
Risposta di colloquio
Anonimo
29 gen 2020
I describes the working of a LinkedList. Explanation of a merge-sort with big-O complexity = O(nLogn)
1