Home
Log in
DescriptionSubmissionsSolution
DescriptionSubmissionsSolution
Loading...

Log in to run or submit

n =

Codey

Practise coding problems, test your solutions and track your progress.

Explore

  • Problems
  • About
  • Contact

Legal

  • Privacy Policy
  • Terms of Use

© 2026 Codey. Personal learning project.

Reverse Bits

Easy

Reverse bits of a given 32 bits signed integer.

 

Example 1:

Input: n = 43261596
Output: 964176192
Explanation:
IntegerBinary
4326159600000010100101000001111010011100
96417619200111001011110000010100101000000

 

Example 2:

Input: n = 2147483644
Output: 1073741822
Explanation:
IntegerBinary
214748364401111111111111111111111111111100
107374182200111111111111111111111111111110

 

Constraints:

  • 0 <= n <= 231 - 2
  • n is even.

 

Follow up: If this function is called many times, how would you optimize it?

Reverse Bits

Easy

Reverse bits of a given 32 bits signed integer.

 

Example 1:

Input: n = 43261596
Output: 964176192
Explanation:
IntegerBinary
4326159600000010100101000001111010011100
96417619200111001011110000010100101000000

 

Example 2:

Input: n = 2147483644
Output: 1073741822
Explanation:
IntegerBinary
214748364401111111111111111111111111111100
107374182200111111111111111111111111111110

 

Constraints:

  • 0 <= n <= 231 - 2
  • n is even.

 

Follow up: If this function is called many times, how would you optimize it?