code challenges

▸ available challenges

Bubble Sort

Walk through the simplest sorting algorithm: scan the array, swap adjacent out-of-order pairs, repeat until a full pass has no swaps.
Fulfilled Orders Before Failure

Process an order queue against a freezer of flavors. Each order consumes one of each listed flavor; the first order that asks for an empty slot stops the line.
Quick Sort

Pick a pivot, partition the array so smaller values go left and larger go right, then recurse on each side. The pivot ends up in its final sorted position after each partition.
Reorder

Reorder an array in place by following the destination indices, one cycle at a time.