manrajgrover / manrajgrover/algorithms-js
Implement String Algorithms
Nobody has claimed this yet.
- #60 by @yevseytsev — closed without merging
- Dominant language
- JavaScript
- Stars
- 200
- Forks
- 136
- PR merge metrics
- No merged PRs in 30d
Description
#### String Algorithms to be implemented are:
- [ ] KMP Pattern Search
- [ ] Rabin-Karp Pattern Search
- [ ] Aho-Corasick Pattern Search
- [ ] Z-Algorithm Pattern Search
- [x] Levenshtein distance
- [ ] Longest common subsequence
- [ ] Longest common substring
- [ ] Longest common leading/trailing substring
- [ ] Dice's coefficient
Contributor guide
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
Start by reviewing the existing Levenshtein distance implementation and the repository’s JavaScript algorithm structure. Then work through the unchecked algorithms in the issue, beginning with one pattern-search or sequence-comparison item. Done means the selected algorithms are implemented and the checklist accurately reflects completion.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- javascript
- Domain
- data
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 25/100