# Q1: Write a function to intersect two *sorted* lists (find common elements) # Write a method taking two lists as input, and returning a new list # You can assume you have a reasonable array/list class available (ArrayList, vector, python list, etc) # Ex: # l1 = [1,2,3,4,5] # l2 = [1,5,7,11,100] # result = [1,5]
# Q2: Same as Q1, but now assume there can be duplicates. The output should not have duplicates # Ex: # l1 = [1,2,3,4,5,5,5] # l2 = [1,5,7,11,100] # result = [1,5]
How much do you expect to make here? (Something to that extent.)
what is SQL DBA Funtions
What are two variables that are dependent but not correlated? For example, x and y=2x are dependent and correlated.
NLP challenge about finding semantic similarity of some 121 tweeter tags.
SDLC, encryption algorithms
Questions were not difficult at this level. Was about ones background at this level.
Can you go into more detail about the research you're doing at UVA?
How would you handle a problem that you cannot solve by yourself
Viewing 1 - 10 interview questions