Given a char matrix, and an array of words, find the total number of occurrences for each word in the matrix (the occurrences of each word in the matrix summed together).
NOTE: When finding the word, you can only switch directions once (for each time you search the matrix for that word).
example:
a b c d e
r a c e a
b b s e a
on row two, (lets say the word we are looking for is racecar), we can change directions once (after visiting r, a, c, and e, to get c, a, and r again)