Created
August 2, 2019 13:16
-
-
Save vansika/0fcd1082fe2d82cc61d6a5178939464d to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
You have a 32 bit integer a. Given two integers n and m(m>=n), you have to find an integer formed by bits of a between n and m(both inclusive). |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment