YOE - 3

Round 1:

1. Left view of binary tree (easy)
2. Find highest and lower peak points in array of interger.(medium), & follow-up questions.

Round 2:

1. Java multithreading, Generics questions.
2. Project specific questions.
3. Give two linkedlist where each node represents digit. perform division of LL1/LL2 and store it into LinkedList as result. Values are large enough that is does not fit into any datatype and was not allowed to use BigInteger as well. (Hard)

For Example: LL1 = 1 -> 2 -> 3 -> 4 -> null LL2 = 3 -> 5-> null
Result = 3 -> 5 -> . -> 2 -> 5 - > null

(1234/35) -> 35.25
				  

Round 3: Managerial round.

1. Basic behavioural questions.

Overall Experience: Overall experience was very bad, not because I am rejected but interviewers seems not preparered well. I was asked to solve hard problem in 20 min. (and you know what I didn't solve it)

Anyway - Bad interviewers rejects good candidates ;)