Find Closest Number to Zero
A easy-tier problem at 47% community acceptance, tagged with Array. Reported in interviews at Tiger Analytics and 0 others.
Find Closest Number to Zero is an easy array problem that shows up in Tiger Analytics assessments. It sounds trivial, but the gotcha is handling the tie case: when two numbers are equidistant from zero (like -5 and 5), which one do you return. Most candidates miss the rule on first read, then waste time during the OA debugging wrong logic. If you blank on the exact tie-breaker during your live assessment, StealthCoder surfaces the right implementation in seconds, invisible to the proctor.
Companies that ask "Find Closest Number to Zero"
Find Closest Number to Zero is the kind of problem that decides whether you pass. StealthCoder reads the problem on screen and surfaces a working solution in under 2 seconds. Invisible to screen share. The proctor sees nothing. Made by a working FAANG engineer who treats the OA the way companies treat hiring: as a game with rules you should know.
Get StealthCoderThe problem is straightforward at surface level: iterate the array, track the minimum absolute distance, return that number. The real work is the tie-breaker. When abs(a) equals abs(b), convention favors the positive number. Candidates often hardcode the first min they find and never revisit the logic, or they overcomplicate the condition chain. The obvious single-pass approach works fine, but you need tight conditional logic. If you hit this during your OA and second-guess the tie rule, StealthCoder confirms the pattern and delivers a clean solution.
Pattern tags
You know the problem.
Make sure you actually pass it.
Find Closest Number to Zero recycles across companies for a reason. It's easy-tier, and most candidates blank under the timer. StealthCoder is the hedge: an AI overlay invisible during screen share. It reads the problem and surfaces a working solution in under 2 seconds. Made by a working FAANG engineer who treats the OA the way companies treat hiring: as a game with rules you should know. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Find Closest Number to Zero interview FAQ
Is this actually asked in real interviews?+
Yes. Tiger Analytics includes it in their assessments. The acceptance rate is 47%, which suggests it catches candidates who skim the problem statement and miss the tie-breaker rule. It's an easy problem that weeds out people who don't read carefully.
What's the trick nobody sees coming?+
The tie-breaker. When two numbers have the same absolute distance from zero, you must return the positive one. Candidates often return the first minimum they encounter and don't revisit the logic. One extra conditional check fixes it, but you have to know to look for it.
Do I need two passes or can I do it in one?+
One pass is fine. Track the minimum absolute distance and the corresponding number. When you find an equal distance, compare and pick the positive one. No need for a second iteration or sorting.
How does this relate to other array problems?+
It's a foundational single-pass array scan with a custom comparison rule. Similar pattern shows up in min/max problems where the tie-breaker matters. If you nail the conditional logic here, it transfers to harder problems with multi-part selection criteria.
What's the time and space complexity?+
O(n) time, single pass. O(1) space, one variable to track the closest number. No sorting, no extra data structures needed. It's the most efficient approach and the one the interviewer expects.
Want the actual problem statement? View "Find Closest Number to Zero" on LeetCode →