lentychang / lentychang/coding_practice
[#244] solution for Slider not faster enough
Open
Nobody has claimed this yet.
- Dominant language
- C++
- Stars
- 0
- Forks
- 0
- PR merge metrics
- No merged PRs in 30d
Description
currently, the algorithm is basically Breadth First Search.
Also, multimap data structure is used, every time it inserts, it needs to order the element.
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
Start by locating the Slider implementation and its current breadth-first search and multimap usage. Examine how the existing solution is measured, then determine and verify a faster approach; the issue names no file or test and does not define a target for completion.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- performance
- Issue type
- Refactor
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100