| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2021-01-30 | Link to blog post for week 97, part 2 | Abigail | |
| 2021-01-30 | Swap the role of sections and section length (size). | Abigail | |
| We initially implemented the algorithm where the number of sections is passed in as a parameter. However, it's not the number of sections, it's the length of each section. This was an easy fix, as the algorithm is pretty symmetric. | |||
| 2021-01-30 | Pointless splitting into sub strings. | Abigail | |
| The challenge asks to first split the given string into substring. But for the calculation of the end result, we don't actually need those substrings. To make sure we won't be disqualified, we split the given strings into substrings -- which we tell ignore. We only do this for the Perl solution; other language solutions will not include pointless statements. | |||
| 2021-01-30 | Link to blog post for week 97, part 1 | Abigail | |
| 2021-01-30 | Eliminate a magic number | Abigail | |
| 2021-01-30 | No need to split a string into individual characters | Abigail | |
| 2021-01-30 | Improvements for the Perl solution of week 97, part 1 | Abigail | |
| 2021-01-27 | Fix example. | Abigail | |
| The right option to mimic the given example is -s 2, not -s 4. (But curiously, this leads to the same answer). | |||
| 2021-01-27 | Add another test case. | Abigail | |
| In particular, a case where the target string is different from all the strings: 1110 1101 1011 If we flip all the 0 bits to 1, all the strings will be equal (1111), but 1111 is not one of the given strings. | |||
| 2021-01-27 | Typo fix | Abigail | |
| 2021-01-27 | Bash and Ruby solutions for week 97, part 2 | Abigail | |
| 2021-01-27 | Python solution for week 97, part 2 | Abigail | |
| 2021-01-27 | Notes come after the examples. | Abigail | |
| 2021-01-27 | Make C solution more like the other solutions. | Abigail | |
| 2021-01-27 | Make AWK solution more like the other solutions. | Abigail | |
| 2021-01-27 | Add algorithm notes to README | Abigail | |
| 2021-01-27 | Use the same algorithm for the perl solution as for other languages. | Abigail | |
| 2021-01-27 | Node.js solution for week 97, part 2 | Abigail | |
| 2021-01-27 | Lua solution for week 97, part 2 | Abigail | |
| 2021-01-27 | C solution for week 97. part 2 | Abigail | |
| 2021-01-27 | Bash solution: disable pathname expansion | Abigail | |
| 2021-01-27 | Fix comment | Abigail | |
| 2021-01-27 | AWK solution for week 97, part 2 | Abigail | |
| 2021-01-26 | Perl solution for week 97, part 2 | Abigail | |
| 2021-01-26 | Split example for part 2 | Abigail | |
| Since they need different command line options | |||
| 2021-01-26 | Ruby solution for week 97, part 1 | Abigail | |
| 2021-01-26 | Python solution for week 97, part 1 | Abigail | |
| 2021-01-26 | Lua solution for week 97, part 2 | Abigail | |
| 2021-01-26 | C solution for week 97, part 2 | Abigail | |
| 2021-01-26 | AWK solution for week 097, part 1 | Abigail | |
| 2021-01-26 | Bash solution for week 097, part 2 | Abigail | |
| 2021-01-26 | Node.js solution for week 097, part 1 | Abigail | |
| 2021-01-26 | Use option -s (shift), instead of -t. | Abigail | |
| 2021-01-26 | Use an option to determine the shift size. | Abigail | |
| 2021-01-26 | Perl solution for week 97, part 1 | Abigail | |
| 2021-01-26 | Examples | Abigail | |
| 2021-01-26 | README | Abigail | |
| 2021-01-25 | - Added template for Challenge 97. | Mohammad S Anwar | |
 |
index : github/perlweeklychallenge-club.git | |
| Unnamed repository; edit this file 'description' to name the repository. |
| aboutsummaryrefslogtreecommitdiff |