Collated Interview Questions

8/2/2019 Collated Interview Questions

1/14

Questions..1) You are given a convex polygon and an additional point. You know the x and y co-ordinates of all vertices of the polygon and the point. Find if the point is one of the

vertices of the polygon in O(log N) time.

Still thinking...

2) You are given an array of N numbers and a integer x. You have to find the pairs whosesum is equal to x in n log (n) time.

Ans2. Am giving you the pseudo codeFirst sort the array of N numbers ---> O(n log(n))

Now find distinct numbers in the array and also store the frequency of each distinctnumber in a separate array. This can be done in one pass over the sorted array

and using two more arrays.So if sorted array was -1,-1,0,0,0,1,3,4,4 the array with distinct numbers is

-1,0,1,3,4 and corresponding frequency array is 2,3,1,1,2. --> O(n) Let these be

named A[] and B[].count = 0

For each number y in A[] starting from i = 1 ---> O(n)Binary Search for number (x-y) in array A ---> O(log(n))

If present, then we have at least one pair,let index of (x-y) be j

if (A[i] != A[j])count = count + B[i]*B[j] ---> O(1)

else

count = count + (B[j]-1)*(B[j])/2set B[j] = 0 ( so that these pairs are not counted again )

3) If i < j and A[i] > A[j], the pair (i, j) is called an inversion. Find the inversions in anarray of N numbers.

4) There is an integer K. You are allowed to add to K any of its divisors not equal to 1

and K. The same operation can be applied to the resulting number and so on. The goal

is to: Given integers N and M, return the minimal number of the described operationsnecessary to transform N into M. Return -1 if M can't be obtained from N.

For example, notice that starting from the number 4, we can reach any compositenumber by applying several such operations. The number 24 can be reached starting

from 4 using five operations:4->6->8->12->18->24

Ans. Starting from N, do BFS search for M. Termination condition will be whenever Kbecomes larger than M, return

queue q1; // stores each K

queue q2; // stores distance of each K from Nq1.push(N); q2.push(0);

while (!q1.empty()){

int K = q1.front();


2/14

int c = q2.front();q1.pop(); q2.pop();

if (K == M) return c;if (K > M) continue;

for (int i = 2; i


3/14

if (places < 2){

I *= 10;F++;

}

return I/F;

}else if (0


4/14

11) How would you detect a loop in a linked list? Write a C program to detect a loop in alinked list.

12) How do you find the middle of a linked list? Write a C program to return the middle of

a linked list?

node * middle (node *head){

if (head == 0 || head->next == 0 || head->next->next == 0) return head;

node *p = head;node *q = head->next->next;

while (q != 0){

if (q->next == 0) return p;

if (q->next->next == 0) return p;q = q->next->next;

p = p->next;}

return p;

}

13) How to create a copy of a linked list? Write a C program to create a copy of a linkedlist.

node * copy_ll (node *head)

{node *p = (node *)malloc(sizeof(node));

if (head == 0) return p = 0;node *q = p;

while (head)

{

p->data = head->data;if (head->next == 0) p->next = 0;else p->next = (node *)malloc(sizeof(node));

head = head->next;p = p->next;

}

return q;}

14) Write a C program to free the nodes of a linked list.

void delete_link_list (node *head)

{

if (head == 0) return;node *q = head;

node *p = q->next;while (p)

{free(q);

q = p;p = p->next;

}


5/14

}

15) Compare two binary trees whether they are same or not?

16) Write a function to change a hexadecimal number to integer(htoi) ?

17) You have N computers [Ca, Cb] means a is connected to b and this connectivityis symmetric and transitive. Write a program which checks that all computers areinterconnected and talk to each other?

18) Binary search tree is given. Find the kth smallest element?

19) Divide a number by 3 without using any %, *, / operators. You can use atoi() function.

20) Find no. of trailing zeros in factorial(100)?

int two = 0;int five = 0;

void primeFactorize (int n)

