search

guardian / coding-exercises

Coding exercises
447 stars 175 forks source link

Add castellers problem #26

Closed thomaska closed 4 years ago

thomaska commented 7 years ago

This a variation of a relative popular interview question of finding the longest subsequence based on multiple criteria. It has many solutions, mainly recursive ones. Attached you will find one in Java.

cc @jennysivapalan

jennysivapalan commented 7 years ago

Sounds interesting! Let's ask a few people in the department to pair and give feedback on this exercise.

paulmr commented 7 years ago

I really like this addition to the tests. It is also nicely written and fun to read! I wonder if we should consider adding some further steps to it, in case a candidate gets through the first bit quickly. Perhaps we could have a large data file and ask them to run that through their implementation, which would force them to think about the efficiency of their implementation (asking them about this subject would probably also provide a good talking point). We could implement this as a test case in the skeleton repo, possibly. It would be interesting to see how candidates fair with this under pairing test conditions as it probably requires quite a lot of clarity of mind and composure: qualities that it can be difficult to summon during an interview.