Interview Question for Software Engineer Test at Google:

Onsite Interview 1 a): Write a program to check whether a number is prime . Additional constraints consider negative primes etc. b) some kind of list merge problem A list of lists eg : [A,B,C] // unsorted A= [1,2,3] B=[2,3] C=[1,2] Start with List in reverse alphabetical order eg:C merge with B removing duplicates then merge this with A doing the same . Optimize solution c) Intersection of two Integer lists ?