tl;dr:Reverse a list of distinct positive integers using two types of moves: splitting a number into two parts that sum to the whole, or combining two adjacent numbers into their sum. The goal is to reverse the list without creating numbers greater than the original list's maximum or duplicating any elements. The challenge is to find the optimal sequence of moves.
tl;dr:"This post focuses on my basic muscle-memory git commands. There are at least two other major Git subtopics this post doesn’t mention at all: “branching discipline” (what is a release branch? what’s the difference between rebase and merge?) and “hygiene” (how big should a commit be? what does a good commit message look like?). That is — as usual for this blog — we’re talking tactics, not strategy."
tl;dr:"It’s been a while since I was on the receiving end of a software engineering interview. But I still remember my favorite interview question. It was at MemSQL circa 2013... Since MemSQL was a database company, this is a database challenge."