# Hamming

Easy

## Instructions

Calculate the Hamming Distance between two DNA strands.

Your body is made up of cells that contain DNA. Those cells regularly wear out and need replacing, which they achieve by dividing into daughter cells. In fact, the average human body experiences about 10 quadrillion cell divisions in a lifetime!

When cells divide, their DNA replicates too. Sometimes during this process mistakes happen and single pieces of DNA get encoded with the incorrect information. If we compare two strands of DNA and count the differences between them we can see how many mistakes occurred. This is known as the "Hamming Distance".

We read DNA using the letters C,A,G and T. Two strands might look like this:

GAGCCTACTAACGGGAT
CATCGTAATGACGGCCT
^ ^ ^  ^ ^    ^^

They have 7 differences, and therefore the Hamming Distance is 7.

The Hamming Distance is useful for lots of things in science, not just biology, so it's a nice phrase to be familiar with :)

### Implementation notes

The Hamming distance is only defined for sequences of equal length, so an attempt to calculate it between sequences of different lengths should not work.

### Running and testing your solutions

#### From the command line

Simply type 8th test.8th. It is assumed that the 8th binary is declared in the PATH environment variable.

#### From a REPL

Start 8th loading test-words.8th: 8th -f test-words.8th. This will start a CLI session where, once youâ€™ve written some code in your solution file, you can load it with "hamming.8th" f:include and you can run the tests with "hamming-tests.8th" f:include or you can copy and paste a single test from that file or enter your own.

#### Editing the hamming-tests.8th file

This is encouraged at the beginning of your journey. Insert a back-slash space before all but the first one or two tests. Write your code to solve the first test or two. Then progressively enable more tests until you can pass all of them.

Edit via GitHub