Loading the journal
Loading the journal
Problem
Given an array of integers, sort the array using the Bubble Sort algorithm. The algorithm works by repeatedly swapping adjacent elements if they are in the wrong order.
Reading the solution first feels like progress, but it makes the next similar problem — and the interview version — much harder, because you skipped the part where you figure it out. Give it an honest 20–30 minutes. Stuck? Re-read the pattern, watch the concept video, or try the brute force first.
Hidden: approach · solution code