I solved the Raindrops problem in Clojure.

This is my solution:

Where I used the code I wrote for the Prime factors kata in Clojure

You can nitpick my solution here or see all the exercises I've done so far in this repository.

# Garajeando

Record of experiments, readings, links, videos and other things that I find on the long road.

Registro de experimentos, lecturas, links, vídeos y otras cosas que voy encontrando en el largo camino.

## Thursday, August 28, 2014

### Exercism: "Prime Factors in Clojure"

I solved the Prime factors problem in Clojure.

You can check my solution in my previous post:

You can nitpick my solution here or see all the exercises I've done so far in this repository.

You can check my solution in my previous post:

You can nitpick my solution here or see all the exercises I've done so far in this repository.

## Wednesday, August 27, 2014

### Exercism: "Roman Numerals in Clojure"

I solved the Roman Numerals problem in Clojure.

You can check my solution in my previous post:

You can nitpick my solution here or see all the exercises I've done so far in this repository.

You can check my solution in my previous post:

You can nitpick my solution here or see all the exercises I've done so far in this repository.

## Tuesday, August 26, 2014

### Kata: Roman Numerals in Clojure

I've just done the Roman Numerals kata in Clojure.

I used this description of roman numerals, On Roman Numerals, and continued the kata to also convert numbers over 3000.

These are the tests using Midje that I wrote to test-drive the solution:

and this is the code:

It's possible to convert numbers over 3999:

To document the TDD process I commited the code after every passing test and every refactor.

You can find the commits step by step here.

It's been difficult to derive this recursive algorithm only using strict TDD, but it was also a lot of fun.

You can find the resulting code in GitHub.

I used this description of roman numerals, On Roman Numerals, and continued the kata to also convert numbers over 3000.

These are the tests using Midje that I wrote to test-drive the solution:

and this is the code:

It's possible to convert numbers over 3999:

To document the TDD process I commited the code after every passing test and every refactor.

You can find the commits step by step here.

It's been difficult to derive this recursive algorithm only using strict TDD, but it was also a lot of fun.

You can find the resulting code in GitHub.

### Exercism: "Scrabble Score in Clojure"

This is my solution to the Scrabble Score problem in Clojure.

I added some extra tests to complete the provided ones:

You can nitpick my solution here or see all the exercises I've done so far in this repository.

I added some extra tests to complete the provided ones:

You can nitpick my solution here or see all the exercises I've done so far in this repository.

Subscribe to:
Posts (Atom)