Hims & Hers·Software Engineer·Technical Phone Screen
Apr 2026
Coding screen at hims & hers with a classic array problem. Nothing fancy, but the O(n) time plus constant space constraint is the part that trips people up if they haven't seen it before.
- Given an integer array of length n where every value is between 1 and n and each value appears once or twice, find all values that appear twice. Your solution must run in O(n) time and use constant extra space.
“The naive answer is a hashmap and they'll let you say it, but then they ask you to drop the extra space and that's where it gets interesting.”