Seeded random cross-check (Random(2026)): fast solution vs brute force
======================================================================

plain search + insert position (1)                          3,000 cases   0 disagreements
first and last position (2)                                 3,000 cases   0 disagreements
count occurrences (3)                                       3,000 cases   0 disagreements
search in rotated array (4)                                 3,000 cases   0 disagreements
minimum of rotated array, distinct + duplicates (5)         6,000 cases   0 disagreements
find a peak element (6)                                     3,000 cases   0 disagreements
integer square root, small + near Integer.MAX_VALUE (7)     4,000 cases   0 disagreements
koko eating bananas (8)                                     3,000 cases   0 disagreements
ship packages within D days (9)                             3,000 cases   0 disagreements
search a 2D matrix (10)                                     3,000 cases   0 disagreements
