The Number of Beautiful Subsets | Leetcode

preview_player
Показать описание
#leetcode
#coding
#cpp
#problemsolving
Рекомендации по теме
Комментарии
Автор

just a dumb doubt : since a[i] can be at most around 1000(in this problem) and int can only store upto 32 bits, then how it is going to set the 1000th bit(just a example)?
to elaborate further, we are saying that the no 6 is in the subset if the 6th bit of mask is set. so my question was how the variable 'mask' is going to store/set the 1000th bit when there are only 32 bits.

pushkar
Автор

Can you please upload contest 858 A and B codeforces

superccodm
Автор

Can you please provide the bitmasking video's link in the description or comment..thanks in advance 🤝

deonarayanchoudhari