Interview Cake. The Intuitive Guide to Data Structures and Algorithms

Amazon Digital Services LLC., 2018. — 141 p. — ASIN B07FDLH599.This is not a freaking textbook. No confusing academic jargon. No long lists of properties to memorize. No proofs. Because that stuff doesn’t help you actually get it.
Here’s what does: Learning what to picture in your head when you think of a dynamic array or a hash map. Learning how to think in algorithms. That’s what this guide is focused on - giving you a visual, intuitive sense for how data structures and algorithms actually work.
So if you’ve got a big coding interview coming up, or you never learned data structures and algorithms in school, or you did but you’re kinda hazy on how some of this stuff fits together... This guide will fill in the gaps in your knowledge and make you say, "Oooh, that’s how that works."
We’ll walk you through it all, step by step. Starting from the beginning.
This illustrated introduction to algorithms is brought to you by Interview Cake, the best way to prepare for your technical coding interviews. Here's what some of our users have to say:
"It feels very surreal that I did well on a Google interview. Your website taught me more about algorithms (and in a way that I retained the information) than any boring college class. Thank you *so much* for making Computer Science fun again." - Rabeea (got the job at Google)
"I wish I had known about this website back when I was in algorithms class in college. This made me finally understand concepts that had eluded me for years." - Luna (got the job at Google)
"They just called and told me I passed! The interviewer was very impressed by my algorithms and data structures knowledge and it was all thanks to your website." - Maria (got the job at Amazon)Big O Notation
The idea behind big O notation
Some examples
N could be the actual input, or the size of the input
Drop the constants
Drop the less significant terms
We're usually talking about the "worst case"
Space complexity: the final frontier
Big O analysis is awesome except when it's not
Data Structures for Coding Interviews
Computer science in plain English
Random Access Memory (RAM)
Binary numbers
Fixed-width integers
Arrays
Strings
Pointers
Dynamic arrays
Linked lists
Hash tablesLogarithms
What logarithm even means
What logarithms are used for
Logarithm rules
Where logs come up in algorithms and interviews
Logarithms in binary search
Logarithms in sorting
Logarithms in binary trees
Conventions with bases