We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent d1688df commit d176b39Copy full SHA for d176b39
algorithms/bit-manipulation.md
@@ -2,6 +2,6 @@ Bit Manipulation
2
==
3
4
- How do you verify if an interger is a power of 2?
5
-- Wirte a program to print the binary representation of an integer.
+- Write a program to print the binary representation of an integer.
6
- Write a program to print out the number of 1 bits in a given integer.
7
-- Write a program to determine the largest possible integer using the same number of 1 bits in a given number.
+- Write a program to determine the largest possible integer using the same number of 1 bits in a given number.
0 commit comments