{for (int i = 2; i * i


6/14


7/14

return nr/dr;

26) What is the space complexity of Quicksort algorithm? O(n)

27) You are given a biased coin. Find an unbiased decision out of it.

28) Three strings A, B, C are given. Check whether the 3rd string is interleaved from thefirst two.

A = "abcd" B = "xyz" C = "axbcyzd" Answer = "yes"

need to check if same number of characters and same characters are present in C.

29) Algorithm for finding the longest palindrome in a string.

keep shifting the centre of palindrome from 1 to n-1 and check for the largest palindrome

that can be made at that centre. Takes O(n^2)

int longest_palindrome (char *p)

{int dp[strlen(p)];

memset(dp,1,sizeof(dp));for (int i = 1; i < strlen(p)-1; i++)

{for (int j = i-1, k = i+1; j >= 0 && k < strlen(p); j--,k++)

{if (p[j] == p[k]) dp[i] += 2;

else break;}

}

int max = 0;

for (int i = 0; i < strlen(p); i++) max = max(dp[i],max);return max;

}

30) Given a dart board of radius 'r', if a dart is thrown on the board which always fall inside

assuming uniform distribution, find the expected distance from the center for where the

dart lands.

31) You have a linked list of unknown length 'n'. There is a element which is repeatedmore than n/2 number of times. Find the element using constant extra space and one pass

over the list.

32) You are shrunk to the height of a nickel and your mass is proportionally reduced so as

to maintain your original density. You are then thrown into an empty glass blender. Theblades will start moving in 60 seconds. What do you do?

33) You have a given binary search tree. Using this tree make a sorted doubly linked list

using the elements of the tree.

34) You have N steps to get down. You have two options: (a) either you come one stepdown (nth to (n-1)th), (b) or you directly jump to the 3rd step leaving one step in between

(say from nth to (n-2)th). Find the total possible ways in which one can get down.


