Binary Search

A fast search algorithm with O(log n) complexity that works on sorted data by dividing the search space in half.

2 Min Read

onApril 12, 2025

The O(n) Club: First Bad Version: Detective Work for Burnt Toast Builds

The O(n) Club: First Bad Version — Detective Work for Burnt Toast Builds ⚡ TL;DR Bugs appeared, and now you’re stuck playing detective. Find…

2 Min Read

onMarch 26, 2025

The O(n) Club: Count Complete Tree Nodes Like a Binary Sorcerer ⚡ TL;DR You could count each node in your complete binary tree like a…