In our season finale, we're wrapping up our sorting algorithm classifications with two final categories: recursive vs. non-recursive and comparison vs. non-comparison. And we throw in some tomatoes, just for good measure.
What do you do when you're in a hash table, and two pieces of data get assigned the same spot?! You've got a collision, and you need a resolution! We dig into one strategy to resolve a collision, and make sure each data has a spot.
We dive into depth-first search by exploring our first of three strategies: preorder! Let's walk through an example step-by-step and get to know members of Saron's fictitious tree family along the way.
Where do we see queues in real life? We explore how queues are used in different parts of the tech stack, and help us do things like send email, create animations, and manage requests. A huge thank you to Twilio for sponsoring this season of the show!
What's in a queue? And how does it relate to stacks? We explore what they do, how they work, and how to implement them. Based on Vaidehi Joshi's blog post, "To Queue or Not to Queue". A huge thank you to Twilio for sponsoring this season of the show!
Where do you see stacks in real life? We look at how browser histories, call stacks, and undo/redo functionality in blogging are implementations of a stack. We also dig into what exactly a stack is made of and how it operates.
Big O Notation can be scary. But it doesn't have to be! We unpack this popular cs topic and show you how to use it to evaluate different data structures (like linked lists!) and make better programming decisions.
You may be familiar with arrays and hashes and variables, but how much do you know about linked lists? We dig into what they are, how they work, and the pros and cons of using this popular data structure.
We give you a beginner-friendly breakdown of how to count in binary (with some fun counting challenges you can join in on!), how it relates to bits and bytes, and why it's important for us to know as developers.