Algorithm/Data Structure Design Interview Questions -


what simple algorithm or data structure related "white boarding" problems find effective during candidate screening process?

i have simple ones use validate problem solving skills , can expressed have opportunity application of heuristics.

one of basics use junior developers is:

write c# method takes string contains set of words (a sentence) , rotates words x number of places right. when word in last position of sentence rotated should show @ front of resulting string.

when candidate answers question see available .net data structures , methods (string.join, string.split, list, etc...) solve problem. them identify special cases optimization. number of times words need rotated isn't x it's x % number of words.

what of white board problems use interview candidate , of things in answer (do not need post actual answer).

i enjoy classic "what's difference between linkedlist , arraylist (or between linked list , array/vector) , why choose 1 or other?"

the kind of answer hope 1 includes discussion of:

  • insertion performance
  • iteration performance
  • memory allocation/reallocation impact
  • impact of removing elements beginning/middle/end
  • how knowing (or not knowing) maximum size of list can affect decision

Comments

Popular posts from this blog

windows - Why does Vista not allow creation of shortcuts to "Programs" on a NonAdmin account? Not supposed to install apps from NonAdmin account? -

c++ - How do I get a multi line tooltip in MFC -

unit testing - How to mock PreferenceManager in Android? -