Twitter | Coding Round | Closest Numbers
Summary
I successfully navigated a coding round at Twitter, where I was presented with the "Closest Numbers" problem and provided a Python solution.
Full Experience
During my coding round at Twitter, I was tasked with solving the "Closest Numbers" problem. I was able to devise an efficient approach and implemented a solution in Python, which I believe addressed the problem requirements effectively.
Interview Questions (1)
Closest Numbers
Given an unsorted array of distinct integers, find all pairs of elements that have the minimum absolute difference between them. If there are multiple pairs with the same minimum difference, return all of them. For example, if the input array is [-20, -3916237, -357920, -3620601, 7374819, -7330761, 30, 6246457, -6461594, 266854], the output should be the pairs that have the smallest difference.