Had one on campus interview.
Then 4 rounds of 1-1 interviews in Seattle, Redomond office.
It was for SDE and all were programming questions.
i)doubly linked list pairwise swap
ii) 2D matrix with nums increasing in right direction and downwards direction. Search for a target number.
iii) a. N length integer array. numbers in the range 1-K. (K < N). Find the numbers that are present w/o using extra memory and should not change the array.
b. code Graph coloring problem.
iv) one easy question on cards ranking in poker. some additions to it as the coding was done.
