Phone interview:
2 coding questions - Valid anagrams and Max path sum in a binary tree.
Onsite virtual interview:
Round 1:
Lowest common ancestor in a binary tree and Word Square
Round 2:
Expand characters within parentheses in a string:
E.g.: 3[a]2[b] = “aaabb”
3[a2[b]] = “abbabbabb

Question

Phone interview:
2 coding questions - Valid anagrams and Max path sum in a binary tree.
Onsite virtual interview:
Round 1: 
Lowest common ancestor in a binary tree and Word Square 
Round 2:
Expand characters within parentheses  in  a string: 
E.g.: 3[a]2[b] = “aaabb”
3[a2[b]] = “abbabbabb

Bloomberg

Bloomberg Interview Question

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches