mgechev / mgechev/javascript-algorithms
Bitwise Algorithms
Open
Nobody has claimed this yet.
- Dominant language
- JavaScript
- Stars
- 7.8k
- Forks
- 1.2k
- PR merge metrics
- No merged PRs in 30d
Description
Bitwise operations are really useful.
But there is no folder for bitwise alogrithms.
I would like to start working on such algorithms like
- Number of set bits
- Reverse set bits
- Number of set bits in an array
- Check if number is Binary paldindrome
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
The issue names no files or tests, so start by reviewing the repository's existing algorithm folders and test conventions. Implement the proposed bitwise algorithms—set-bit counting, bit reversal, array set-bit counting, and binary-palindrome checking—and confirm each has matching tests and fits the project's structure.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- javascript
- Domain
- backend
- Issue type
- Feature
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100