Cohesity·Software Engineer·Technical Phone Screen
May 2026
Interviewed for a software engineer role at Cohesity and got a classic backtracking problem. Nothing too wild but it required getting the recursion right under pressure.
- Given an array of distinct positive integers and a target value, find all unique combinations of numbers from the array that sum to the target. A number can be used more than once, and combinations that contain the same numbers in different orders count as duplicates.
“Knew it was backtracking pretty fast but then spent way too long second-guessing how to avoid duplicate combinations.”