Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

I know the time complexity is 2 power n because that's the number of subsets how do i get there with a mathematical formula? anyone please?, i was asked this in a startup interview today! I tried with masters theorem but couldn't get there

https://en.wikipedia.org/wiki/Binomial_theorem

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.