How to solve the Baby Lizards Problem — a fun twist on the N-Queens problem
Using graph traversals and some tricks to approach a subtle twist on a classic backtracking problem.
Let’s Backtrack And Save Some Queens
Let’s take a look at solving this classical backtracking problem.
Deep Dive Into Graph Traversals
An overview of the famous Depth-First Search and Breadth-First Search algorithms and their differences and use cases.
How we fine-tuned HAProxy to achieve 2,000,000 concurrent SSL connections
Read on to find out all the tweaks we did to extract those teeny tiny bits of performance from a reliable and highly used load balancer.
Load Testing HAProxy (Part 2)
Part-2 of the 3 part series on breaking the limits of the open-source HAProxy, which is a reliable, high performant TCP/HTTP load balancer.