3 ms·
I guess the question is, how do you design a programming problem that doesn't tie into specific domain knowledge? Even fairly general stuff like implementing b
by jiggy2011 14y ago
I guess the question is, how do you design a programming problem that doesn't tie into specific domain knowledge?
Even fairly general stuff like implementing balanced search trees will likely be biased towards younger candidates who are fresh from university.
- Cookingboy 14y agoYou can still do it, it doesn't have to involve a complicated CS topics such as self-balancing trees or graph theories or anything, but I've seen plenty of good algorithm questions that the solution involve nothing more than understanding of Strings and for-loops. You can also test the interviewee's knowledge of Big-O, time efficiency vs space efficiency, etc without going into obscure data structures.
- jiggy2011 14y agoBig O would be something I was much more familiar with out of university, although I could probably muddle through some basic questions around it. For loops that manipulate strings in various ways however is probably something that most programmers will have wrestled with reasonably regularly I imagine.