Haven’t seen any VMWare questions here so thought I’d share them in case anyone is interviewing soon:
-How do you work with a binary search tree level order iterator?
-What are your values in System Designing? Explain sharding and networks.
-Given string array of “a+b-c=10”, “b+2c=15”, “a+b+c=13”, what do a, b, and c equal?
-Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero. Note: The solution set must not contain duplicate triplets.
-Given a binary tree, return the zigzag level order traversal of its nodes’ values. (ie, from left to right, then right to left for the next level and alternate between).
For example:
Given binary tree [3,9,20,null,null,15,7],
3
/
9 20
/
15 7
return its zigzag level order traversal as:
[
[3],
[20,9],
[15,7]
]