LeetCode Solution: 1009. Complement of Base 10 Integer

🤯 Unmasking the Magic: Cracking LeetCode 1009 with Bitwise Brilliance! ✨ Hey everyone! Vansh here, ready to dive into another exciting LeetCode challenge. Today, we're tackling a problem that might look simple on the surface but introduces some super cool bitwise operations that are fundamental to competitive programming and computer science in general. Get ready to flip some bits and understand the magic behind 1009. Complement of Base 10 Integer! What's the Problem All About? 🤔 Imagine you have a number, let's say 5. In the world of computers, this isn't just 5; it's a sequence of 0s and 1s – its binary representation. For 5, that's "101". The problem asks us to find the complement of this number. What's a complement? It's simply what you get when you flip all the 0s to 1s and all the 1s to 0s in its binary form. So, for 5 ("101"): The first 1 becomes 0. The 0 becomes 1. The last 1 becomes 0. Resulting in "010". If you convert "010" back to base 10, you get 2. And that's our answer