Digests » 218
Barcelona, 4-8 Sept. 2017 – Are you a curious mind? Full Sack Fest is a week-long conference based in the amazing city of Barcelona that peeks into the web of tomorrow. Serverless, Blockchain, WebVR, Distributed Web, Progressive Web Apps... Come and see! Early bird tickets available with a 10% discount using the code DIGEST.
With trade volumes reaching billions of dollars a day and market caps hitting tens of billions of dollars, it’s no wonder that cryptocurrencies fuel the gold rush of the modern day.
We do a lot of interviewing at Triplebyte. Indeed, over the last 2 years, I've interviewed just over 900 engineers. Whether this was a good use of my time can be debated! (I sometimes wake up in a cold sweat and doubt it.) But regardless, our goal is to improve how engineers are hired. To that end, we run background-blind interviews, looking at coding skills, not credentials or resumes.
This is the story of GreenPiThumb: a gardening bot that automatically waters houseplants, but also sometimes kills them.
A Trie (pronounced "try") is a tree data structure that is used to store Strings. It's generally used to search and store by prefix, which is why it is also known as a "prefix tree." Tries can often come up in software engineering interviews, however they aren't generally taught in a typical Data Structures course. Like all data structures, they're often better understood by interacting with them.
A Hash Table is a common data structure used in many modern day Software applications. It provides a dictionary-like functionality, giving you the ability to perform opertations such as inserting, removing and deleting items inside it. Let’s just say I want to find what the definition of what “Apple” is, and I know the defintion is stored in my defined Hash Table. I will query my Hash Table to give me a defintion. The entry inside my Hash Table might look something like this "Apple" => "A green fruit of fruity goodness". So, “Apple” is my key and “A green fruit of fruity goodness” is my associated value.