Bloomberg L.P 实习店面

Job Hunting Interview
, , , , ,
1

CS小硕

先是 Exchange of Introduction and current projects/job. 然后上题

  1. https://leetcode.com/problems/palindrome-number/ - O(N) to O(log N) complexity.
  2. https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/

最后是 Q & A