8/14
http://www.orkut.co.in/Main#CommMsgs?cmm=22317&tid=2557101117192051897&kw=google+questionshttp://www.orkut.co.in/Main#CommMsgs?cmm=22317&tid=2557101117192051897&kw=google+questionshttp://www.orkut.co.in/Main#CommMsgs?cmm=22317&tid=2557101117192051897&kw=google+questionshttp://www.orkut.co.in/Main#CommMsgs?cmm=22317&tid=2557101117192051897&kw=google+questionshttp://www.orkut.co.in/Main#CommMsgs?cmm=22317&tid=2557101117192051897&kw=google+questionshttp://www.orkut.co.in/Main#CommMsgs?cmm=22317&tid=2557101117192051897&kw=google+questionshttp://www.orkut.co.in/Main#CommMsgs?cmm=22317&tid=2557101117192051897&kw=google+questionshttp://www.orkut.co.in/Main#CommMsgs?cmm=22317&tid=2557101117192051897&kw=google+questionshttp://www.orkut.co.in/Main#CommMsgs?cmm=22317&tid=2557101117192051897&kw=google+questionshttp://www.orkut.co.in/Main#CommMsgs?cmm=22317&tid=2557101117192051897&kw=google+questionshttp://www.orkut.co.in/Main#CommMsgs?cmm=22317&tid=2557101117192051897&kw=google+questionshttp://www.orkut.co.in/Main#CommMsgs?cmm=22317&tid=2557101117192051897&kw=google+questionshttp://www.orkut.co.in/Main#CommMsgs?cmm=22317&tid=2557101117192051897&kw=google+questionshttp://www.orkut.co.in/Main#CommMsgs?cmm=22317&tid=2557101117192051897&kw=google+questionshttp://www.orkut.co.in/Main#CommMsgs?cmm=22317&tid=2557101117192051897&kw=google+questionshttp://www.orkut.co.in/Main#CommMsgs?cmm=22317&tid=2557101117192051897&kw=google+questionshttp://www.orkut.co.in/Main#CommMsgs?cmm=22317&tid=2557101117192051897&kw=google+questionshttp://www.orkut.co.in/Main#CommMsgs?cmm=22317&tid=2557101117192051897&kw=google+questionshttp://www.orkut.co.in/Main#CommMsgs?cmm=22317&tid=2557101117192051897&kw=google+questionshttp://www.orkut.co.in/Main#CommMsgs?cmm=22317&tid=2557101117192051897&kw=google+questionshttp://www.orkut.co.in/Main#CommMsgs?cmm=22317&tid=2557101117192051897&kw=google+questionshttp://www.google.com/url?q=http%3A%2F%2Fwww.coders2020.com%2Finterview%2Fgoogle_interview_questions&sa=D&sntz=1&usg=AFQjCNERi6AbvU-VSidLmyOURMHHvnnY8Qhttp://www.google.com/url?q=http%3A%2F%2Fwww.coders2020.com%2Finterview%2Fgoogle_interview_questions&sa=D&sntz=1&usg=AFQjCNERi6AbvU-VSidLmyOURMHHvnnY8Qhttp://www.google.com/url?q=http%3A%2F%2Fwww.coders2020.com%2Finterview%2Fgoogle_interview_questions&sa=D&sntz=1&usg=AFQjCNERi6AbvU-VSidLmyOURMHHvnnY8Qhttp://www.google.com/url?q=http%3A%2F%2Fwww.coders2020.com%2Finterview%2Fgoogle_interview_questions&sa=D&sntz=1&usg=AFQjCNERi6AbvU-VSidLmyOURMHHvnnY8Qhttp://www.google.com/url?q=http%3A%2F%2Fwww.coders2020.com%2Finterview%2Fgoogle_interview_questions&sa=D&sntz=1&usg=AFQjCNERi6AbvU-VSidLmyOURMHHvnnY8Qhttp://www.google.com/url?q=http%3A%2F%2Fwww.coders2020.com%2Finterview%2Fgoogle_interview_questions&sa=D&sntz=1&usg=AFQjCNERi6AbvU-VSidLmyOURMHHvnnY8Qhttp://www.google.com/url?q=http%3A%2F%2Fwww.coders2020.com%2Finterview%2Fgoogle_interview_questions&sa=D&sntz=1&usg=AFQjCNERi6AbvU-VSidLmyOURMHHvnnY8Qhttp://www.google.com/url?q=http%3A%2F%2Fwww.coders2020.com%2Finterview%2Fgoogle_interview_questions&sa=D&sntz=1&usg=AFQjCNERi6AbvU-VSidLmyOURMHHvnnY8Qhttp://www.google.com/url?q=http%3A%2F%2Fwww.coders2020.com%2Finterview%2Fgoogle_interview_questions&sa=D&sntz=1&usg=AFQjCNERi6AbvU-VSidLmyOURMHHvnnY8Qhttp://www.google.com/url?q=http%3A%2F%2Fwww.coders2020.com%2Finterview%2Fgoogle_interview_questions&sa=D&sntz=1&usg=AFQjCNERi6AbvU-VSidLmyOURMHHvnnY8Qhttp://www.google.com/url?q=http%3A%2F%2Fwww.coders2020.com%2Finterview%2Fgoogle_interview_questions&sa=D&sntz=1&usg=AFQjCNERi6AbvU-VSidLmyOURMHHvnnY8Qhttp://www.google.com/url?q=http%3A%2F%2Fwww.coders2020.com%2Finterview%2Fgoogle_interview_questions&sa=D&sntz=1&usg=AFQjCNERi6AbvU-VSidLmyOURMHHvnnY8Qhttp://www.google.com/url?q=http%3A%2F%2Fwww.coders2020.com%2Finterview%2Fgoogle_interview_questions&sa=D&sntz=1&usg=AFQjCNERi6AbvU-VSidLmyOURMHHvnnY8Qhttp://www.google.com/url?q=http%3A%2F%2Fwww.techinterviews.com%2Fgoogle-interview-questions&sa=D&sntz=1&usg=AFQjCNEckcg6pkmbGG-1vlJF90PlYsmYawhttp://www.google.com/url?q=http%3A%2F%2Fwww.techinterviews.com%2Fgoogle-interview-questions&sa=D&sntz=1&usg=AFQjCNEckcg6pkmbGG-1vlJF90PlYsmYawhttp://www.google.com/url?q=http%3A%2F%2Fwww.techinterviews.com%2Fgoogle-interview-questions&sa=D&sntz=1&usg=AFQjCNEckcg6pkmbGG-1vlJF90PlYsmYawhttp://www.google.com/url?q=http%3A%2F%2Fwww.techinterviews.com%2Fgoogle-interview-questions&sa=D&sntz=1&usg=AFQjCNEckcg6pkmbGG-1vlJF90PlYsmYawhttp://www.google.com/url?q=http%3A%2F%2Fwww.techinterviews.com%2Fgoogle-interview-questions&sa=D&sntz=1&usg=AFQjCNEckcg6pkmbGG-1vlJF90PlYsmYawhttp://www.google.com/url?q=http%3A%2F%2Fwww.techinterviews.com%2Fgoogle-interview-questions&sa=D&sntz=1&usg=AFQjCNEckcg6pkmbGG-1vlJF90PlYsmYawhttp://www.google.com/url?q=http%3A%2F%2Fwww.techinterviews.com%2Fgoogle-interview-questions&sa=D&sntz=1&usg=AFQjCNEckcg6pkmbGG-1vlJF90PlYsmYawhttp://www.google.com/url?q=http%3A%2F%2Fwww.techinterviews.com%2Fgoogle-interview-questions&sa=D&sntz=1&usg=AFQjCNEckcg6pkmbGG-1vlJF90PlYsmYawhttp://www.google.com/url?q=http%3A%2F%2Fwww.techinterviews.com%2Fgoogle-interview-questions&sa=D&sntz=1&usg=AFQjCNEckcg6pkmbGG-1vlJF90PlYsmYawhttp://www.google.com/url?q=http%3A%2F%2Fwww.techinterviews.com%2Fgoogle-interview-questions&sa=D&sntz=1&usg=AFQjCNEckcg6pkmbGG-1vlJF90PlYsmYawhttp://www.google.com/url?q=http%3A%2F%2Fwww.techinterviews.com%2Fgoogle-interview-questions&sa=D&sntz=1&usg=AFQjCNEckcg6pkmbGG-1vlJF90PlYsmYaw


