Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.
Click here
Use backtracking and pick one number at a time to fill temp array. Once temp array is same size as permutation, add it to result. Each time choose next number, and check if it was used with set. O(n!) time, O(n) space.Run make to run python and Swift files.