Files

.github
Backtracking
Basic
Bit Algorithm
- Check if A Number is Power of Two
- Check if Two Integers Have Opposite Signs
- Count Number of Set Bits in A Number
- Find Non-Repeated Element
- Find Two Non-Repeating Elements
- Find the Maximum XOR Possible in a Given Range
- Set the kth Bit
  - SolutionByAbhay.cpp
  - SolutionByNeeraj.cpp
  - SolutionBySravani.cpp
  - SolutionByYodaCodes.cpp
  - readme.md
Data Structure
Divide and Conquer
Dynamic Programming
Greedy Algorithms
Sample Code
docs
.clang-format
.gitignore
CODE_OF_CONDUCT.md
Contributing.md
LICENSE
PR_using_Git.md
readMe.md

Set the kth Bit

Name		Name	Last commit message	Last commit date
parent directory ..
SolutionByAbhay.cpp		SolutionByAbhay.cpp
SolutionByNeeraj.cpp		SolutionByNeeraj.cpp
SolutionBySravani.cpp		SolutionBySravani.cpp
SolutionByYodaCodes.cpp		SolutionByYodaCodes.cpp
readme.md		readme.md

readme.md

A user inputs a number say 32 , and a position say 7.

write a function which takes the number and sets its 7th position counting from least significant digit and then return the resultant number in decimal.

Example-32’s binary representation is 00100000 and after setting its 7th position from least significant position,

the resultant number becomes: 01100000,which is 96.