github/perlweeklychallenge-club.git/challenge-125/abigail, branch master Unnamed repository; edit this file 'description' to name the repository. Links to blogs 2021-08-15T20:50:29+00:00 Abigail abigail@abigail.be 2021-08-15T20:50:29+00:00 0dfc1786c2ab2282b265ba90fe18aa32dc33e3fb 






Handle leaves better
2021-08-15T20:49:29+00:00

Abigail
abigail@abigail.be

2021-08-15T20:49:29+00:00

0f9be85222718e52bf5db9f85c3ab70bc35b29dc












Fix calculation of diameter passing through root
2021-08-15T15:59:44+00:00

Abigail
abigail@abigail.be

2021-08-15T15:59:44+00:00

34aa316cdbeb0e57f530089e366856b7f86b72cc












Tcl solution for week 125, part 1
2021-08-14T00:29:05+00:00

Abigail
abigail@abigail.be

2021-08-14T00:29:05+00:00

26018e17bb38f61027306864c9b9a63063b7f089












R solution for week 125, part 1
2021-08-13T20:24:55+00:00

Abigail
abigail@abigail.be

2021-08-13T20:24:55+00:00

1f8d3b4f7da48be8efcf216eca31ba62f21f372d












Java and Pascal solutions for week 125, part 1
2021-08-13T16:59:21+00:00

Abigail
abigail@abigail.be

2021-08-13T16:59:21+00:00

5d3b637c1812e4d1534a72f5ab834dd7c88b6665












AWK and Go solutions for week 125, part 1.
2021-08-12T15:50:45+00:00

Abigail
abigail@abigail.be

2021-08-12T15:50:45+00:00

a1e6d2389d3af8169fe5076b00f928d153c69ce7












Different approach for week 125, part 2.
2021-08-11T17:11:21+00:00

Abigail
abigail@abigail.be

2021-08-11T17:11:21+00:00

525d5e4033d2a97406ecf9b4fbc52902c8e2210d

Incomplete program, due to lack of specification.





Incomplete program, due to lack of specification.







A solution for week 125, part 2, for some definition of solution.
2021-08-10T22:33:51+00:00

Abigail
abigail@abigail.be

2021-08-10T22:33:51+00:00

f42d586e285b5fb1694d33320380589b7709d579

Once again, the problem does not specify how to binary tree input
is going to look like. All we can deduce from the single example
input is that is absolutly won't scale beyond utter trivial sizes.

So, we will just die on any input which isn't exactly the one case
which is specified.





Once again, the problem does not specify how to binary tree input
is going to look like. All we can deduce from the single example
input is that is absolutly won't scale beyond utter trivial sizes.

So, we will just die on any input which isn't exactly the one case
which is specified.







Solutions in 6 languages for week 125, part 1
2021-08-10T22:33:29+00:00

Abigail
abigail@abigail.be

2021-08-10T22:33:29+00:00

9fc9a8a98be3336fb1bd9fb909c68af45186744e