I wanted to do the same but couldn't be bother to format/type it

I agree, but IMHO it is easier to read, and work with it.

no need to use a dictionary as a card's code will be their index in a sorted list

Good job! ;)

Actually running your solution to test its speed it broke on one of the basic tests. Took me a little while to reproduce and understand but if you want to fully complete the kata you might want to check those variation of a basic maze:

your_nemesis = []

your_nemesis.append([
  '##########',
  '#        #',
  '# #####  #',
  '# #   #  #',
  '# # #^#  #',
  '# # ###  #',
  '# #      #',
  '# ########'
])

your_nemesis.append([
    '# ########',
    '# #      #',
    '# # ###  #',
    '# # #^#  #',
    '# #   #  #',
    '# #####  #',
    '#        #',
    '##########'
])

In these cases your program seems to think that the maze is unsolvable and returns [].

OK Folks,

After a cup of coffee I was able to remove a looping that was not necessary to run everytime.

Thanks

Dude, what´a Kata!
I´ve solved, but having trouble with Expired Time.
Checking all the Kata Test Cases, in my computer I solved all (basic, impossible, advanced) mazes in 7 sec.

Not sure how to handle this...
I am finding the path, than I find the Directions.

Any clue?

You are right!! I just read it again and notice the consecutive!!
Thank you!!

I haven't solved it yet, but maybe because they're not consecutive?

The Primes as a Result of the Longest Consecutive Sum I

Not sure why prime_maxlength_chain(100) = [41], ( 2 + 3 + 5 + 7 + 11 + 13 = 41 , (6 addens)) since
97 = sum([2, 3, 5, 7, 11, 13, 19, 37]) and has 8 addens.

Also has 8 elements (addens):
89 [2, 3, 5, 7, 11, 13, 17, 31]
83 [2, 3, 5, 7, 11, 13, 19, 23]

Hey neighlyd, thank you for your feedback.
I did it more as practicing. Since I had just learned OOP few days before writing it! ;)

Thank you for your comments!

I really like your use of classes here. It goes well above and beyond what the "kata" was asking for, but it demonstrates that you're thinking about future usage and portability.

I simply "solved" the problem, but didn't really consider what the implications for it were going forward. OF COURSE the user would want to have an address book coming out.

@JDeBolt, I really liked this Kata.
Can you provide all the build functions in the Show Kata Test Cases?

This will help me since all my codes have the tests on it.

Thank you!

Well done g964!
Yours Katas are always very challenging! Some times easy to solve, but hard to get the right performance!
I like it!

Thanks !