Joël Quenneville JoelQ

Problem

You have a graph where the nodes are in groups. You want to create edges between all nodes that are in different groups.

For example, given the following groups:

[[1, 2], [3], [4, 5]]

Decoder Challenge

Refactoring maybe code in Elm

Given this ugly series of cases:

optionalFormattedFriendAddress : Maybe Friend -> Maybe String
optionalFormattedFriendAddress maybeFriend =
  let
    maybeAddress = case maybeFriend of
      Just friend -> Just friend.address

A Darwinian Nightmare

It seemed to have stepped right out of the pages of a horror novel. The mutant shape-shifter struck without warning, defying a mere mortal's attempts to detect it. It seemed to distort the fabric of reality itself. And it was going to ruin my job interview.

We've all encountered this monster at some point. Like many classic monsters, it is our own creation. Every year it devastate projects worldwide. The fearsome mutation bug is an expert at hiding and altering your programs in subtle and

Square-Sum Challenge

Write out the numbers 1-15 such that any two numbers in the series add up to a square number

Inspired by https://www.youtube.com/watch?v=G1m7goLCJDY

Possible squares

There are 6 possible squares that can be made by adding two numbers under 16:

List of helpful Ellie's I've written

I often write Ellies to demo an idea or to share a solution with someone on Slack. Some of them are helpful enough to share many times so I keep a reference to them here. Others are just cool so I want to save the link 😎

	class Hamming
	def self.eager(s1, s2)
	s1.chars.take(10).
	zip(s2.chars.take(10)).
	count { \|c1, c2\| c1 != c2 }
	end

	def self.half_lazy_args(s1, s2)
	s1.each_char.take(10).
	zip(s2.each_char.take(10)).

	-- Maybe

	map2 f v1 v2 = Just f \|> andMap v1 \|> andMap v2
	map f v1 = Just f \|> andMap v1
	map0 f = Just f

	-- List

	map2 f v1 v2 = singleton f \|> andMap v1 \|> andMap v2
	map f v1 = singleton f \|> andMap v1

	-- GIVEN

	type MyList a
	= Cons a (MyList a)
	\| Empty


	add : Int -> Int -> Int
	add a b =
	a + b

	class EmptyList
	def prepend(value)
	List.new(value, self)
	end

	def inspect
	"()"
	end

	def map(&block)