Domanda di colloquio di Bloomberg

Modify deepcopy method to work with Linked List having random pointers. (https://leetcode.com/problems/copy-list-with-random-pointer/description/)

Risposta di colloquio

Anonimo

21 ott 2017

Provided a two pass algorithm with pair of vectors as data structure, O(n^2). When asked to optimize changed data structure to map, O(n.logn).