How I went from failing every interview to a job at Amazon

Re:How I went from failing every interview to a job at Amazon by fragmede on Sunday April 30, 2017 @08:19PM (#14234691)

Of course there's some sort of B-tree somewhere in the stack; that's not the question.

With dozens of database stacks to choose from, many companies won't have anybody actively and regularly working in the database's code, nor in the OS kernel code either.

If, then, an individual can successfully contribute to the company without ever hearing of a red-black tree, what's the value in testing for it, past "this is how we've always done it"?

(How long it would take someone who doesn't know CS lingo to string together "tree" and "balance" and plug that into Google, I don't know, but I suspect it's not impossible to find.)

[ Parent | on HN ]

Re:How I went from failing every interview to a job at Amazon by yazaddaruvala on Monday May 01, 2017 @02:55AM (#14236022)

> Of course there's some sort of B-tree somewhere in the stack; that's not the question.

You've misunderstood me. I'm literally talking about building a distributed B-Tree or Heap. As in, a Heap which cannot fit in memory or storage of any one node.

Think: S3/DynamoDB is a distributed, highly available HashTable; _____ is a distributed, highly available Heap.

[ Parent | on HN ]