github/perlweeklychallenge-club.git/challenge-097/abigail, branch master Unnamed repository; edit this file 'description' to name the repository. Link to blog post for week 97, part 2 2021-01-30T16:51:27+00:00 Abigail abigail@abigail.be 2021-01-30T16:44:47+00:00 d1bae8f818a128006f07211eddbe7c17b040652a 






Swap the role of sections and section length (size).
2021-01-30T16:51:27+00:00

Abigail
abigail@abigail.be

2021-01-30T16:01:45+00:00

7de0601266583815c0bfb3f00cb71672997b19c3

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.





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.







Pointless splitting into sub strings.
2021-01-30T16:51:26+00:00

Abigail
abigail@abigail.be

2021-01-30T15:44:34+00:00

19e332207808276edd1ed1bebd3e907136acc438

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.





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.







Link to blog post for week 97, part 1
2021-01-30T16:51:26+00:00

Abigail
abigail@abigail.be

2021-01-30T15:08:49+00:00

d20c2e25f01944de76c0c0f600c51ee74c8a094d












Eliminate a magic number
2021-01-30T16:51:26+00:00

Abigail
abigail@abigail.be

2021-01-30T14:06:38+00:00

2445f279cc1dee0947827dcfda054612fc6a8de1












No need to split a string into individual characters
2021-01-30T16:51:26+00:00

Abigail
abigail@abigail.be

2021-01-29T19:31:33+00:00

e99579328003d3e4712b574f45e1fa2d55c7d573












Improvements for the Perl solution of week 97, part 1
2021-01-30T16:51:26+00:00

Abigail
abigail@abigail.be

2021-01-29T19:16:45+00:00

dd53a9936ba3e10841194b2c50134ecbde1060a1












Fix example.
2021-01-27T18:36:25+00:00

Abigail
abigail@abigail.be

2021-01-27T18:36:25+00:00

b95ad395cd59d90b57ac6da0b05e31aa56bbf63a

The right option to mimic the given example is -s 2, not -s 4.
(But curiously, this leads to the same answer).





The right option to mimic the given example is -s 2, not -s 4.
(But curiously, this leads to the same answer).







Add another test case.
2021-01-27T18:34:13+00:00

Abigail
abigail@abigail.be

2021-01-27T18:34:13+00:00

f3ee86defcd62c62d88313aeae6d01823b613d81

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.





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.







Typo fix
2021-01-27T18:13:00+00:00

Abigail
abigail@abigail.be

2021-01-27T18:13:00+00:00

31a1b4d29253f20ff53c95223312213229357565