Leet Code :-

Easy 131
Medium 188
Hard 31

Amazon :- [ OCT 2020]

1. OA asssement cleared
2. First round :- a question on tree traversal and a question on next pallindome in string. I was not able to solve second one due to only 10 minutes left.
3. Second Round:- deliver packaets in minimum time , print subsequence with distinct characters after each character in an array. I was able to come up an approach for both questions but wasn't able to write code as i feel i have max 30 min for first and 10 min for second question.
4. third round :- a question on finding max possible cominations with given set of data on frequency. I was able to seolve questions but was not able to handle corner cases in the code.
5. fourth round:- design parking lot . I nailed this round with all the questions.

Result :- No offer

Microsoft [ DEC 2020 ]

first round :-

1. given an array with 1, 0 , 2 sort based upon order in 0(N)
2. invert binary tree
3. one more question on Array medium level.

solved all and nailed this round.

second round:-

Shuffle Odd-Even array elements to Odd-Even indices
find closest distance between two words given a set of strings

nailed this round , however my solution was not optimal.

third round:-

Design LFU
lot of questions on design stratedy and nailed this round as well by this time i was thinking to clear it.

fourth round:-

Design snake and ladder
this is the first time i was explaining low level design in any interview. Although my aproach was great but still was not able to convince the interviewer.
shortest subsequence pallindrome in a string ( able to solve this one)

Result :- Rejected , i don't know where i it went wrong may be last round where i didn't followed structured way of solving oops problem.

ARCESIUM :- [ DECEMBER]

OA:- was easy , i had to develop a component in two hour frame.
first round:- techical screening round touching all topics
second round:- was asked to design rate limiter. I told all the approaches however interviewer was not confinced on memory part.
third round:- search an element in an array with O(logn) complexity. I tried my best to design AVL tree but nnot able to complete it.
fourth round:- Design Messenger app. I was able to solve and explain the solution and interviewer was happy however didn't clarify requirements before the design which changed scope of the problem.

result:- rejected , from interview point of view i have given my best but since AVL tree i never thought someone will ask in interview i never practices. instead of AVL i can try for any balanced tree but still i don't know how to solve within hour.

MICROSOFT [ JANUARY]

this time i got two dp problems in first round which were kind of easy but since i didn't encountered them earlier faced difficulty to solve. Simply got rejected after this round.

Last 4 months were very hard for me in starting from basics to completing 350 problems of various type. I work with fintech company with 7 year of experience finding very hard to get time of atleaset 1-2 hour after office. I tried very hard to solve almost all daily challenges and most famous problem but still not able to get into it. Subscribe leetcode premium this month.

Do we need to really put so much effort ? It is very hard to study with family and kids. I almost neglected everything in last 4 month just in a hope of getting into FAANG but from experience point of view i can understand, if we know the problem before hand then its really easy to show the talent but if the problem is new then I think no one can solve two medium problems with in an hour. If you are on my path please guide.

EDIT :-

now going for an startup :) leaving a thought of FAANG really helped in my journey.