Combination Sum with Distinct Integers

# Introduction

In this challenge, we will be working with an array of distinct integers called `candidates` and a target integer called `target`. Our goal is to find all unique combinations in `candidates` where the numbers sum to `target`. We will write a function named `combinationSum` in the provided `combinationSum.js` file to solve this problem. The function should return the combinations in any order. The challenge also provides examples to clarify the task at hand.