Advent of Code is an annual coding challenge with a new puzzle for each day between 1st and 25th December. You can use any language you want and take as much time as you need, though there is some lighthearted competition in the form of leaderboards and trying to find the shortest, quickest or most esoteric solution.
In this talk we'll take a look at how to approach solving the puzzles, some tips on techniques that will make your life easier, and why you might want to choose specific languages. We'll also work through some example solutions for previous years in Go and C, including how to automatically test code and deal with edge cases that are common in the puzzles.
Views: 33 | Enquiries: 0Regular speaker at U3A events on history, primarily Roman but also World War 2. I have an MA in Ancient World Studies and enjoy sharing my knowledge with others. I run my own freelance business and this gives me the flexibility to deliver talks during the week.
I can give talks in person within Greater Manchester (or slightly further afield if near a major train station with a direct service from Manchester, such as Warrington), or online anywhere whose timezone is the same as the UK. I do not charge a fee or require expenses for any of my talks.
History talks are 90 minutes (2 x 45 minutes with a break in between), however I can adjust them to be shorter if needed. Other talks are usually 45-60 minutes.
I usually write one or two new talks each year, so if there is nothing which catches your interest at the moment there may be in future.
Feedback from talks include:
"Really enjoyed the evening. […] fascinating talk"
"Good content and very well delivered too, thanks for your efforts"
"It was definitely memorable. You should do more talks on this subject."
"Paul’s talk is going down very, very well. Excellently given, and this is fantastic advice for everyone in a technical role, considering contracting."
"Excellent talk. Lots of useful info."
If you are interested in this talk and wish to contact the speaker, please complete the following form: