Subsets - Backtracking And Recursion (Leetcode 78)

Leetcode 78
This question has been asked in multiple coding interviews including Google and Microsoft.
Link to the problem

Intuition behind solution: Iterate through all numbers, recursively taking and not taking each number at every index. By doing so, you'll generate all possible subset of the given numbers.

#subset #permutation #c++

For any queries or suggestions you can ping me on
Instagram - rahul_jain.96