Welcome to Day 6 of the DSA Coding Challenge:

Today's Goals (Backtracking continued) :

Question 1: Combinations: Given two integers n and k, return all possible combinations of k numbers chosen from the range [1, n].

You may return the answer in any order.

Question 2: Combinations Sum 1: Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen numbers sum to target. You may return the combinations in any order.

The same number may be chosen from candidates an unlimited number of times. Two combinations are unique if the frequency

of at least one of the chosen numbers is different.

All the best !