Interview Experience 140(Intern)

2018

Summer Analyst (Tech division)

Round 1 - Technical

1. The interviewer saw my CP profile and asked me about the hardest problem which I've solved. Then she asked me the approach to solve that problem. She seemed satisfied with my approach.
2. Question based on graph traversal. (bfs/dfs)
3. Question based on modification of binary search.

Round 2 - Technical + HR

1. Loop in a linked list.
2. There is an array A of size N with elements from 1 to N, out of which 1 element is missing and 1 element is repeated. Find the indices of repeated element and also report the missing element in O(n) time. Modification of array elements is not allowed.
3. Puzzle on Bayes theorem. (probability)
4. A few questions of HR based on different situations.