Earlier quoted context omitted.
In the aftermath of the Damore affair, one thing that came to light was that Google managers operate private blacklists, which they attempt to spread beyond Google to make people unemployable, and that they are so unafraid of HR that they openly brag about it. It sounds like some pretty toxic behaviours are tolerated there, among management if not among the engineers...
source?
Max Howell's take on getting rejected by Google
21–30 of 73 posts
Re: Max Howell's take on getting rejected by Google
#22Re: Max Howell's take on getting rejected by Google
#23This is well written. The tweet was well written. And brew, well, yah, well written. Thanks Max for making the missing package manager for macOS. I use it, I taught my kids to use it and will probably keep using it for the next decade. Thanks! And Google? Who cares about google. It is Apple that should have hired Max. Years ago. For making their product better.
Missing?
Macports was there before homebrew, is managed properly, and just works.
Re: Max Howell's take on getting rejected by Google
#24Isn't inverting a binary tree just this? (That's what some people seem to think, when I search for the problem.) 1> (defun invert (tree) (if (atom tree) tree (list (invert (cadr tree)) (invert (car tree))))) invert 2> (invert '(((1 2) (3 4)) ((5 6) (7 8)))) (((8 7) (6 5)) ((4 3) (2 1))) Here I modeled the binary tree using two-element lists as the nodes (thus using two cons cells where one would do) for the sake of p…
Yes, I think it is just recursively swapping the left and right branches of the tree.
Re: Max Howell's take on getting rejected by Google
#25Isn't inverting a binary tree just this? (That's what some people seem to think, when I search for the problem.) 1> (defun invert (tree) (if (atom tree) tree (list (invert (cadr tree)) (invert (car tree))))) invert 2> (invert '(((1 2) (3 4)) ((5 6) (7 8)))) (((8 7) (6 5)) ((4 3) (2 1))) Here I modeled the binary tree using two-element lists as the nodes (thus using two cons cells where one would do) for the sake of p…
I would have written the same. I have no idea what Google understands by "inverting a binary tree", but to me it looks this. "Recursively swap left with right."
Now just convert that to an inferior language, like java or python, so they can understand it.
Re: Max Howell's take on getting rejected by Google
#26my software was insanely successful. Why is that? Well the answer is not in the realm of computer science. I have always had a user-experience focus to my software. Homebrew cares about the user. When things go wrong with Homebrew it tries as hard as it can to tell you why, it searches GitHub for similar issues and points you to them. It cares about *you*. I love that he calls out Homebrew not being a technical marve…
I wholeheartedly agree. If there is one thing I'd like Google to change is to think about and care for their users.
Re: Max Howell's take on getting rejected by Google
#27Isn't inverting a binary tree just this? (That's what some people seem to think, when I search for the problem.) 1> (defun invert (tree) (if (atom tree) tree (list (invert (cadr tree)) (invert (car tree))))) invert 2> (invert '(((1 2) (3 4)) ((5 6) (7 8)))) (((8 7) (6 5)) ((4 3) (2 1))) Here I modeled the binary tree using two-element lists as the nodes (thus using two cons cells where one would do) for the sake of p…
I would have written the same. I have no idea what Google understands by "inverting a binary tree", but to me it looks this. "Recursively swap left with right." Now just convert that to an inferior language, like java or python, so they can understand it.
I mean, I suppose I'd be happier with Racket?
Bonus points for building a #lang for expressing trees and operations on them.
(note: this probably wouldn't actually get you bonus points, and might result in my wildly gesticulating to get your attention to try to drag you back to the actual interview)
Re: Max Howell's take on getting rejected by Google
#28Re: Max Howell's take on getting rejected by Google
#29TL;DR
>I wasn’t very clear what a binary tree was
Re: Max Howell's take on getting rejected by Google
#30He just got unlucky. It's always luck of the draw with job interviews. Just like those poker players that say they should have won the hand.
I'd like to try this in an interview: how would you re-root a binary tree such that the ordering of the elements remains the same, but the root node of the tree changes.