EASY NC#147 Blind #15 Bit Manipulation
190. Reverse Bits
📖 Problem
Reverse bits of a given 32 bits unsigned integer.
🧠 Visual Learning Aid
1 Model the input into the right structure
2 Choose the core technique and invariant
3 Execute step-by-step with a sample
4 Validate complexity and edge cases
JS/TS Refreshers
- •Array methods (`push`, `pop`, `shift`, `slice`)
- •Object/Map/Set usage patterns
- •Function parameter and return typing
Logical Thinking Concepts
- •Define invariants before coding
- •Check edge cases first (`[]`, single element, duplicates)
- •Estimate time/space before implementation
- •Apply Recursion reasoning pattern
💡 Approach
- → Extract each bit from the right and place it in the reversed position
- → Use bit shifting and masking to manipulate individual bits
- → Can be done iteratively or recursively
- → Time: O(32) = O(1), Space: O(1)
- → in functions, Byte swapping
🛠️ Hints & Pitfalls
Hints
- •Extract each bit from the right and place it in the reversed position
- •Use bit shifting and masking to manipulate individual bits
- •Can be done iteratively or recursively
Common Pitfalls
- •Time: O(32) = O(1), Space: O(1)
- •in functions, Byte swapping
🧪 Test Cases
Hidden tests on submit: 3
Test Case 1
Not run Input:
reverseBits(0b00000010100101000001111010011100); Expected:
964176192 Test Case 2
Not run Input:
reverseBits(0b10000000000000000000000000000000); Expected:
1 Test Case 3
Not run Input:
reverseBits(0xFFFFFFFF); Expected:
4294967295 📝 Code Editor
📤 Output