Problem 1295. Bit Reversal

• Created by @bmtran (Bryant Tran)
• Appears in 2 groups

×

By solving this problem, you will make progress in the following group(s)

Strings III

• 23 Problems
• 22 Finishers

Swap Between Values

• 13 Problems
• 41 Finishers

Like (13)

Difficulty:

(141)

Rate

• Solve Later   
• Add To GroupÂ

Given an unsigned integer x, convert it to binary with n bits, reverse the order of the bits, and convert it back to an integer.

Solve

Solution Stats

55.52% Correct | 44.48% Incorrect

• 2826 Solutions
• 1483 Solvers

Last Solution submitted on Apr 23, 2025

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers1483

Suggested Problems

• Back to basics 12 - Input Arguments

  607 Solvers

• Number of 1s in a binary string

  9810 Solvers

• frame of the matrix

  863 Solvers

• Find the next prime number

  700 Solvers

• Create an index-powered vector

  823 Solvers

More from this Author56

• Parse me a Lisp

  86 Solvers

• Chromatic Tuner

  11 Solvers

• Return the Nth Output from an Input Command

  68 Solvers

• Specific Element Count

  890 Solvers

• Return the first and last characters of a character array

  10639 Solvers