9/14

51) Find the kth largest number in an array.

52) How would you test a distributed system

53) How would find the largest prefix in a group of strings. Convert the algorithm to find

the largest substring in a group of strings

54) Given a pre-order sequence of numbers, find a unique BST.

55) Given a dictionary of four letter words, find the shortest sequence of words leadingfrom one word to another. ex. CAT -> COT -> DOT -> DOG

56) Given an integer array A, derive an array that holds at index i, the product of all the

numbers in A except A[i].

57) Given a billion search queries coming in through the day, find the ones that are

unique. Consider storage space complexity also.

58) Given an integer array, reshuffle the contents such that any repeating integers are K

distance from each other.

Amazon

59 ) Linked List: Traversal of a node in singly & doubly linked list

60) Array: sorting of arrays / sorting algos (Heap sort, Merge sort)

61) Stack & Queue

62) Concepts like LIFO & FIFO

63) Complexity of algorithms64) Problem Solving: A scenario will given to you & you need to come up with solution in the form ofcode.

65) Find the largest integer in an array

66) How will you find out the difference between Binary Trees and Binary Search Trees? They wanted toknow how I will implement it? Complexity?

67) Write code to find the kth largest element in a Binary Search Tree. I wrote the c++ function, and thenwas debugging it for various edge conditions..

68) Find the first occurrence of an integer in an array. The best and worst cases. Write the code. Iexplained binary search, and wrote the function.

69) Find the width of a binary tree. I wrote the function for it.

