grot.md

#GROT interview question

Take a look at GROT game. Write algorithm that will find longest chain (return coordinates of start point). As sample input use:

sample = [
    ['u', 'd', 'u', 'u'], # ↑ ↓ ↑ ↑
    ['u', 'r', 'l', 'l'], # ↑ → ← ←
    ['u', 'u', 'l', 'u'], # ↑ ↑ ← ↑
    ['l', 'd', 'u', 'l'], # ← ↓ ↑ ←
]

Checks:

• problem solving
• data structure manipulation
• code organization
• code style (pep8, correct variables naming)

Hi. I would like to present my solution of problem:
https://github.com/dzon4xx/grot

Hi. I would like to present my solution of problem. Short enough to write on job interview:
https://github.com/dopiotrko/GROT-solution

And another solution :-)
https://github.com/akurczyk/GROT-Game-Solver

Yet another solution: https://github.com/pawel-slowik/grot-game-solver