| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2022-02-09 | Week 151: Tcl solution for part 2. | Abigail | |
| 2022-02-09 | Week 151: bc solution for part 2 | Abigail | |
| 2022-02-09 | Week 151: Java solution for part 2 | Abigail | |
| 2022-02-08 | Week 151: Pascal solution for part 2 | Abigail | |
| 2022-02-08 | Week 151: README | Abigail | |
| 2022-02-08 | Week 151: R solution for part 2 | Abigail | |
| 2022-02-08 | Week 151: Go solution for part 2 | Abigail | |
| 2022-02-08 | Week 151: Ruby solutions | Abigail | |
| 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: Python solutions | Abigail | |
| 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 | |
| 2022-02-07 | Week 151: Lua solutions | Abigail | |
| 2022-02-07 | Week 151: C solutions | Abigail | |
| 2022-02-07 | Week 151: Bash solutions | Abigail | |
| 2022-02-07 | Week 151: No recursion for part 2 | Abigail | |
| 2022-02-07 | Week 151: AWK solutions | Abigail | |
| 2022-02-07 | Week 151: Perl solutions | Abigail | |
| 2022-02-07 | Week 151: Tests | Abigail | |
| 2022-02-07 | - Added template for week 151. | Mohammad S Anwar | |
 |
index : github/perlweeklychallenge-club.git | |
| Unnamed repository; edit this file 'description' to name the repository. |
| aboutsummaryrefslogtreecommitdiff |