70) He asked if I had built and tested a system end-to-end,

71) Tell some details about multi-threading programming. What is semaphore? Diff between thread andprocess etc etc


10/14

72) How search engine make index of documents? What data structure should you use? How do uindex a database for range finding query. Etc etc....Inverted map which maps tokens (strings) with the doc_ids in which they occur. A trie tree can be usedfor this purpose. Inserting all tokens and the end node storing doc_set.

73) Write a code to make canonical form a directory listing.74) Design and implement Least Recently Used based hash

- discussion on data structure to use, algo, unit test, etc

75) Select k smallest integer from n integer where n is very large and k is very small.

76) OS level Q: diff between user level thread vs kernel level thread, page replacement algo, etc.

77) Find the first common ancestor of two given nodes in a binay search tree.

78) using a function

int random(); //returns 0 or 1

implement a functionint rnd(int a , int b ); // which returns a random value between 'a' and 'b'

79) Difference between multi-processing and multi-threading.. and then he went into kernel level threads

and user level threads...> what would i chose for implementing a webserver (multi processing, or multi threading (user level orkernel level) and why?)

80) Design/architect a web portal for a library in a college:

>> What a re the types of users.. And functions that should be exposed to them>> The overall appplication structure>> The database schema (with the details of each table)\

81) Given a sentence reverse individual words. Write code and read out.

"This is Amazon" -> "sihT si nozamA"

82) Given array of n integers and an integer x, find whether there exist two elements in the array whosesum equals x.

83) Design Least Recently Used cache

84) Design chess game and send the class diagram to the given email address in an hour

85) Write a code snippet to simulate memory leak

86) Find whether a substring exists in the given string.

bool substring(const char *string, const char *substr);

87) Write a code to determine if a given binary tree is a binary search tree or not. Binary search tree is atree in which all elements to the left of a node are smaller and all elements to the right are bigger.

88) There is an external array of integers on which you can perform the following operations in O(1)time.

1. get(int i) - returns the value at the index 'i' in the external array.2. reverse( int i, int j) - returns the reverse of the array between index positions i and j (including i and


11/14

j).example for reverse: consider an array {1,2,3,4,5}. reverse(0,2) will return {3,2,1,4,5} and reverse(1,4)will return {1,5,4,3,2}.

89) Write a code to sort the external array. Mention the time and space complexity for your code.

90) Implement memcopy ( C library function) covering all edge conditions.

The signature was void memcopy( char *str, int src, int des, int num_elements);

91) To find the Least common ancestor of 2 given nodes in Binary Tree ( Note: Its a Binary Tree & not aBST)

92) Find the anagrams of a string.

93) Data structure being used while implementing dictionary.

94) To find largest palindrome in a given series of number in an optimized manner { eg:I/P:1345334433677699897 o/p :334433

95) Given a string. Fiind out the length of maximum length palindrome in that string.96) Given two strings s1 and s2. Remove all the characters of string s1 from s2.97) Given a stack of integers. Allowed operations -> push and pop. Define a function getmax() in O(1).98) Iterative preorder traversal of tree.99) Level order traversel of a tree.100) Given an array of million integers. Find out the smallest k elemenmt. Restrictions: Only a mainmemory for storing k integers + for some temporary variables is available.

101) Given a 2D m x n array of characters. Find out all the possible words that can be made from thatarray.

AMAZON::

Here you go

Phone screen 1-

- Tell us about yourself and your work- Tell us how you handle conflict in priorities

- How do you handle ambiguity in scope of projects

- What tools do you use ? Which one do you like and why? Which one dont you like?

- What was a failure of yours and what was the biggest learning from it

Phone screen 2-- Give an algorithm for an elevator problem.

- Traverse linked list, delete a pointer, identify circular linked lists, find common parent in a

tree

- Queries- simple query using group by on emp table and salary table


12/14

- nested query to sum up salaries by branch

- use outer join ( i didnt remember outerjoins but wrote a long nested query which the

guy said was ok but i am not sure)

