He tried the naive merge-and-count approach first. O(m+n). The editor rejected it with a gentle ding and a message: “Time complexity too high. Try again.”

“Given two sorted arrays of sizes m and n, find the k-th smallest element in the union of the two arrays in O(log m + log n) time. Implement in the language of your choice within the embedded editor below. You have one hour.”

That night, in a dark office lit only by a single monitor, Leo opened a terminal, typed a command he had never used since that strange, sleepless night years ago, and whispered:

After the exam, Leo tried to open the PDF again. The link was dead. The file on his computer had reverted to a standard, scanned, 32MB PDF from 1983—yellowed, static, and completely inert. The editor was gone. The shimmering trees had vanished. But the knowledge remained, etched not into his hard drive, but into his neural pathways like a perfectly balanced B-tree.