Subsets | Leetcode 78 | Array | Recursion | Backtracking

Time Complexity: O(N*2^N)
Space Complexity: O(N*2^N)

𝗙𝗲𝗲𝗹 𝗳𝗿𝗲𝗲 𝘁𝗼 𝗰𝗼𝗺𝗺𝗲𝗻𝘁 𝗶𝗳 𝘆𝗼𝘂 𝗵𝗮𝘃𝗲 𝗮𝗻𝘆 𝗱𝗼𝘂𝗯𝘁𝘀 𝗮𝗯𝗼𝘂𝘁 𝘁𝗵𝗲 𝗰𝗼𝗱𝗲 𝗼𝗿 𝘁𝗵𝗲 𝗹𝗼𝗴𝗶𝗰!!

🔴My contact details

#Array
#Recursion
#Backtracking
#DataStructuresAndAlgorithms
#Leetcode
#ConsitencyChallenge
#NiteshNanda

[niteshnanda]

Sorry, the total space complexity for this question is O(N*2^N) because we are generating all the subsets, it will be O(2^N) and for one subList it will take O(N).
The final space complexity with result output is O(N*2^N).