Create BitManipulationAlgorithms

[MeetRamatri]

Algorithm 1: Find the Number Appearing Odd Times Algorithm 2: Swap Adjacent Bits of a Number Algorithm 3: Bitwise XOR of All Elements in an Array

• [x] I have read CONTRIBUTING.md.
• [x] This pull request is all my own work -- I have not plagiarized it.
• [x] All filenames are in PascalCase.
• [x] All functions and variable names follow Java naming conventions.
• [x] All new algorithms have a URL in their comments that points to Wikipedia or other similar explanations.
• [x] All new code is formatted with clang-format -i --style=file path/to/your/file.java

[codecov-commenter]

Codecov Report

All modified and coverable lines are covered by tests :white_check_mark:

Project coverage is 66.78%. Comparing base (33dee07) to head (5eafa52).

Additional details and impacted files

@@             Coverage Diff              @@
##             master    #5888      +/-   ##
============================================
- Coverage     66.81%   66.78%   -0.03%     
+ Complexity     4501     4499       -2     
============================================
  Files           611      611              
  Lines         16958    16958              
  Branches       3275     3275              
============================================
- Hits          11330    11325       -5     
- Misses         5181     5183       +2     
- Partials        447      450       +3     

:umbrella: View full report in Codecov by Sentry.
:loudspeaker: Have feedback on the report? Share it here.

[github-actions[bot]]

This pull request has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contribution!

[github-actions[bot]]

Please reopen this pull request once you have made the required changes. If you need help, feel free to ask in our Discord server or ping one of the maintainers here. Thank you for your contribution!