Sollicitatievragen voor Full stack developer gedeeld door sollicitanten
Define the domain model for a system dedicated to CRUD operations on graphs, together with at least the implementation for the all-paths algorithm. The objects the system work with are all fully connected graphs. This was an home assignment with a couple of days of time. As I am a medior developer already mastering the main target language, Scala, the focus was on the abstractions and big pictures rather than the actual code. Less experienced candidates were given the same assignment but with more time, so that they could produce a fully-working prototype and explore points like persistency.
I model this in Scala and given the fact that the entity to be modeled was complete graphs it is not too difficult, for example the graph is represented just by the grade and the cycle detector is constant to true. It turned out that they didn't mean complete graphs exactly, and that I was the first candidate to take the term literally, which is for sure a good point. Things get a little trickier for the all paths. It is really fun if you try to code it yourself so I won't give it out, but a hint is that you don't need *FS algos at all and that it comes up really nice if recursive.
In the first interview, a sketch of the architecture of the product is presented to me, and the question is what would I do to tackle a bottleneck between two of the components. In this scenario basically, which is something they had to deal with themselves for real, a consumer cannot keep pace with a producer.