Online test first and then phone interview. In the phone interview, I was asked a very easy question: binary search to find the rightmost index of the target value...... This is really f u c k ing simple enough. I solved it first using the worst time complexity linearly first. The interview seemed unsatisfied. She asked me to revised it into using reversion. I told her that my function doesn't support recursion.... she said, that is fine. you can just write it..... erh.... I revised my function and start coding recursion, But the time is not enough.... I thought maybe she is Chinese as well. Can let me pass. Worst time complexity O(n) is acceptable by leetcode, it should be fine..... rejection letter at the second day.... erh, Good luck with yours!
狗仔卡
提升卡
置顶卡
关贴卡
开贴卡
变色卡
千斤顶
