微软上门挂经

4 轮各45分钟.
每轮有5-10 分钟BQ

没考系统设计

第一轮:
LC 189. Rotate an array x times. Do this in place.

第二轮:
LC 28. Basic string matching question - implement strStr()
LC 134 Gas Station problem

第三轮:
LC 959变种: Pancake sorting. Not the exact same question, but highly similar.

第四轮:
Binary Tree Iterator design
LC 116 Populating Next Right Pointers in Each Node

gas station problem 没答好,别的都挺简单