It’s been a wild week. You and your team have been engaged in an all-out war with the codebase for the past two sprints. There’s this new integration with a partner that’s close to being shipped, and it promises bountiful revenue and voluminous web traffic. …

I’ve had a few friends recently ask me about breaking into the software industry. Most have been looking for advice on getting a developer job at a consumer-facing web/internet company — though places like Tesla and WeWork are also very popular. These friends have probably heard about the amazing…

Arrays are amazing for looking up elements at specific indices as all elements in memory are contiguous, allowing for O(1) or constant time lookups. But often we don't, or can't, perform lookups via indices. …

A binary tree, as the name suggests, is any tree in which each node has at the most two child nodes. A binary tree can be empty, implying zero nodes in the tree. The cool thing about binary trees is that they are recursive structures. …

Many new developers wonder what the difference is between SQL and NoSQL. The subjects come up often in theoretical discussions and systems design interview preparation. In this tutorial, we will be looking at the difference between SQL and NoSQL based on certain parameters. …

Oftentimes, interviewers will test you on things that are deceptively easy. We saw this in Reverse a String, and will see more in future challenges. But sometimes you might get tested on a concept that, while a bit trivial, is really useful in day to day software engineering. One of…

The only way to get better at solving algorithms and data structures is to power through a few — Can you write a function that reverses an inputted string without using the built-in Array#reverse method? Let’s look at some examples. So, calling: reverseString("jake") should return "ekaj". reverseString("reverseastring") should return "gnirtsaesrever".

Can you invert a binary tree over its vertical axis? This is a famous problem made popular by this tweet: — Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert a binary tree on a whiteboard so fuck off. - Max Howell (@mxcl) June 10, 2015 Given a binary tree like this: 4 / \ 2 7 / \ / \ 1 3 6 9 …

The Two Pointer Technique The two-pointer technique is a near necessity in any software developer’s toolkit, especially when it comes to technical interviews. In this guide, we’ll cover the basics so that you know when and how to use this technique. This lesson was originally published at https://algodaily.com, where I maintain a technical interview…