Cohesity·Software Engineer·Technical Phone Screen
Jul 2026
Cohesity software engineer interview with a classic backtracking problem. Nothing too exotic but you need to actually know your recursion cold or you'll fumble the edge cases.
- 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 reused as many times as needed, but two combinations that contain the same numbers in different orders count as one.
“The unlimited reuse part is what trips people up.”