spiral.md

Spiral Path

Write a function called "spiral" that takes an NxM array as input and returns a "spiral" path through the array, starting in the upper-left corner and moving clockwise. Use the language of your choice.

For example (in Ruby), if

array = [[1,2,3],
         [8,9,4],
         [7,6,5]]

then

spiral(array) # => [1,2,3,4,5,6,7,8,9]

It should work on any NxM array, so don't assume the input is a square array. However, every row will have the same number of elements.

Your Solution

So there aren't any spoilers, if you decide to solve it please fork this gist and link to the fork in a comment. :)

Spoiler Alert!

I can't fork my own gist, so here is my solution: https://gist.github.com/jfarmer/d0f37717f6e7f6cebf72

brute force: https://gist.github.com/mjhea0/74b3e9d9e4b187b2754e

https://gist.github.com/TalkativeTree/6724065

@talkative - similar to your's - https://gist.github.com/mjhea0/2f38deba4ba36870a502

i'd like to move it back into a loop. perhaps tomorrow.

Similar to yours, but not as elegant: https://gist.github.com/O-I/56d3049d9d99de965383

Longest one... https://gist.github.com/eriols/d8ccdaf17e35043991d9

did it C# in the end https://gist.github.com/adeogun/5b96b71e4e5fc2e7906f

Second week of coding school at General Assembly with @tibbon, working with Ruby: https://gist.github.com/abigezunt/9a39f5196e1c5ce4b85a