You are so intellingent at the same time so humble and down to earth, thank you for sharing your knowledge. All your videos and blogs are extremely useful.
Thanks for making videos on specific topic. I liked your tutorials on DP and Binary search (On the general way to think where to use this algo.), I would love to see similar videos. Thanks, again!
x % 2 is not exactly the same as x & 1. For non-negative number it is but if your number is negative x % 2 will give you a negative result. For example -5 % 2 = -1 and -5 & 1 = 1. Keep that in mind when you are dealing with negative numbers.
I needed an entire hour to understand the code, but now I feel like I have the power of god (exactly what a stupid person usually thinks about themself). Thank you Errichto.
I found many tricky problems with XOR in different contests. A lot can be done on this topic. So if you make a separate video on the tactics and ingenuity of XOR, we would benefit.
Sir please have a complete course/series for competitive programming(including data structures and with practice questions) . It would be really helpful.
Amazing video! Amazing explanation. Maybe you could do a video on bitwise interesting problems, like, in an array where elements repeat find one that doesnt repeat etc. I enjoy watching your videos
Exzone check out Errichto2 channel live-streams, he covers the whole leetcode “interview prep” series in one, which contains many similar problem types to the one you mention
Sir...thank you very very much for the great help that you have provided through these videos . I feel very sad that I couldn't get to these videos earlier. Anyway . I love your videos n pattern of teaching . Thanks again a lot❤️
well you said there is a recursive version of sum of subsets, but first of all i'm not able to come up with a recurrence relation of just finding all the subsets of a given set, i know it's done using recursion and backtracking but just for the mathematical intuition if you can provide with that recurrence relation???
can someone explain the last few minutes? what exactly is his code doing? i dont understand why iterating through all the bits and comparing it with the mask will give u the number of subsets? pls explain tqvm!
Erichto please have a series for competitive programming algorithms. It would be really helpful. Nice video.
You are so intellingent at the same time so humble and down to earth, thank you for sharing your knowledge. All your videos and blogs are extremely useful.
Omg i really need this. Thank you Erricto ❤️
Thanks for making videos on specific topic. I liked your tutorials on DP and Binary search (On the general way to think where to use this algo.), I would love to see similar videos. Thanks, again!
The best thing about this is, you started from scratch and showed bitwise usage in iterative method. Outclass !
Thank you for taking some of your time to share your knowledge, I'm sure I speak for the whole community when I say it's very appreciated.
Thanks! The best explanation for bitwise operations and using bitmasking to solve subset problems.
Got here from LC daily challenge video.
Man this is GOLD! Thank you so much for sharing this!
x % 2 is not exactly the same as x & 1. For non-negative number it is but if your number is negative x % 2 will give you a negative result. For example -5 % 2 = -1 and -5 & 1 = 1. Keep that in mind when you are dealing with negative numbers.
Thanks you so much Errichto!! Excellent explanation and thanks for all your comments to keep it simple to understand! Greetings from Peru!
I needed an entire hour to understand the code, but now I feel like I have the power of god (exactly what a stupid person usually thinks about themself). Thank you Errichto.
Great video as always, but nothing beats listening to your geometry lecture in person at the POI training camp :D
@Hetan Thakkar sorry no
@Hetan Thakkar no, it wasn't filmed, just listened to as a way of preparation for the POI
This is the best tutorial for bitwise operation.
your videos are the best one competitive programmer can as for!!!!
I found many tricky problems with XOR in different contests. A lot can be done on this topic. So if you make a separate video on the tactics and ingenuity of XOR, we would benefit.
*I* *like* *his* *accent*
Well... thanks, I guess :D
Errichto!!!! The Khabib of programming!
Beautifully explained man . Plz add more and more videos on bit manipulation.
Isn't he lovely? Great explanation straight to the point unlike others💛
new subscriber because of how well you explained this!!! I'll start watching all your content and see what I can find :D
Thankyou Kamil , detailed videoes on several topics from beginner to high level will be highly appreciated....
Thanks for the videos on bit manipulation Errichto!!
Thank you so much 🥰🥰 I finally understand how the algorithm to print the binary representation works! You're a such a good teacher
Thank you very much! I am preparing for the informatics olympiad and I was searching for exactly these things for a long time.
Hello Errichto
Thank you for all the knowledge.
Keep making more videos on Data structures and algorithms.
Great Work Sir...Really Appreciate your work...Please keep on uploading.
suggestion : plz put playlist link as well in the description
Sir please have a complete course/series for competitive programming(including data structures and with practice questions) . It would be really helpful.
lotes of love sir please upload all algorithm
💥💥
This is great. Looking forward to the next one!
your tutorials are awesome !! please make more of them .
Thanks for your posting. It is excellent as always.
Thank you, Errichto, very much appreciated!
a good tutorial , good job Errichto
badly needed this video thanks a lot
Excellent examples
Can't wait for next one!
This was very informative. Good job!
Great Video! Waiting for the next lecture :D
Thanks, man. Waiting for the next part. :)
Amazing video! Amazing explanation. Maybe you could do a video on bitwise interesting problems, like, in an array where elements repeat find one that doesnt repeat etc.
I enjoy watching your videos
Exzone check out Errichto2 channel live-streams, he covers the whole leetcode “interview prep” series in one, which contains many similar problem types to the one you mention
@@Zzznmop Can u please provide the link to that video where he explains interview prep questions
Amazing explanation, thank you so much
Very very thank you sir for this video I just subscribed your channel after seeing this video
Thanks for this, really helpful video. I found the ending on subsets slightly confusing, and did not understand it, but everything else was great!
This was so nicely explained! Thank you so much. :)
This was extremely helpful, thank you
Big fan sir...Very nice explanation
last algo was amazing.
Eager for the bitsets video
Nice explanation
I found your binary to decimal converter technique very interesting 3:20
We need 2 part Erricto)!
nice work,love it
Sir...thank you very very much for the great help that you have provided through these videos . I feel very sad that I couldn't get to these videos earlier. Anyway . I love your videos n pattern of teaching . Thanks again a lot❤️
Thanks for this tutorial, as I am a beginner it helped me a lot, Waiting for your best lectures/
Very well explained Thank You
"Appending at the beginning" is prepending
Max Schumacher does appending necessarily imply front or back of a list? I don’t know if it does
zach p ya it does, appending is defined in programming as an attachment to the end of some list or other data structure (like a queue)
Thanks, good to know.
Thankyou so much , It's really helpful
Thank you so much, eagerly waiting for part 2
well you said there is a recursive version of sum of subsets, but first of all i'm not able to come up with a recurrence relation of just finding all the subsets of a given set, i know it's done using recursion and backtracking but just for the mathematical intuition if you can provide with that recurrence relation???
Before I even watch this....Thank you.
Programming Legend!
Thanks , I was looking for this
Wow,... Really nice video.. I Need this kind of video❤
Thanks! Errichto? I mean Kamil
in in 32 bit integer if MSB is 1 and left shift is done MSB is lost same as if right shift is done and LSB is 1
can someone explain the last few minutes? what exactly is his code doing? i dont understand why iterating through all the bits and comparing it with the mask will give u the number of subsets? pls explain tqvm!
Awesome video!, I would like to see more videos about DP :D
thanks, would you recommend books about this topics particularly?
thanks a tonne..HOPE U KEEP GETTING ENOUGH FREE TIME TO MAKE MORE VIDEOS LIKE THIS...REALLY HELPFUL FOR NOOB COMPETITIVE PROGRAMMERS LIKE ME.
Hey, thanks for the tutorial. What is the point of doing the for loop on 7:02. Are you looking for the similar x values in the 0...30?
what does n denote here?
Number of bits which are to be used or number of elements in the array for which subset problem is to be solved.
This video is treasure!
Thanks a lot Errichto!!
niesamowity!!!!
thank you Errichto! where could I find exercises like the last one?
You are the best.
I have a doubt...
Is predefined stl library functions such as sum or sort are better or manual algo is better for completive programming?
use stl that will save your time and will be more efficient than your written algo
Yes! Much needed
Erichto brother u r writing without seeing down to screen , howzzz u do that buddy...
Awesome guidance and teaching from erichto..
thank you so much
Just Awesome!!!
OMG, that was amazing.
Got one question what is a[i], ok I know its the i-th element, though where is a defined ?
Exactly what i was searching for?
I think we assume a as array of n elements....
Would love to see some bitmask dp later on too :D thanks
Thanks!
valuable video
Can you please suggest the software which you use to create these kind of videos???? Like your own video + the writing thing at one page???
thank u so much❤
Is it possible to get familiar with this??
No nie kłamiesz, fajnie wyjaśnione
Very helpful🤟
What is the time complexity of the algorithm used ?
I didn't get how we calcuate the subset values using that loop
Thank you.
Where do you learn this? I am making computer science and have never even heard of bitwise operations
you are great
Could you do videos on recursion?
can you make videos on segmented trees implementation it will be very helpfull!!
sir can u please explain what do you mean by a[i]?