trekhleb / trekhleb/javascript-algorithms
Add Matrix Chain Multiplication in DP
Nobody has claimed this yet.
- Dominant language
- JavaScript
- Stars
- 197k
- Forks
- 31k
- PR merge metrics
- No merged PRs in 30d
Description
In the dynamic programming section, we could add the Matrix Chain Multiplication problem which is quite famous to find the most efficient way to multiply matrices together. The problem is not actually to perform the multiplications, but merely to decide in which order to perform the multiplications.
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 locating the dynamic programming section and reading nearby algorithm implementations to learn the repository's structure and conventions. Add Matrix Chain Multiplication there, including the explanation of choosing an efficient multiplication order. Done means the problem is represented in the dynamic programming section with a working JavaScript implementation.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- javascript
- Domain
- data
- Issue type
- Feature
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Active
- Clarity
- Mostly clear
- Newbie friendliness
- 68/100