On Site interviews

Round 1- Bar raiser interview

- Talk about your biggest project. Team size, team constitution, your role in the project,

interaction with external customers , final project result ( I talked about XP SP3 primarily) -10minutes

- Talk about the rhythm of communication that you maintain. Meetings vs emails vs

brownbags , how do you approach each one, what do you showcase in each? - 5 minutes- Imagine amazon and Delta airlines are tying up to enable Delta frequent fliers to reimburse

their points on amzn. You are the PM for the project . Talk about the value prop for amzn and

delta. What design would you use to build this? How would you broker the transfer of money/

points between amzn/delta ? 20 min- Call out the big points that you would list out in the spec for this project. How would you

drive scope lockdown and avoid scope creep? 15 min

Round 2-

- amzn hosts sellers on its infrastructure. Imagine that on your first day at work, you are told

that Sony wants to build a storefront on amzn. You do not know anything about amzn and you

have 1 week to gather requirements from Sony. What questions would you ask Sony. What

would you commit to Sony? - 20 min.- Once you are done with requirements, you find your primary dev is moving to another team. It

impacts deliverables. What would you do? - 15 min

- Sony wants an automated payment system. We still are moving to electronic interface- in yourfirst week at work, you have to find the teams responsible for the payment systems and get

them onboard to enable sony to be on EDI from day 1. Your strategy? - 10 min

Round 3- hiring manager/dev interview

- more basic questions on lists and trees- 20 min- implment min on a stack in constant time. You have push and pop available. memory is not a

constraint. - 10 min

- discussion on agile model- scrum meetings and packaged product offerings. hiring mgr was exmsft so it was a 2 way interaction. 10 min.

- talk about a feature you owned and drove. I talked about 1X for winpe and why it was a big

deal

Round 4- this was the worst interview. the interview was really bad and had no idea how to do a

pm interview

- define process/procedure in software. what do you prefer process or procedure? ( random


13/14

bullshit i gave for 15 minutes)- write code to identify the angle between hands of a clock

- write code to write a currency exchange api. You have to talk to bloomberg web api to get the

current exchange rate. Inputs are amount and currency code .

Round 5- role play interview

- You are brand new in amazon. On day one, a warehouse head calls you and says all shipmentsare failing . What will you do?

basically this was to see how you will deal with ambiguity and attempt to identify the root

cause of the problem.- now with the info you have gathered what will you do with the dev team?

- the problem turned out to be in another downstream system- how will you hand off to them?

- who will own closing the loop with the customer?

Round 6- this person was visiting from US and was a partner/principal types guy

- wtf are you leaving msft? there is no free coke here in amzn and everyone has to be on call!

- imagine that 9 years ago, you were the PM responsible to implement user recomendations

on amzn. it is proven that user recomendations reduces purchases in the short run. Finance isobjecting to this. What will be your strategy to get this feature accepted by everyone?

- what metrics will you measure during the above project? Once the project is implemented

what metrics will you track and report?

Round 7- BrianV was visiting and chatted with me for 10 minutes. It was more of a formality .

We talked about WinSE, about pankajl and about why amzn was the coolest place on the

planet :) .-

Hints..3) Follow merge sort procedure. While merging of two lists a (having the smaller indexed

elements) and b (having larger indexed elements), during the comparison just check fora[i]>b[j] and if it returns true, the pair (a[i],b[j]) is an inversion. (Vaibhav)

4) http://www.orkut.co.in/Main#CommMsgs.aspx?

cmm=22317&tid=5337675215358452091

typedef struct elementT

{ struct elementT *next;void *data;

} element;

int Push (element **stack, void *data);

int Pop (element **stack);int CreateStack (element **stack);

int DeleteStack (element **stack);
http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091http://www.orkut.co.in/Main#CommMsgs.aspx?cmm=22317&tid=5337675215358452091


14/14

Collated Interview Questions

Documents

Transcript of Collated Interview Questions