-
Notifications
You must be signed in to change notification settings - Fork 13
Interview Experience 137
Chetan Garg edited this page Aug 20, 2018
·
1 revision
Round 1 - pen paper
- Sort the array in wave form arr[0] >= arr[1] <= arr[2] ...
- Find min number whose product equals the given number. ex. Input 56, output: 78
- Given a matrix with 0(zero in some cell) replace that row and column with 0 and you should not consider replaced zero for further replacement. (no extra space) complexity must be minimum. 29 got selected after this round
Round 2 - F2F
- Find magic index (index value == element value) having best case < O(n). Given Array is sorted, repetition is allowed and also -ve numbers.
- Give two string and need to find that in 3rd string ex. facd, fed with facfded
- Replace each element in BST with sum of elements greater than or equal to its value. 15 got selected for next round They mainly judge your thought process.
Round 3 - F2F
- Find min missing positive number in the given unsorted array. ex. arr = [-5, -2, 0, 5, 2, 9] output: 1
- Given two sorted matrix, find all pairs (x, y) such that x from 1st matrix and y from 2nd matrix as x+y = given value k. keep in mind about the complexity. Few Questions about My home state, political system and light conversation.
Round 4 - HR
Started with cliche question, Introduce yourself. Then they asked detail about family members. Interests other than coding. Why should I hire you? Why this company. Your expectation. Typical HR.