L4. Power Set | Bit Manipulation

Notes/Codes/Problem links under day 8 of A2Z DSA Course: takeuforward.org/strivers-a2z...
Follow us on our other social media handles: linktr.ee/takeuforward

[@sachinvarma9949]

never thought this problem can be solved by this approach

[@arnabnath4782]

No one can explain this with that ease..wonderful 👏🏼👏🏼👏🏼👏🏼

[@santoshkumak]

This problem looks very easy from explanation but after he writes code and mapping back to explanation you will know how tricky it is....
Kudos to you for putting this explanation and solution....

[@stith_pragya]

Understood.....Thank You So Much for this wonderful video............🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

[@yhimanshu22]

All videos are very nice.

[@SuvradipDasPhotographyOfficial]

Awesome striver, amazing explanation

[@codeman3828]

Understood. awesome video

[@UECAshutoshKumar]

Thank you 🙏

[@NazeerBashaShaik]

Understood, thank you.

[@yaminireddy3321]

understood in a easy way , thansks!!

[@user-tk2vg5jt3l]

Thank you Bhaiya

[@prabhakaran5542]

Understood❤

[@durgasainathdora9900]

understood ❤

[@nishchaypandit973]

Brother i have my placement in 3 months plz continue this playlist

[@dheshojukalyankumar]

All the best!

[@yogeshpatidar3529]

Understood👍

[@ShashiKanthvarma-lb6xb]

the observation that take set bit of 2^n index in input array as member of a subset is very theoretical & observation intensive and hard to come up with , if we have seen never before, how to deal with it @take U forward

[@Shivi32590]

thank you

[@mdseraj737_]

Understood 😊 all

[@ayushp4471]

Understood 😁❤️

[@jjjyotijain]

understood 😀

[@hardikpatel352]

Understood

[@navinchaudhary2812]

understood

[@ajayprabhu465]

Bruh, wonderful! , sorry I did not subscribe until now, i mean im following u from a yr, but never saw the subscribe button idk how. uff. DID IT NOW :)

[@user-sp8ne7hj3n]

nice

[@banothutharun2743]

Wow 🎉

[@unoshihaam]

public static void main(String[] args) {
int[] nums = {1,2,3};
int subsets = 1

[@adityababu3405]

#include
vector subsequences(string str){

vectorv;
int n=str.length();
int subset=(1

[@shubham57641]

Bhiya ab india aa gaye ho video ki consistancy banae rakhna

[@siddheshpandey7905]

Which approach is better, recursive or bitwise one?

[@ladimohanrao1067]

Any day bit manipulation takes less space

[@AbhishekSharma-hk8yh]

c++ code
class Solution {
public:
vector subsets(vector& nums) {
int n = nums.size();
int subsett = 1

[@SumitKumar-qg4ps]

That extra n in space can be easily optimized as
int n = v.size();
n = pow(2,n);
vectorans(n);
for(int i = 0; i

[@tej.askamble]

01/ 06 Revise

[@humanity7880]

understood

[@havefunwithshort]

understood

[@ramakrishnakcr4417]

understood