Derived from 1 submission for ALL. Format details may vary across different teams or locations.
The candidate went through two casual phone interviews for algorithm positions at Alibaba's Seattle base. The interviews focused on explaining algorithmic logic and derivations without any coding component. The overall experience was interactive and required clear verbal communication of complex ideas.
The first phone interview was casual and focused on explaining the logic behind solving algorithmic problems without any coding platform. The candidate was asked to explain the solution for two problems in detail.
Median of Two Sorted Arrays (required O(log min(m,n)) solution. Had to explain the cut k recursive method.
How to balance a heap. And how heap elements are aligned (2n+1, 2n+2).
The second phone interview followed a similar format to the first, with a focus on explaining the logic behind solving two algorithmic problems. The second question was particularly challenging to explain verbally, requiring the candidate to derive and explain the DP function.
Arithmetic Slices
Arithmetic Slices II
InterviewDigest