|
|
|
|
|
by yongjik
1740 days ago
|
|
The tweet comes up every so often, but it has two problems: (1) Most of Google's engineers didn't even know Homebrew - it just wasn't something Google used on its notebooks. (2) There's no such thing as "inverting a binary tree." At least I haven't heard about it anywhere else. Maybe Google's interview process is broken, but the tweet isn't really explaining much. It's just a nice soundbite. |
|
It’s actually pretty easy if you’re comfortable with recursion and traversing trees. The tree questions Google asks in its interviews are usually much harder- it implies they were giving softball questions to him.