3 ms·
I'd think the combination of unnecessary complexity, esoteric syntax, etc. would do the opposite of appeasing interviewers, which might be a waste of time for y
by kranner 16y ago
I'd think the combination of unnecessary complexity, esoteric syntax, etc. would do the opposite of appeasing interviewers, which might be a waste of time for you overall.
Perhaps you could put together the most elegant solution (to your taste) of a well-known toy problem, and use that in such situations?
Online judges are eminently suited to this sort of task. They're a-dime-a-dozen these days. Heck, you'll find one in my profile!
- relix 16y agoI've implemented a solution to the maximal clique problem in a very elegant way, and have used that piece of code in the past, because it's optimal and quite small (about 100 lines). I guess that fits your description, so I've been on the right track all along. Thanks for your suggestion of online judges. I didn't know there was such a market for code-judges, interesting!
- RiderOfGiraffes 16y agoGiven that problem is NP-Hard I'd be interested to see your code.
- relix 16y agoIt's an implementation of the Bron-Kerbosch algorithm [1]. [1]: http://en.wikipedia.org/wiki/Bron%E2%80%93Kerbosch_algorithm http://en.wikipedia.org/wiki/Bron%E2%80%93Kerbosch_algorithm
- RiderOfGiraffes 16y agoThat link didn't work for me, this one does: http://en.wikipedia.org/wiki/Bron-Kerbosch_algorithm http://en.wikipedia.org/wiki/Bron-Kerbosch_algorithm Thanks.