What is Bit Masking?
Bit Masking is a technique where an integer is used as a compact array of booleans, using bitwise operations to set, clear, or read individual bits.
Verify This Answer
Cross-check this information using these trusted sources:
More FAQs in Why Understanding Bitwise Operators Matters in DSA
A bitwise operator performs operations directly on the individual binary bits (1s and 0s) of integer values at the hardware level.
XOR has unique properties (like x ^ x = 0) that allow for clever, memory-efficient solutions, such as finding a missing number without using extra space.
It shifts the binary representation of a number to the left, appending zeros. Mathematically, it is equivalent to multiplying the number by powers of 2.
Still have questions?
Browse all our FAQs or reach out to our support team