Microsoft:

________________________________________________________________________________
________________________________________________________________________________
_______
Round 1 : Objectives
Round 2 : 2 coding questions.
1) Given a array and an integer k, find the total number of unique integers pres
ent in all the subarrays of size k.
Eg:
IP: {3,2,2,1,5,6,6} and 4
OP: 10
2) Given a 2D array and a robot with an initial energy has to move from top left
to bottom right of array. Each value in array represent energy drop for being i
n that position (If negative value is present then energy will be incremented an
d If the value is zero, the energy is neither incremented nor decremented). Find
the minimum initial energy required by the robot such that the energy NEVER BEC
OMES LESS THAN OR EQUAL TO ZERO at any time.
Eg:
IP: {0,-1, 4, 5
6, 6,-2, 1
0,-5, 2, 0}
OP: 4
Explanation:(Number in paranthesis represents the energy at each stage)
0(4) -> -1 (5) -> 4(1) -> -2(3) -> 2(1) ---> Optimal way
________________________________________________________________________________
________________________________________________________________________________
_______
PayPal:
________________________________________________________________________________
________________________________________________________________________________
_______
Round 1 : Objectives
Round 2 : Coding
1) You have infinite supply of 1,2,5,10 and 25 valued coins. You are given 'n',
find the minimum number of coins with which you can represent 'n'.
Eg:
IP: 61
OP: 4 //(25+25+10+1)
Round 3 : Technical Interview - 1
1) Find the middle element of linked list in a single pass.
2) Optimize my solution at previous round
3) DBMS: A query invloving multiple subqueries and a query involving Joins.
________________________________________________________________________________
________________________________________________________________________________
_______
FlipKart:
________________________________________________________________________________
________________________________________________________________________________
_______
Round 1 : Coding
1) There is a progress bar which will show the percentage values only as whole n
umbers. Given the download time in terms as HH:MM:SS, find the no of increments

in which it is filled.Note that the progress bar wont show 0% and 100%.
Eg:
IP: 00:10:00
OP: 99 (1% for each 6 secs)
IP: 00:14:00
OP: 19 (5% for each 42 secs)
2) There are p treadmills and n persons, each person will work-out in a treadmil
l for 5mins for 2 times (i.e., 10 mins with a gap). Given n and p find the minim
um time required for all the persons to complete the work-out.
Eg:
IP: 2 3
OP: 10
IP: 3 2
OP: 15
Round 2 : Coding
1)Given the description of the field in terms of 'N' and 'Y'. 'Y' represents gra
ss and 'N' represents bare land. A region is formed by connecting all the grass
together. Every region can be used to feed a sheep or cow. Given the description
of the field find the number of ways in which they can be fed such that the num
ber of sheeps are always even.
Eg:
IP: 3 4
// No of rows and columns
YNNN
NYNY
NYNY
OP: 4
________________________________________________________________________________
________________________________________________________________________________
_______
Endurance:
________________________________________________________________________________
________________________________________________________________________________
_______
Round 1: MCQ [Technical Apti]
Round 2: Coding
1) Simulate a terminal window using C/CPP/Java and implementing grep, cat, pipe,
sleep, multiple pipes, etc. without any system calls.
________________________________________________________________________________
________________________________________________________________________________
_______
Accolite:
________________________________________________________________________________
________________________________________________________________________________
_______
Round 1: MCQ [Technical apti + Quants]
Round 2: Coding
1) Print the MS-Excel column name corresponding to the given number.
Eg:
IP: 5 27 678
OP: E AA AAB

2) Given a pyramid of numbers in a 2D array, print the elements in the shortest

top to bottom path.
Eg:
IP:
{ , , , 5, , , ,
, , 1, , 6, , ,
, 2, , 1, , 4, ,
4, , 2, , 6, , 1
}
OP: 5 1 1 2
________________________________________________________________________________
________________________________________________________________________________
_______
Xome:
________________________________________________________________________________
________________________________________________________________________________
_______
Round 1: MCQ [Technical]
Round 2: Coding
1) Swap kth element from beginning and kth element from end of the linked list.
Pointers must be swapped and not the values alone.
2) Given an array of n elements, each element in an array denotes the max. numbe
r of positions it can jump forward. Find the minimum jumps needed to reach exact
ly the end of array.
Eg:
IP: {1,3,5,8,9,7,1,8,3,6,9,2}
OP: 3
Exp.: 1 -> 3 -> 8 -> 2 [Three Jumps]
3) Given a binary tree and a random node, find the nearest leaf to that node.
Eg:
IP: 8
6
/ \
1
8
/ \
\
5 3
11
\
\
7
2
\
4
\
9
OP: 3
Exp.: Only 2 nodes between 8 and 3 [6,1]
Round 3: Technical Interview
1) Given an array of integers, print all the combination of strings correspondin
g to thaose numbers.
Eg:
IP: {1, 2, 4, 1, 3}
OP: abdac [1,2,4,1,3]

ldac [12,4,1,3]
ldm [12,4,13]
axac [1,24,1,3]
axm [1,24,13]
2) Given a special array such that every element will be either 1 greater or 1 l
esser than the previous number. Find the index of a number in such an array.
Eg:
IP: {5,6,5,4,3,2,3,4,5,6,7} 2
OP: 5
________________________________________________________________________________
________________________________________________________________________________
_______
Chronus:
________________________________________________________________________________
________________________________________________________________________________
_______
Round 1: MCQ[Technical + Quants]
Round 2: Coding
1) Given a paragraph and a set of words, find the smallest substing of paragraph
such that the substring contains all the given set of words (Words may not be i
n the same order as given).
Eg:
IP:
"The quick brown fox jumps over the lazy dog" is an English-language pangram a phr
ase that contains all of the letters of the alphabet. It is commonly used for to
uch-typing practice. It is also used to test typewriters and computer keyboards,
show fonts, and other applications involving all of the letters in the English
alphabet.
all commonly letters used
OP: all of the letters of the alphabet. It is commonly used
2) Generate a numeric palindrome [0-9] of given length with a constraint that no
two same numbers be adjacent to each other.
Round 3: Technical Interview - 1
1) a)
b)
c)
d)

Find the second smallest element in an array.

Modify the code that it can support the duplicate values.
Extend the code to find the k'th smallest element in an array.
Optimize the code for minimum comparisons and using only 'k' memory space.

2) Design a relational database for a social network similar to facebook.

3) Write queries to retrieve records from the above created database that follow
conditions specified by the interviewer.
Round 4: Technical Interview - 2
1) Database related questions
a) Why many social websites use non-relational Db's.
b) Disadvantage of using relational Db.

c) Negatives of joins in RDBMS.

And some more questions I don't remember.
2) Questions on technologies used in my projects.
Round 5: HR Interview
Typical HR questions. :)
________________________________________________________________________________
________________________________________________________________________________
_______