- #美国面经
- #码农类general
- #面试经验
Google onsite 面经

21989
去年11月面的Google,感觉题没有想象中难,但是要答好不容易。不多废话,上面经如下:
1. how to check a string is a palindrome? then expan
本帖隐藏的内容需要积分高于 188 才可浏览,点击前往一亩三分地论坛阅读。
]5. bit manipulation. forgot what's the question exactly. (估计跪在这轮。对bit manipulation一直不是很好)
6. previous project deep dive. validate binary search tree in both iteration and recursion ways.
1. how to check a string is a palindrome? then expan
本帖隐藏的内容需要积分高于 188 才可浏览,点击前往一亩三分地论坛阅读。
]5. bit manipulation. forgot what's the question exactly. (估计跪在这轮。对bit manipulation一直不是很好)
6. previous project deep dive. validate binary search tree in both iteration and recursion ways.
9条回复
热度排序