- online assessment:\ntwo problems on hackerrank. they are not the problems listed in this community. one is easy. the other one is medium / hard. finish in 30 mins.\n\n- phone screen:\n30 mins LP\none LC easy.\n\n- loop:\nround 1: 30 mins LP. one LC easy. some follow ups about how to implement hash table and handle hash collision.\nround 2: 30 mins LP. a new style of coding interview. interviewer keeps adding new requirments and you need to implement the code. pay attentation to distributed system and design pattern.\nround 3: 30 mins LP. system design.\nround 4: 30 mins LP. one LC easy. indeed why java guys in australia love heap a lot? i met heap problem in every round. but i don\'t have built-in heap in c#. so i have to explain LINQ and why i don\'t use heap + heap time complexity again and again. graph, n-ary tree, dp problems should be more interesting, isn\'t it? LOL\n\nwhy getting rejected? LP! i didn\'t prepare LP very seriously. i use the same \'story\' to cover several different LPs. recuriter\'s feedback is \'lacking of data\' to support some LPs. i have to say AMZN guys really believe in their \'LPs\' as a religion?! :) it\'s my first time to get a rejection due to kinda of behavior questions.... hmmm, interesting.\n\nsome experience here. hope it could be helpful for people who is preparing for <strike>FA</strike>A<strike>N</strike>G+MSFT in australia. good luck.

online assessment:\ntwo problems on hackerrank. they are not the problems listed in this community. one is easy. the other one is medium / hard. finish in 30 mi