Audience
Coding Challenge platform for individuals
About Interview Cake
The programming interview is a winnable game. I'll show you the tricks to quickly solve problems you've never seen before. I'll teach you the right way of thinking for breaking down tricky algorithmic coding interview questions you've never seen before. No prior computer science training is necessary — I'll get you up to speed quickly, skipping all the overly academic stuff. Big O notation is the language we use for talking about how long an algorithm takes to run. It's how we compare the efficiency of different approaches to a problem. It's like math except it's an awesome, not-boring kind of math where you get to wave your hands through the details and just focus on what's basically happening. With big O notation, we express the runtime in terms of—brace yourself—how quickly it grows relative to the input, as the input gets arbitrarily large.