While tackling the classic “first repeating element” challenge, the author first sketched a brute‑force routine that nested two loops over the array. At a glance the code seemed fine, but it mistakenly compared a stored value to an index, losing track of which duplicate appeared first. The post explains how the author realized that the problem asks for the element whose first occurrence index is smallest among all repeats, not the smallest value.

By switching the comparison to the index and storing that index instead of the value, the corrected brute‑force solution returns the right element. The author then shows a faster O(n) approach that walks the array once, using a frequency array to detect the first duplicate. This method trades a small amount of extra space for linear time, a common trade‑off in algorithm design.

The article ends with a reminder that clarity about “first” and tracking indices is essential before chasing speed, a lesson that applies to many coding interviews.