Tweet ps. look out for all my other solutions for Advent of Code challenges here.   Day 24 See details of the challenge here. Today’s challenge is a mix of Breadth-First Search (or Level Order Tree Traversal) and the Travelling Salesman Problem. First, let’s parse the input file into a 2D array to make it easier

Tweet ps. look out for all my other solutions for Advent of Code challenges here.   Day 23 See details of the challenge here. Today’s input looks like this: cpy a b dec b cpy a d cpy 0 a cpy b c inc a .. Today’s challenge is an extension to Day 12, where we

Tweet ps. look out for all my other solutions for Advent of Code challenges here.   Day 22 See details of the challenge here. Today’s input looks like this: root@ebhq-gridcenter# df -h Filesystem                           Size    Used     Avail    Use% /dev/grid/node-x0-y0  

Tweet ps. look out for all my other solutions for Advent of Code challenges here.   Day 21 See details of the challenge here. Today’s input looks like this: swap position 2 with position 7 swap letter f with letter a swap letter c with letter a rotate based on position of letter g rotate based

They said they wanted a “Rock Star” developer but I think they got upset when I trashed the hotel room they had me put up in. They said they wanted a “Rock Star” developer but you should have seen the expression on the face of the interviewer when I smashed my guitar on his desk. […]