Derk-Jan Karrenbeld SleeplessByte

Note

This challenge should be completable by people who took and finished Level 18 of Exercism's Front-end Fundamentals. Those who took Josh Comeau's CSS for JavaScript Developers should also be able to finish it.

Find the expected result on derk-jan.com · challenge: the clock made of clocks and DO NOT INSPECT THE SOLUTION;
Write down the list of requirements;
Work on your implementation for as long as you want;
After you are happy with your implementation, host it on your portfolio, a Codepen, a CodeSandbox, or GitHub Pages;
Share your hosted solution including source code here as a comment.

I really don't like the notion where we look at commit counts (that's code style), line count (quantity/quality, and highly different per language) or even time investment (indication of efficiency, not effort), so I've only listed the projects and the additions and leave it up to managment to make some pragmatic choices for rewards.

This is a non-comprehensive list of things I think I contributed, which others can use as a basis for their own list.

	rules, yours, nearby = File.read('input.txt').split(/\n\n/)

	def ticket_values(nearby)
	nearby.split("\n")[1..]
	end

	def category_values(rules)
	rules.split("\n").each_with_object({}) do \|line, categories\|
	next if line.empty?

	numbers = File.read('input.txt').chomp.split(',').map(&:to_i)

	turns = numbers.dup
	memory = Hash.new { [] }

	numbers.each_with_index do \|number, turn\|
	memory[number] = [turn]
	puts "Turn #{turn + 1}: #{number}"
	end

	require 'benchmark'

	def mask_rjust(value, mask)
	value.to_s(2).rjust(mask.length, "0")
	end

	def mask_from_line(maskline)
	mask = maskline.chomp.split('mask = ').last
	add = mask.tr('01X', '010').to_i(2)
	sub = mask.tr('01X', '011').to_i(2)

	require 'prime'
	require 'benchmark'

	source = 'input.txt'

	timestamp, schedule_line = File.readlines(source)
	schedule = schedule_line.split(',').map { \|x\| x.chomp }

	busses = schedule
	.each_with_index

	require 'benchmark'

	class Ship

	attr_reader :position

	def initialize
	self.facing = 90
	self.position = Position.new(0, 0)
	self.waypoint = Waypoint.new

	require 'benchmark'

	class Seat
	def initialize(mark)
	self.mark = mark
	self.next_mark = mark
	end

	def valid?
	mark != 'X'

	require 'benchmark'

	adapters = File.readlines('input.txt').map(&:to_i).sort
	maximum_jolt = adapters.last + 3
	adapters.push(maximum_jolt)

	# Track the number of options to get to a target jolt value
	# and default to 0. The first jolt value is 0, and can only
	# be reached in one way.
	options = Hash.new(0)

	require 'benchmark'

	def find_sum_of_uniques(candidates, check)
	skip = check / 2.to_f

	candidates.each do \|x\|
	next if x == skip

	candidates.each do \|y\|
	next if y == skip

Derk-Jan Karrenbeld SleeplessByte

Tooling I've written from scratch