| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2022-02-08 | Week 151: Make the algorithm for part 2 even simpler. | Abigail | |
| No need for an additional array: add two 0's to the array of valuables, and modify in situ. | |||
| 2022-02-08 | Week 151: Simplified algorithm for part 2. | Abigail | |
| By adding two dummy 0's to the "best" array, and not bothering the calculate the best values for the first two houses, we don't have a case study inside the main loop. | |||
| 2022-02-07 | Week 151: Node.js solutions | Abigail | |
 |
index : github/perlweeklychallenge-club.git | |
| Unnamed repository; edit this file 'description' to name the repository. |
| aboutsummaryrefslogtreecommitdiff |