last day (2386 days later) » 

kit
kit
16:08
Ok I had to do some research on the problem. So a matrix of: 
[ [0 5 6]
, [1 4 7]
, [2 3 8] ]
The longest non-self-intersecting path for this example would be of length 9 ? I wanted to make sure I understood the challenge.
user21820
user21820
Yes correct.
And for say:
kit
kit
Awesome
user21820
user21820
[[3,2,4]
,[5,1,4]
,[5,5,5]]
The answer would be 8.
kit
kit
@user21820 Oh maybe I don't understand it.. What is the exact sequence for this? I thought it was [1,2,3,5,5,5,5]
user21820
user21820
@kit That is one path, but there is a longer one.
kit
kit
16:15
Oh, what's that for that example?
oh, nm
user21820
user21820
=)
kit
kit
I see it
user21820
user21820
Okay I need to go, so it's a good time to stop. Next time I look forward to seeing your solution!
kit
kit
16:31
@user21820 Thank you. I'll have it done probably later today as i haven't used python much in some years. Thanks for your explanations!

  last day (2386 days later) »