Technical interview: >> How would you count the number of 1's in an integer. The question was not as simple as this. Lot of follow-up questions on how I would test this function, edge cases, different types of binary representations etc. On site questions: >> Linked list - reverse ONLY from nodes begin to end (begin, end) will be integer values >> Next right pointers. Did it with both single queue and with two queues q1 and q2 and swapping them. Follow up - how do you cut down on memory. >> All positive integers on left, negative on the other side - follow up was to modify it to a templated function >> Given a string "Hello World", split all words. This was a programming session on the interviewer's computer (not whiteboard). There will be ONLY space as delimiter. If a service can be called up to max of 5 times, how do you make sure it is handled. I answered "sempahores".
