I had a google phone screen Round 2. They asked these questions:
- Find the minimum/maximum in unsorted list
- Design a a game child play to eliminate one which is not similar. Eg. cat, dog, mouse, tree- need to return Tree
O(n)
O(nnc) - c for checking if i and j element are related.
Please let me know how do you guys solve this?
No luck this time, will prepare better for next.
Comments (4)