Thursday Code Puzzler: A Variation on Wordsearch
It's Thursday, so it's time for another code puzzler. The idea is simple: solve the coding problem as efficiently as you can, in any language or framework that you find suitable.
Note: Even though there really is nothing stopping you from finding a solution to this on the internet, try to keep honest, and come up with your own answer. It's all about the participation!
Find the Word
This week the challenge is to find a word in a two-dimensional array. The word can go in any direction, once it is connected (vertical, horizontal, diagonal, backwards). An example array would be
'e','s','a','s','j' 'w','n','v','o','9' 'r','s','o','i','a' 'y','s','s','z','a' 'e','s','r','a','d'
In the above you can find the word 'dzone'. Write a program that can take any string and find it in the 2D array - you can use the example of finding 'dzone' in the above input first. And don't forget, efficiency is everything
Catch up on all our previous puzzlers here