williamfiset / williamfiset/algorithms

Add suffix array string matching in O(m + log(n))

Open
#52 1 comment 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

String algorithm
Dominant language
Java
Stars
18.8k
Forks
4.5k
PR merge metrics
No merged PRs in 30d

Description

This issue has no description.

Contributor guide

No contributing guide indexed for this repository

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

Research direction

The issue has no body, file path, test, or acceptance criteria. Start by surveying the Java string-search and suffix-array entry points in the repository, then identify existing tests or conventions for algorithm implementations. Done is not defined beyond adding suffix-array string matching with the stated complexity, so the expected API and validation need clarification.

Written by the indexing model from the issue text.

Assessment

Tech stack
java
Domain
search
Issue type
Feature
Difficulty
4/5
Estimated time
3-5 days
Activity status
Stale
Clarity
Needs clarification
Newbie friendliness
25/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.