Add BitwiseParityCheck.js

[Hardvan]

 know more

Add JavaScript implementation of the BitwiseParityCheck algorithm.

• Add an algorithm?
• Fix a bug or typo in an existing algorithm?
• Documentation change?

Checklist:

• I have read CONTRIBUTING.md.
• This pull request is all my own work -- I have not plagiarized.
• I know that pull requests will not be merged if they fail the automated tests.
• This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
• All new JavaScript files are placed inside an existing directory.
• All filenames should use the UpperCamelCase (PascalCase) style. There should be no spaces in filenames.
  Example:UserProfile.js is allowed but userprofile.js,Userprofile.js,user-Profile.js,userProfile.js are not
• All new algorithms have a URL in their comments that points to Wikipedia or another similar explanation.
• [] If this pull request resolves one or more open issues then the commit message contains Fixes: #{$ISSUE_NO}.

[appgurueu]

Not sure this is useful. Using BinaryCountSetBits, this would boil down to const parity = n => BinaryCountSetBits(n) & 1; then we could define const isEvenParity = n => parity(n) === 0 and const isOddParity = n => parity(n) === 1 (but these abstractions don't seem very useful) - as you see, this is all pretty trivial when written in terms of BinaryCountSetBits. @raklaptudirm thoughts?

[raklaptudirm]

I agree, this is essentially one way of implementing the BinaryCountSetBits function.