Write an application that, given in input a list of domino pieces, calculates the chain with the highest value that can be built starting from one of the pieces. The starting piece is given in input to the application, too.
-
The starting piece has no special property, it’s just the algorithm entry point;
-
Each domino piece has two values, each one ranging from 1 to 10;
-
Values on a piece can’t be equal. I.e.: (4, 4) isn’t a valid piece, while (2, 4) is;
-
Two pieces can be connected in the chain if they share a common value;
-
Each piece can be used only once in the chain;
-
When two pieces are connected, the common value is elided and the couple acts like a piece whose values are the non-common ones. I.e.: (1, 5) - (5, 3) is a valid connection. To connect a third piece to the chain, it must have a 1 or a 3, since the value 5 cannot be used to extend this chain;
-
The value of a chain is computed by summing the common values between connected pieces. I.e.: (7, 1) - (1, 5) - (5, 3) - (3, 2) has a value of 1 + 5 + 3 = 9;
-
Application can be either a command line application or a web application with a REST api. Bonus point for building a REST api;
-
Use maven to define the project;
-
Use Spring framework to connect the pieces of the application. It is not mandatory to use Spring Boot
-
Write JUnit tests. Good test coverage gets bonus points.