Combination Sum, is a LeetCode problem from graphs subdomain. This problem has also been asked in companies like Uber during the interview. In this post we will see how we can solve this challenge in Swift

Problem Description

You can find the full details of the problem Combination Sum at LeetCode


Time Complexity: O(n^n), Space Complexity: O(2^n - 1)

Please check the main.swift snippet for the solution.

This solution originally posted at: Github by @soapyigu