Google onsite Interview (Software Engineer)
Total 5 rounds:
Round 1:
Behavioral round (testing of googlyness)
Round 2:
Technical (Implement Print function in Python)
Round 3:
Given decreasing and agian increasing series return index of min element. For example:
Input: [9, 8, 7, 0, 4, 5, 6]
Output: 3
Round 4:
Create an API interface for testing team which returns the API test cases based on the % assigned to it
[type A, 0.5,
type B, 0.2,
type c , 0.2
type D, 0.1]
Round 5:
Return random node of given binary tree. Similar question:
https://leetcode.com/problems/linked-list-random-node