You are given two sets of integers, sizes M and N with M < N. Perform inner equal join on these two sets (i.e., find intersection of the two lists). How to perform it if both the lists are in files and the available memory is of size K < M < N.
what is your worst fear?
What is the sticky bit and why is it used?
Write a function to determine if a string (consisting only of parenthesis) is balanced.
Questions about Network: Subnet, linux command for networking, windows command for networking, OS X commands for networking ( for example ifconfig, route, tracert etc...)
In a dir. name containing an arbitrary number of "/.." parts, like "/a/b/c/d/../../e" implement an algorithm that removes all instances of /.. along with the preceding directory, to reduce away all /.. syntactically. Now adapt the algorithm to be run on a VERY long string, which must be broken into pieces and solved using MapReduce. Yeah, not trivial.
OOP questions along with some coding technical questions and ones relating specifically to the web.
Why did you decide to do a double major?
Why do you want to work for ResMed?
Tell me about yourself?
Viewing 1941 - 1950 interview questions