You have a square matrix of unsigned integer values. Say, 5 + 5.
Each row of that matrix contains numbers from 1 to 5 (or to whatever length of the...
For further actions, you may consider blocking this person and/or reporting abuse
I didn't do #90, so I'll put my answer here. This is a really stupid, slow, "just works" algorithm. It checks every single possible path. I guess it's around O(n3)?
(Language is Haskell).
My solution using queue. Should be o(n).
Hey guys, Someone got mixed up a bit here. That was the 90# challenge, this one was suppose to be the one I've sent you later, with the bottles... :-)
Ah jeez... my bad here. 🤦♂️
You are absolutely right, Zohar!
Thanks for pointing this out, David! This was a mistake.