Source: Day 2: Gift Shop
Full solution for today (spoilers!).
Part 1
Given a list of ranges
a-b(ie11-22), sum all values that are made of two repeated chunks of digits (ie123123)
Full solution for today (spoilers!).
Given a list of ranges
a-b(ie11-22), sum all values that are made of two repeated chunks of digits (ie123123)
Full solution for today (spoilers!).
Implement a padlock with 100 values (0-99). Run each command (
L23to turn left by 23 places) and then output the number of times you landed on zero.
Yesterday’s challenge from Programming Praxis challenges us to rebuild a data structure near and dear to any Lisper’s/Schemer’s/Racketer’s1/functional programmer’s heart: lists. The idea presented in their sample solution uses two element vectors, directly mimicking the general internal structure of Scheme’s lists. How about we do something a bit stranger? 😄