Cracking the Code Interview

CS interviews are a different breed from other interviews and, as such, require specialized skills and techniques. This talk will teach you how to prepare for coding interviews, what top companies like Google, Amazon, and Microsoft really look for, and how to tackle the toughest programming and algorithm problems. This is not a fluffy be-your-best talk; it is deeply technical and will discuss specific algorithm and data structure topics.

[gordonduan]

Excellent video. Learned a lot from it.

[bradleyberthold]

Maybe this isn't the correct solution to the Random BSP node return, but I would first count the items in the tree, than just do a random number from that range as "item (x)", then do a breadth-first search, and on item (x) exit the search loop. Bam, random node.

[JoeWong]

Thank you for the informative video Gayle!!

[greyreynyn]

28:44 i dont think the server thing is as good a hint as you think.. It seems like a general case optimization to use a hash table.

[greyreynyn]

5:55 lol yeah right being interview ready in a day with all of these?

[Cenotph]

9:15 slide, those are not concepts! Big O Time, Space are side effects from those operations. The concepts are actualy what they entail. What is it that ArrayLists or Hash Tables do? The fundamental nature of these operations. Again, knowing the complexity is not essential at all. I can review these at anytime because I know the concept