4 ms·
You 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
by Cookingboy 14y ago
You 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.