The only coding task was to submit an application that solved one problem from a given list of 3 problems. The chosen problem was a long list of things to do over a graph, the input file contained the graph description and the graph queries, they emphasize that the implementation should use good OOP practices and told me that if the input is bad or well behaved was something up to me and that I should write an inform about my approach.
Sigiloso
To solve the problem I used Floyd-Warshall with some minor modifications to allow knowing the minimum distance starting from a node and ending in the same node. I wrote a small parser for the input queries so you could throw "bad" queries at it and the application still can solve them. I used several patterns, including Prototype, Strategy, Command, etc