To - View - Info Inter Iit Placement 2017-2018
To - View - Info Inter Iit Placement 2017-2018
To - View - Info Inter Iit Placement 2017-2018
gl/LNWwuC
Important Instructions
To Add any question to this page, use
https://goo.gl/LNWwuC (Replica of this doc)
I’ll be adding those ques to this doc.
Companies List
SAP Labs MathWorks Microsoft Capital One Next Education Societe General
Rakuten
17/10/17 HSBC(IITM)
Queries
Black Rock??
The Flipkart case was to be out in IITG on 16th (today). Could someone share
the case here?
https://docs.google.com/presentation/d/1zOVS63rO-
POvXI4Y_fHMxXQpdnN1XHMqafgHBDzeUsU/edit#slide=id.gd1a4321ff_2_23
-1) Please make Separate page/sheet(inserted) for CTC, Cash-in-hand, Joining bonus,
Service Bond, Job Profile, Location
Please add CGPA criteria also(added, btw this doc is editable. You could have added it)
Make use of this sheet: https://goo.gl/Zyf3ZY
This sheet is not editable. - Now ?
2) Can Anyone give the contest link of Flock(DirectI) if available? it works during contest only.
Well they will repeat the questions so just go through what is mentioned in the doc.
3) Has Visa or Goldman Sachs conducted test in any IIT? Is there a minimum CG criteria for GS
? No
IISc-Test is today (25th oct) - Please post the questions!
IITR- Test on 28th Oct (GS or Visa ????) GS
IITK - Test on 28th Oct (GS)
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
4) Is Oracle open for only CS?-NO, oracle is offering three profiles 1-for CS,EE other two for
cs,ee,civil,mech and some other dept
7) Flipkart has offered only Associate Product Manager (APM) position so far in IIT Guwahati. Is
Flipkart visiting for APM and SDE profile in any IIT?IITB IITR IITK IITD IIT BH Yes both profile
in IITB and IITR and IITM also
Is it true that Flipkart won’t be visiting IITG for tech roles this year?
False. Flipkart SDE just opened for CS/ECE/EEE/M&C.
9) Qualcomm Anyone ??
Visiting IITG on 10th October.
12. Has Tower Research and Goldman Sachs conducted tests in any IIT? If yes, please post the
questions especially quant part. For GS All IIT test on 28th.
Ans 14) Answer Moved to J P Morgan Page. Cant see JP Morgan qs??guys please update
(Some info got updated, which is moved to JP Morgan page)
24) Anybody have idea about Goldman Sachs written test shortlisting process? Scoring
more in one section is better or average in two ?
More in 1
There were even people in the top of shortlist who had entirely skipped one section
26) Has Mercari visited any of the IITs in any of the previous placement season ?
IITB 15th oct -- I am not asking regarding this year, I want to know previous year’s
record (check the docs avail in the pinned post of our Fb group) It has 2015 -16
Coming for the first time in IITB,most probably first time in any IIT. Yes, it is their first
time in India.
27) IITK,M is done with HSBC, so plz tell the pattern and if any other IIT is also done with it
plz tell.
28) Is JPMC coming for analyst profile in other IITs? (They are giving CTC 16.75 in IITR open
only for circuit branches)
Ans. 3 profiles in IITB including technology analyst
29) Myntra anywhere?? Not here in IITG,IITK, IITR-yes
30) CGPA criteria of Walmart, JP Morgan, and Oracle??
Ans JPMC, no CGPA criteria in IITB
31)Has Juniper conducted test in any IIT? // it is done with IITK
33) Mathworks Test in any IIT ?IITG Test on 20oct (Support profile)
37) Arethere any hidden test cases? Like after we have submitted and
clear all the test cases, do they run more and heavy testcases later? o.O
42)Microsoft in any IIT?? If yes post the questions. IITR-23oct, IIT BHU-3rd Nov
44) Will Mckinsey visit campuses this time or one will have to apply off
campus ?
51) When is Exl visiting other IITs? please update the dates
Also, IIT ROORKEE guys, someone please provide the questions.
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
55) IITM guys can anyone provide simplified solution to the Knapsack,
(Directi) IITR have its test at 4:30 ????????? urgent
56. Does Direct i also take our codechef profile into account?
57. Estee Advisors and Voltaire Capital test anywhere except IITD? If
done please post questions
62) Has AXTRIA visited any of the IIT till now? If yesPlease post the
pattern and questions.
63)Rakuten questions and what is the duration,platform for the test
Goldman Sachs
Note about test - held on Hackerrank, you are allowed to switch between sections. Each section
has a separate timer, which will stop when you switch. One strategy could be to sacrifice some
section (ML, since it was shit) and use that time for the other questions. Two sections can be done
fully if you have some luck and you manage your time properly. Also note, GS will not use the entire
test result to shortlist. Different teams will look at different things, so if you do really well in one
section or two sections, you have a good shot at interview.
CS - 60 minutes, 5 MCQs, 2 coding questions. Each MCQ was +10/-3, Coding questions were +20,
+30 with partial marking (although it wasn’t specified how much, and Hackerrank does show how
many test cases passed)
Coding questions :
(30)
You are given a list of n tourist bookings (start date, duration), and the total number of tourists that
can simultaneously be in the country. When processing bookings, you have to check if the current
number of tourists existing are more than number allowed, and if so, deny the booking. O(n^2) was
obviously giving TLE, it is possible to do it in O(nlogn)
Similar : https://www.interviewbit.com/problems/hotel-bookings-possible/
Can someone explain how to do this ??
What i did -->
1. created an array of size 1000
2.If A[start] < threshold then add 1 from start till end(of that particular tourist). And do num++.
3.At last return num.) what was wrong with my approach ?? It passed sample input but not even 1
test case :( !!! please help.
Exactly same issue with me! Wasted 30+mins on it. ALso tried sorting, without sorting, trying for all
days instead of only A[start]. I thought it would TLE. But it kept giving WA
:(
MCQs :
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
1) You are given a BST (filled with some 6-7 values), and the question was that how many
input orders could be given such that you end up with the same BST. (As in, you are given a
stream of input and you make a BST out of them normally without balancing etc, how many
streams will give same BST) Ans: 48- Shouldn’t the answer be 96 ? The answer was 96.
How? It was 48 only.
2) We wish to solve Sudoku filling using graph coloring, by putting edge between nodes that
can’t have the same number. What is the minimum number of nodes in this graph? Ans: 810
3) Given a number (n bit long), what is the complexity of finding if the number is a power of 2?
Ans - O(n) (stop correcting this to O(1). N is the number of bits in the number, you
have to check every bit to see if it is 1 or not, since any of them could be 1 and the
rest 0)
The answer is O(1). // return n && (!(n & (n - 1))); <- this is O(n)
operation. Here, n is the number of bits!
(I think ans is O(1). We only have to check if MSB of n and (n - 1) are same. If same then
ans is No else Yes. any thoughts?) Yes!! Answer is definitely O(1) and given above. (Doing n - 1 is
a O(n) operation in the number of bits. Stop confusing yourself for this.)
No, bitwise AND will be linear in the number of bits, hence it is O(n) i think. <- you’re right
^^ this is wrong, all binary operations and operators take O(1) time.
4) What is the extra space complexity for maintaining next min element in a
stack.http://www.geeksforgeeks.org/design-a-stack-that-supports-getmin-in-o1-time-and-o1-
extra-space/ Ans O(1)
5) What is a possible output for n |= n>>1, n|= n>>2, n|= n>>4, ... n|= n>>16, cout<<(n>>1)
Ans: 127
Notes : They were not ML, mostly statistics type. Went pretty shit for anyone who knew only CS
type ML. Majak tha ML wala section. <- as in kisi ka nahi hua, not ki sabka ho gaya majak tha.
7) In time series, which method is used for testing? Window method, Shuffling method or k-fold
cross validation. Ans - should be window I think, because everything else will destroy
sequential nature of dat
8) Another question on cosine similarity. Matrix of MxN. Whether the similarity would lie
between [0,1] or [0,1) based on whether the rank of matrix was N and M>N. -
9) Given that there are two coins of bias p and q, you define “event” as choosing a random
coin among the two, and then tossing them thrice. Given outcomes as {HTT} and {TTH}, do
expectation maximization once to find values of p, q. Start with p = 0.4, q = 0.8
Quant - 10 questions. 9 MCQs and one numerical type, all were +10, the MCQs had -3, numerical
had no negatives.
Notes : All probability based. Make sure you practice linearity of expectation and random variables.
Otherwise a bit of revision of 11th/12th JEE type questions.
1) Straws weigh a random amount in unif(0,1). A camel can take a total weight of 1 before its
back breaks. What is the expected weight of the last straw that breaks the camel’s back.
Ans : 2-2/e = 0.64
2) What is the expected number of straws that can be placed before the camel’s back is
broken Ans : e
3) Geometry question, obtuse triangle ABC was given (B being the obtuse angle). D was
midpoint of BC. Angle ADB = 45, Angle ACB = 30. Find tan B Ans: -2-sqrt(3)
4) Matrix was given, entries in first row were cos 1, cos 2, cos 3, ... and so on, for n^2 entries.
What is the limit as n tends to infinity of the determinant. Ans: 0
https://math.stackexchange.com/questions/1003453/a-limit-determinant-question
5) M, N are drawn from unif(1,100) integers. What is the probability that 7^m + 7^n is divisble
by 5. Ans : 0.25
6) What is the probability that the first toss was heads given that r heads were observed in n
tosses of a fair coin Ans : its r/n
7) A and B play a game with each other. P(A wins) = 2/3. The loser of each round gives the
winner 1$. What is the expected number of rounds they will play if A starts with 1$ and B
starts with 2$. Ans : 15/7
8) Another determinant simplification problem, you had to do basic R1 -> R1 - R2 type
operations and extract common elements. Ans : You had to get a simplified form, of the kind
of expressions in the determinant ANs: 7
The matrix was
(1+a^2-b^2) -2ab -2b
2ab (1+a^2+b^2) 2a
2b -2a (1+a^2-b^2)
Its determinant value is (1+a^x+b^y)^z. What is x+y+z?. Ans:7
9) Number of minimum length of set such that there exists a subset that has sum divisible by
11. Ans : 11 https://math.stackexchange.com/questions/1939620/prove-that-there-is-at-
least-one-subset-of-11-numbers-whose-sum-is-divisible-by
10) x^2 + 2bx +c = 0 - what is the probability that this has real roots, given that b, c are drawn
uniformly randomly from [-1, 1]. (Real distribution) Ans - 2/3
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
I think they are both ambiguous questions with no exact right answer.
For time series refer here:
https://machinelearningmastery.com/backtest-machine-learning-models-time-series-forecasting/
Which says no direct method of applying cross validation.
- It should be sliding window because all the other methods would destroy the sequential
nature of data.
Was anyone else facing Wrong answers in Tourist Booking question with brute force solution
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Walmart Labs
https://ideone.com/6shrps
It will hold for 2 ( idk about other numbers ) coz in way u are just right shifting by 1 bit each no in
xor(2,4,..,2*n) then taking xor and in 2*xor(1,2,..,n) u are taking xor and then right shifting by 1 bit and so
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Solution:
a = xor(1,2,.....,A[n])
b = xor(1,2,......,A[0]-1)
c = xor(1,2,....,n)
Final ans = xor(a,b,2*c)
Its not giving correct answer??
I.e we compute xor of all number from 1 to n, and again xor with even numbers in that range.
Xor(A … B) , i.e xor of elements in range A to B can be computed in O(1). Please google.
If A contains even terms, then set A[i] = A[i]++, we just add 1 to LSB side, so it won’t affect the answer.
Solution Logic: O(1) solution (x>1 or x>0 is required for this solution to work)
There are four cases for the first element which is A[0]=x-2, depending upon (x-2)%4
Case 1: remainder is 0 i.e. last two bits of x-2 is 00
In this case, the last two bits of second number(A[i]) will be 10 and all the other bits will be same.
Again, third and fourth will have all bits same except last two bits which is again 00 and 10 respectively.
This means, xor of first two number will be 10 i.e. 2 and next two will be again 2. In other words, first four
number will have xor zero and it will repeat in cycle of four numbers starting.
So, in this case , answer will be= xor of last n%4 numbers
Case 2: remainder is 1 i.e. last two bits of x-2 is 01
In this case, the last two bits of second number(A[i]) will be 11 and all the other bits will be same.
Again, third and fourth will have all bits same except last two bits which is again 01 and 11 respectively.
This means, xor of first two number will be 10 i.e. 2 and next two will be again 2. In other words, first four
number will have xor zero and it will repeat in cycle of four numbers starting.
So, in this case as well, answer will be= xor of last n%4 numbers
Case 3: remainder is 2 i.e. last two bits of x-2 is 10
In this case, exclude the first number and the last two bits of second number(A[i]) will be 00 So,
starting from second number this case will be same as first one
So, in this case as well, answer will be= xor of last (n-1)%4 numbers and first number (as we
excluded this number)
Case 4: remainder is 3 i.e. last two bits of x-2 is 11
In this case, exclude the first number and the last two bits of second number(A[i]) will be 01 So,
starting from second number this case will be same as second one
So, in this case as well, answer will be= xor of last (n-1)%4 numbers and first number (as we
excluded this number)
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
30 marks
Q3. Total Cost
An area is formed by enclosing N logs. The x,y coordinates of each log is given. There are houses to be
constructed on all the integral points lying in the area. The construction cost of each house is 25. Find the
total cost of all the houses constructed.
solution: Use pick’s theorem , shoe-lace formula and number of integer points between two points you
will find the number of integer points inside the polygon
Are the coordinates given here ordered in some manner (clockwise or counterclockwise) to get the area of
the polygon? (if u take the absolute value the order doesn’t matter) . But it has to be provided in some
manner obviously?
If it is not given in some definite order (either clockwise or anti), then it is impossible to calculate.
https://www.hackerearth.com/practice/basic-programming/implementation/basics-of-
implementation/practice-problems/algorithm/area-of-union-of-rectangles/
(Almost similar to this, just be careful with the negative coordinates)
How to adjust the hackerearth code to get correct answer from negative coordinates as well?
// solution anyone ?
// Is there a method to find the area if we know all the points lying on the boundary and inside the
combined area ??
Solution :
http://www.geeksforgeeks.org/find-the-largest-rectangle-of-1s-with-swapping-of-columns-allowed/
(Just a little change that you have to output number of swaps also)
How to get the minimum number of swaps?? Please answer.(+1)
IITG (23/10/17)
Perfect mind game and ashamed that I fell for it. They would instruct saying that, if u change/open
new tabs(other than exam window) = ur session will end.
No such thing will happen, do whatever you want.
Zendrive
CTC : 15 LPA
Base : 10 LPA
IITM (13/09/17)
Open for?
20 ques in 60 minutes. Nothing related to programming, only maths,stats and m/c learning ques. Level :
super high.
cauchy distrib, classifiers, like LDA and PCA diff, poisson distrib, normal distrib, some probability ques,
various other classifiers(new to us), data was given we had to tell which classifier will be best ....
all were very tough.
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Elastic.
IIT BHU
https://pasteboard.co/GIUXpiw.png
https://pasteboard.co/GIUXCbS.png--how to solve this ?
https://pasteboard.co/GIUXRSH.png --solution please
Is there any better method other than brute force for the first question?
For the second question, is there any better method, other than applying bfs whenever query 2 is called?
(BFS is most efficient way to solve that !! )
Indeed
Q1. https://www.careercup.com/question?id=6229105402970112
(Any better way than checking all possible combinations ??)
Q2. http://www.geeksforgeeks.org/find-the-maximum-of-minimums-for-every-window-size-in-a-given-
array/
Q3.Given an array of prices of products . Discount on ith product is equal to the product price less than or
equal to ith product and to the right(right of ith). If no such price exist then discount is zero. Give the final
total price.
Eg.
Input : Prices = 53324
Method : Discount = 33200
Output : {5-3}+{3-3}+{3-2}+{2-0}+{4-0} = 9
This question is same as find the next smaller or equal element (very common question is find the
next greater element.) Use stack to get this done.
In This question for every ith element, we just have to check (i+1)th element or all the element to its
right side ? -NO, all elements to its right.
I am not sure but I think only the immediate next one.
Can someone explain why discount for 5 (first element) is not 4 but 3. What does right of ith exactly
mean do we have to take first smaller or the smallest in the right of i?
IITK
Question 1
Also had to return different errors(if any) in the given tuples like Multiple roots,cycles, etc.
Example:
Input : (A,B) (A,C)
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Output : (A(B)(C))
Anything better than O(n) ? Nay!
Solution: Construct tree, and then do preorder traversal. Correct, if there is some mistake, or in
case of some better approach.
Question 2
Brute-force
Doubt : (Using BFS ???)
Given a graph, find all TRIOS. TRIO defined as triangle in Graph.
Trio ABC = Edges: AB BC CA
Question 3
Question 4
Given an array of N elements which consists all integers from 1 to N (a permutation). Return
minimum number of swaps required to sort the array. (Minimum no. of SWAPS not INVERSIONS)
IITM
4 Questions
1. An array A of balls with velocity Ai and position i was given . All balls start at the same time and
move towards right indefinitely. A faster ball can overtake a slower ball ahead of it . this overtake
creates a collision for the ball being overtaken . Given a position x, find the number of balls that
overtake it or the number of balls it overtakes.
(Doubt : The collision has any effect on their velocities ??) No
(Is it simply addition of all numbers having greater velocity and on back of position x + having less
velocity and in front ??) Yes
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
4. A grid is there with cheese scattered in random locations . Some locations in the grid are blocked
and Tom cannot pass through them . Tom starts from 0,0 and has to collect all the cheese and give
them to Jerry in the end who is at location (x,y) . Tom can pass through the location that holds the
cheese (that location is not blocked).
//this is same as travelling salesman? What are the constraints?
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Flock (Directi)
IITM (16/09/2017)
Ques 1) [Variation of Knapsack]
You are given N stones, labeled from 1 to N. The i-th stone has the weight W[i]. There are M colors, labeled by integers from 1 to
M. The i-th stone has the color C[i] (of course, an integer between 1 to M, inclusive).
You want to fill a Knapsack with these stones. The Knapsack can hold a total weight of X. You want to select exactly M stones;
one of each color. The sum of the weights of the stones must not exceed X. Since you paid a premium for a Knapsack with
capacity X (as opposed to a Knapsack with a lower capacity), you want to fill the Knapsack as much as possible.
Write a program that takes all the above values as input and calculates the best way to fill the Knapsack - that is, the way that
minimizes the unused capacity. Output this unused capacity. See the explanation of the sample test cases for clarity.
Input
The first line of input contains the integer T, the number of test cases. Then follows the description of T test cases. The first line
of each test case contains three integers, N, M and X, separated by single space. The next line contains N integers, W[1], W[2],
W[3] ... W[N], separated by single space. The next line contains N integers C[1], C[2], C[3] ... C[N], separated by single space.
Output
An optimal way of filling the Knapsack minimizes unused capacity. There may be several optimal ways of filling the Knapsack.
Output the unused capacity of the Knapsack (a single integer on a line by itself) for an optimal way. If there is no way to fill the
Knapsack, output -1. Output T lines, one for each test case.
Constraints
1 ≤ T ≤ 10
1 ≤ M ≤ 100
M ≤ N ≤ 100
1 ≤ W[i] ≤ 100
1 ≤ C[i] ≤ M
1 ≤ X ≤ 10000
Sample Input
4
9 3 10
234234234
111222333
9 3 10
135135135
111222333
3 3 10
344
123
3 3 10
333
121
Sample Output
0
1
-1
-1
Explanation
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
In the first test case you can select stone 2, stone 5 and stone 9. The knapsack will be completely full. Of course, there are
several other ways to select stones such that the knapsack is full. The unused capacity in all such ways is 0.
In the second test case you cannot select stones such that the knapsack is completely full. You can select stones {1, 4, 9}, such
that the unused capacity is 10-1-1-5 = 3. But there is a better way. Select stones {2, 5, 8}. The unused capacity is 10-3-3-3 = 1.
This is the optimal way. There is another way that is optimal. Select stones {1, 5, 9}. The unused capacity is 10-1-3-5 = 1.
In the third test case there is only one option. Select stones {1, 2, 3}. The total weight will be 11. This is more than what the
knapsack can hold.
In the fourth test case there is no stone of color 3. Thus, there is no valid selection of stones possible. The answer will be -1.
Attention
The constraints are designed such that a brute-force solution will fail. You can apply dynamic programming, similar to the
standard Knapsack problem. Hint: Consider DP[c][w], which is true, if and only if, the weight 'w' can be exactly achieved by only
using stones of color 1 to 'c'.
Please put any tricky test case if any.
/*
can be solved using dp. The main objective in this problem is to collect all colored stones. So make a dp[X][M]
and at any point say dp[i][j] we need to find whether there are stones to pick of color from 1-j that weights to i.
⇒ dp[i][j] = t; where t is calculated as shown below!
t = false;
for (every stone having color j and having weight <= i)
if(dp[ i - weight[that stone] ] [j-1] is true/possible)
{
Then t is true;
}
*/
Can someone check if this solution is correct or not, plz? → Link
Input Format:
First line of each test case contains two integers N and M denoting the no. of cities and no. of bidirectional roads. Each of next M
lines contains the description of a road in following format:
UV0
OR
UV1X
First two integers U and V denote the cities that are getting directly connected by this road. If third integer is 0, it means the road
is OK and needs no repairing. If the third integer is 1, it means the road needs repairing and the cost of repairing that road is
denoted by a fourth integer X.
Output Format:
For each test case, output a single integer denoting the minimum cost of repairing in order to make the cities connected.
Note:
2. There is at most one road between any two distinct cities.
1. The input always guarantees that there is at least a way to make all the cities of country connected.
3. There is no road from a city to itself.
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Constraints:
1 <= N <= 10000
1 <= M <= 100000
1 <= U,V <= N
1 <= X <= 1000
Examples:
Input:
46
120
1314
1411
2312
2415
3413
Output:
3
Can we solve it using Minimum spanning Tree? Yes!
Can someone from IIT M give the 3rd problem ? looks repeated here.
Only 2 questions it seems. (Need Confirmation from IITM)
Question 3:
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Flock (Media.Net)
IITM (21-09-2017)
Question 1: Lost Cake [BFS/DFS]
Our chef just started working in a huge hotel. The hotel can be thought of as a set of R rooms,
numbered from 1 to R, interconnected by C connections represented as a (ri, rj) - room ri and rj are
connected. To establish himself, he prepared an awesome cake for some very important 6 guests.
However, the delivery boy made a mistake. Instead of delivering the cake to room D, where those
important guests are staying, he delivered the cake to room S. After much searching our Chef found
the cake in room S. Now, he has to know the minimum of rooms that the Chef will need to travel
through, to reach room D(including the final room).
What was the input like? Did dfs/bfs pass all the test cases?
CAN SOMEONE PROVIDE SOLN OF ABOVE PROBLEM??
http://ide.geeksforgeeks.org
nodes in the selected subset should be connected directly. Two nodes are connected directly if one
node is a parent of the other.
Algorithm : Get the inorder traversal by sorting preorder traversal. A unique tree can be constructed from
inorder and preorder traversal. Now this problem is reduced to this one.
Code : http://ide.geeksforgeeks.org/tH7y0j
IITK (03-10-2017)
Q1 ) Question Solution
Q2 ) Question Solution
Q3 ) Word Ladder Problem
Q1. Undirected graph, n nodes , e edges, 2 players A & B. They move alternately where they can
move from their current position to an adjacent position. A is at p and B is at q. A has to reach p’
and B has to reach q' . At any point in the game, they must have a separation greater than d. Find if
it’s possible or not?
Constraints on n and e ? If n is upto 1000 then , we can apply n bfs to find all pair shortest path, then do
recursion , dp[i][j][x] = 1 if A is at node i, B is at node j, and x = 1 if current move is for B, else 0. Only thing
which is left is to recurse and memoize. - No such constraints were provided in the interview.
Q3. http://www.geeksforgeeks.org/given-an-array-arr-find-the-maximum-j-i-such-that-arrj-arri/
Q4. http://www.geeksforgeeks.org/find-maximum-dot-product-two-arrays-insertion-0s/
Q5. http://www.geeksforgeeks.org/maximum-size-rectangle-binary-sub-matrix-1s/
Q6. http://www.geeksforgeeks.org/maximum-product-increasing-subsequence-size-3/
Q7. http://www.geeksforgeeks.org/weighted-job-scheduling-log-n-time/
Q9. http://www.geeksforgeeks.org/find-smallest-range-containing-elements-from-k-lists/
IBM Research
CGPA criteria? No CGPA criteria in IITM
IIT-KGP
CGPA>8.5 considered. All those who applied (EC Mtech, idk abt other depts) with cg < 8.5 were
shortlisted for test too, they might consider the criterion during shortlisting after test. Anyone less
than that needs to have a publication and a LoR from a full time Prof. about his research exp.
Needs to also have 1 year of research lab experience.
It was a Pen and paper test with time constraint of 1 hour. Max marks 60
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
1) Array of strings given. Find pair of strings who have no character in common. If there are
multiple answer possible, return pair with the maximum value of product of length of two
strings. (10 marks)
2) You are at nth step of stair. Find no. of ways to get down. (from each step, you can take
either take 1 step down or 2 steps down). ANS: fibonacci number(DP) (10 marks)
3) kNN and kMean(machine learning), similarity or difference with example.(asked whether
they are similar or different, which things are similar and which are different, explain with
example) (10 marks)
4) Some Hotel review question. You have to prepare a model( seems similar to IITM Q.3, I
didn’t attempt it, so not sure) (15 marks)
5) A string S can always be written as T^N where T is a string. Find max value of N. (T^N
means T concatenated N times) (15 marks)
Ex: “abcabcabcabc” = “abc”^4. ( Return 4)
“aaaaaaaa” = “a”^8. (Return 8)
“Abcdefgh12345” = “Abcdefgh12345”^1 (return 1)
Idea: Think in terms of KMP algorithm (O(n) time and space). Any other efficient approach is
welcomed. Regex? Divide n Conquer ?
IITD
Q1. given an array A of size n with elements from 1 to k and another Array B of size k with elements
1 to n . show that they have a subarray of same sum. Solution ??
Q2. 1000 doors puzzle
Q3.http://www.geeksforgeeks.org/a-linked-list-with-next-and-arbit-pointer/
Q4 - case solving type long question (I didn’t read it)
Q5. ML question
Can you specify the ML question
IITM - 26-09-2017
CGPA Shortlist? They let everyone give the test
5 questions in 1 hour
Question 1: Detect the presence of error in a linked list where the last node (supposed to be
pointing to null) got merged to the list. (is it cycle detection???)
Question 2: Suppose your model has low bias and high variance. What model should be adapted to
overcome this problem.
Question 3: Given review of the hotels along with some meta information like location, hotel room,
facilities etc. Return the hotel which best satisfies a user query like “i would like to stay near beach,
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
cheap hotel” and don’t like “breakfast facility”. Design a model which can suggest hotels on such
queries.
Question 4: Given an unsorted list of even numbers, partition the list into 2 equal sets such that the
sum of the 2 sets is nearly equal.
Question 5: Given a string and dictionary of words. Find out whether the string can be formed from
the dictionary words.
IIT Roorkee is having a written test for IBM. Was it the same for other IITs as well?Yeah it will
have the same format as KGP, D and M mentioned above. The hotel question has repeated.
IITR
-4 question 1 hour written test 55 marks
1. Hotel Question(same as in other iits) 15 marks
2. Given a string(has alphabets and other characters too) reverse the string(characters
other than alphabets should remain at same position) 10 marks
3. http://www.geeksforgeeks.org/dynamic-programming-set-5-edit-distance/ 10 marks
4. This q. Had subparts, ML based general questions -20 marks(5 mark each part)
Samsung (Delhi)
IITK (13-10-17)
1. Same as above ( graph coloring with 2 colors) but STL was not allowed
IITG(25-10-2017)
1- Cycle in a directed graph (one cycle is enough in case there are multiple cycles)
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
IITK ( 11-10-17 )
1 question : 3hr
Given a directed graph. Find any cycle present in the graph and print it’s nodes in sorted order.
Ex. If ‘4->2->5->4’ is a cycle then print ‘2 4 5’
Note: There may be many cycles present in the graph. You just have to print one of them. If no
cycle exists then print -1.
// Was STL allowed ??
Yup //I think it wasn’t allowed
SAMSUNG BANGALORE
Bond of 3 years like they do have every year??
IIT BHU
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
There are some fisherman at each gate and sum of fisherman is less than equal to total
slots.
Cost of fisherman to reach from a gate to any slot is how many slot he has passed + 1.
For example if a fisherman enter from gate 1 and settle at slot no 2
Then cost is → (3-2) + 1
At a time only one gate is opened and if a gate is open then all of the fisherman at that gate
will go inside one by one and will find best slot
So we have to find order in which gate is opened and best possible arrangement to
minimize the cost.
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
IITK (15-10-2017)
^^^This fisherman question was in BHU right, assuming IITK had 2 coloring problem as given
below? Why is the picture in IITK section?
Graph - 2 color
Write code in C/C++/Java to solve a given problem. Code should compile, run and pass all given
test cases.
· Emphasis on working code with efficient Programming Logic, Algorithms, Data structures
· NOT dependent on any specific Platform/API
Duration 3 hours
Criteria for Pass all test- · “Sample test-cases” are given to test locally
Passing cases · Developed program has to:
Test · Pass all “Evaluation test cases” on server (not shared
with test-taker) and generate the output in specified format
· Meet efficiency criteria given in question (max limit on
execution time, heap memory, and stack)
· Prepare and test with additional test-cases (not given
during test, but, may be run after test). Consider large
data, boundary/corner cases, rare cases, high-speed
requirement, complex combinations etc.
2) Preparation recommended
a) Before the Test: Candidate is requested to refresh topics on data structures &
algorithms
i) e.g., Array, Grid, List, Tree, Graph, Map, String, Search, Sort,
Permutations/Combinations/Probability, Traversal, Path finding, Optimization, Dynamic
Programming etc.
ii) Some popular websites for study/practice: geeksforgeeks, hackerrank, codeforces,
topcoder, codechef, spoj, project-euler etc.
The question was based on an airplane game. The entire game map is divided in game
zone and control zone.
1. on each turn, the plane can either stay at its own position, or move left, or move right.
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
2. the last 5 rows of the game map form the game zone, and each time after the plane
moves, each row comes down by 1 unit
3. each cell in the game map may contain a coin(represented by 1), an enemy(by 2) or is
empty(by 0). when all rows come down, if the cell that meets the plane contains coins, the
noumber of coins collected by the plane increases by 1, else if enemy hits, coins decreases
by 1.
ex: N=3:
10021
2 0 0 1 1 ==>> 1 0 0 2 1
00100 20011
| (plane) | (since cell containing coin meets the plane, coin count becomes 1)
This way, the game continues till all rows are over.
4. the plane also has an option of using a bomb to blast all the enemies present in the
current game zone before the airpplane moves. (note that only enemies in the 5X5 game
zone will be blasted) But this bomb can be used at max once.
5. If at any time the number of coins becomes -1, the airplane explodes.
Given a map configuration, find the maximum number of coins that can be collected; output
-1 if there is no way the plane can survive.
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Deutsche Bank
IIT Bhu
(profile?)(open for ?)
(questions from any other iits) ??
http://ide.geeksforgeeks.org/O8lVKA
IITR
(profile and open for all ?)
1. String problem : evenswap i.e evenplace (0,2,4,...)string can be swap
Similiarly oodswap i.e Oddplace (1,3,5,...)string can be swap any number of time.
Resultant string is “twin” if follow above mentioned property otherwise not
Exp. abcd and cdab are twins while abcd,badc are not So compare string and print “YES”. if they
are twin otherwise ”NO”.
SOLn: sort characters in even places and odd places and compare the resulting strings. Will
this work??
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Oracle
IITD
It has 3 sections. Each section has 3-4 subsections. Don’t remember exactly what was asked in
each section and subsection.
Notes : each subsection is time limited, You can answer the skipped answer if you have attempted
all the questions of the subsection (so answer the easy ones first and afterwards answer the long
description questions) , once answered you cannot change your answer, Especially in the the
programming subsection skip lengthy questions (were in the starting ) answer the later simple ones
and then attempt these.
Query: There wasn’t any coding section? If yes, can someone please tell the question. (+30)
No coding section at IIT KGP.
(actually there was but it was multiple correct type, code was written and you have to ans question
regarding that code. Don’t remember the question. Questions were ime co)
IITK
Programming part- d on array, one question on graph traversal (DFS), preorder travel of given
binary tree that is given in form of array.question on min in BST, implementation of heap, bst
implementation base
Can someone post the questions from OOPS and DBMS,OS??(NAY !!)(Why?? :( ) :(
Coding Round:
2 questions - attempt only one
Time: 1hr
- Given an array, return number of continuous entries of length m with a sum n
- Another question on graph - didn’t attempt
- Divide an array into 4 subarrays such that sum = sum1-sum2+sum3-sum4 is maximum.
(sum1 denotes sum of elements of subarray) Conditions: sum1 occurs before sum2, which
occurs before sum3 subarray and so on. Also, sum1 sum2 etc can be zero(empty subarray).
Eg: -1 2 -1 -1
Ans: 5 ( 0 - (-1) + 2 - (-1+-1) ) sum1 is empty, sum2 is -1, sum3 = 2, sum4 = -2. Not
necessary to choose entire array. O(n^3) got accepted too.
Also the platform sucks.
IITBHU
Pattern was same as mentioned before. Few things to add:
- Revise trees and array representation of trees. Almost all of the long code snippets given
were in some way to modify a given tree and we have to give the final form of the tree after
operations. Some of the operations were to mirror a tree, to calculate minimum and
maximum values, to check if certain node is accessed or not, etc. It was taking time to
understand the code.
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
- Attempt the flowchart questions in one go. Then you can easily filll in the empty boxes.
- You can skip the questions and come back to them later. So, dont click on answer for
guesses as you can;t reanswer the same qs again later.
- There were a number of SQP queries like and SQL functions like rand(), instr() and lcase().
- OOPs and OS qss were standard qs from gfg.
Coding Round:
2 very simple questions out of which I don’t know why they had instructed to attempt only one!
Time: 1hr 15mins
- longest substring with unique characters
- number of ways to make sum N using only 1’s and 2’s with no consecutive 2’s
(N/2 ways considering 1,1,2 same as 2,1,1 right ?? if different then fibonacci !!)
Everybody had same coding questions? yes
IITG (28/10/17)
(Refer Last Year Doc - available in Fb group pinned post) Same pattern
IMP Update: If any image is not loading in ques, close the browser immediately and reopen it.
Time will resume and images will also load. (Not applicable for coding section)
Sec 1.3 Persistence Attention to Details Given a table, and list of choices, choose the
choice which is correct/incorrect in table. (Key to clear is keep track of numbers in cell/data)
Sec1.4 Programming Ability (Full Flow Chart, only 2 ques(5sub ques) Total 10 ques.
A game is given and flowchart is given for output .Some blocks in flowchart are left empty
,based on the game or problem find the missing blocks,etc. Solve for all 5 blocks of a ques,
by which u can answer further 4 ques.
Flipkart
Please post the test questions for the Data Science profile.
(CTC - APM - 26 LPA)
IITK
Problem 1
Given an array of N integers. Find number of of sub-arrays with M number of odd integers.
(Solution?)
https://github.com/cem3394/HR-Haskell
https://stackoverflow.com/questions/45645728/given-an-array-find-the-number-of-sub-
arrays-with-m-odd-numbers (NOTE: the O(n) solution given here doesn’t work when m=0)
Problem 2
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
N gears were given each with their own cost ci and radius ri. One extra gear was also given with
radius r1. A distance d was given and we had to find the gear with minimum cost following the
below conditions:-
1) ri +r1>=d(if there are multiple gears satisfying this condition than see condition 2 for those
set of gears satisfying condition 1)
2) Minimum cost ci(if there are multiple gears satisfying this condition than see condition 3 for
those set of gears satisfying condition 1 & 2)
3) Find the gear with larger radius(if there are multiple gears satisfying this condition than see
condition 4 for those set of gears satisfying condition 1 & 2 & 3)
4) Choose the gear with smaller index.
(Solution ?) - Simple Sorting problem bases on the given conditions. Was using vectors
allowed? - Yes
Problem 3
Graph problem.
Based on Union find.
Can be done without union find also.
There is a city with n areas, and we need to build clinics in the city such that all the areas have
access to the clinics.
The road between the cities might be damaged or broken.
The cost for repairing the road is R and the cost of building the clinic is C.
Find the minimum cost such that all the areas have access to at least one clinic.
For example( If the city is divided into three areas such that the roads between those areas are
damaged that either we can build the clinics in all three areas or build the clinic in any one area and
connect the other two areas with it by repairing the roads between them.)
(https://www.hackerrank.com/contests/world-codesprint-8/challenges/torque-and-development)
This is nothing but Travelling salesman problem (NP hard) - only brute force will work - have
to check for all permutation. No, travelling salesman problem has a constraint that every city
can be visited exactly once, but here we can visit one lock twice. Yet you are right that brute
force will work. I also could think of brute force only.
Wrong Solution :
I think this problem is NP hard for large values of B counts. Could anyone confirm?Yes, it is
All I can think of is to generate B! Ways of reaching out all bananas, and picking the
minimum answer.
1.Count no of bananas,let it be B.Run dfs or bfs and check whether all bananas are
reachable from the starting point.
2.if there is a banana which is unreachable from starting point return -1.
3.else do bfs from starting point(same cell can be visited any number of time) until you get B
no of bananas.Since we are using BFS the first such point will be minimum no of steps.(Not
sure) Nope. This doesn’t work. Try with an example. Nope this method is wrong.
We can use bfs to find answer for this problem if it is a tree. For a graph it won’t work.
Can we do it using backtracking and maintain min steps? : Yes, but it may exceed the time
limit.
One solution could be to maintain dp[i][j][k] as the min number of steps to end up with k
points(each banana is one point) and final position is matrix[i][j]. As precomputation, find
distance for each pair of bananas.
Query : I think this is right but how do we fill the table dp[][][]?
(Won’t this have O(1) solution since using n-1 elements you can never obtain nth element? Answer
to all case would be simply 2^n provided all the elements in the array are distinct.) In distinct
number’s case, I think you are right because each number will represent a unique bit position(1)
and we can make different numbers by taking different different bit positions.
http://www.geeksforgeeks.org/find-distinct-subset-subsequence-sums-array/
Problem 2
Same as IITD Problem 2
Problem 3
Same as IITD Problem 3
IITB(30/10/2017)
Optiver Amsterdam
IITK
1. Quant Quest
2. Speed Test
8 minutes 80 questions
simple + - * / were asked.
Speed test was to test mental calculation ability. You need to be above certain level.
When was the quant quest test ? Is this for trader or researcher ?
For both. Quant quest was an open contest held by them for two-three weeks or so, they also did
shortlisting from within campus.
Did they declare the shortlist? Did they have further rounds? What were they?
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Qualcomm
(CTC??,CTC/Job Profile with details??)
Please tell me all questions of input/output are based on C only or C++ also??? Mainly c
:enum,structs, do check operator precedence table(many question on that) -thanku
Please Can you tell me the type of question asked in Electronic part??
555 Timer.
Given R1, R2, C values either find the duty cycle or frequency of the circuit
IITK 26-10-17
Same as above 2 IITs three sections 20 questions each 30 mins each - Aptitude, Programmings
(given a pseudo code tell the output), computer science/electronics/communication.
Programming part was easy most questions were based on operators precedence table few on
enum, structs etc.
Electronics part was easy too, questions were on Flip-Flops, Boolean Expression, Hexadecimal
system, 555 timer (find frequency), concentration of holes given some parameters etc, Noise
Margins, counters etc.
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Futures First
CTC/Job Profile with details - Trainee Market Analyst (CTC - 1240000 and Base Pay - 840000)
IITG 10/10/17
General aptitude questions are asked basically you have to take care of the time as questions
would be easy only time management is important and in the first section don’t skip questions as it
would be written 6 min for 40 questions but there would be only 12 questions and u can’t go back to
the previous question.and similarly in the next section there would be 30 minutes test with 20
questions i guess simple aptitude and memorization based, pattern filling
Can you post few questions here for futures first? Anyone????????
-> 1000^2+300^2+20^2+1
-> sqrt(ab.cd) upto two decimal places
-> Find the next number in series
-> Find the next pattern
->there were two questions, A random figure will come, question will ask to remember it and figure
will disappear in around 6-7 sec. After that there will be 6-7 apti qus and then there will be questions
from that figure. You have to remember that figure (it’s better to write what u seen in the figure just
after disappearance.) The questions will be like
->sum of the numbers present in the figure
->arrow pointing to which object
->Number of circles in that figure
->among the following which icon was not present
->which characters were present in that figure.
->some questions were of 2 marks and some were of 1 mark. Negative of ⅓ was also there for
wrong answers. If u skipped question then there was no way to go back.Also number of questions
remaining won’t be shown.Time management is key
->advised to skip question which has 3-4 lines of english. The end questions in my set were easy. I
hope it will go same. (More risk more benefit) Did you have any progress bar at the top which
showed the percentage of exam completed?
->Progress bar at the top will show the % progress of the whole test...but it will not provide you the
progress of the individual section. So tracking how many questions are done is impossible for
individual section.
Basically the questions were like the ones asked in sof (fake olympiads :P)
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
VMWare
CTC/Job Profile with details?? Updated on CTC detail sheet
CGPA and branch criteria? CGPA:7.0, B.tech- cse,eee,ece M.tech-cse,eee,mat
IITG (26-10-2017)
Aptitude questions
OS, Networks, OOPS
2 languages (Java, C++, Python)
1 coding ques:
Given a string. Find the maximum length substring which forms positive sequence. And print its
length too.
Question language was not clear. They actually meant to find maximum length substring, which is
consecutive and increasing.
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
IITK (30-10-2017)
Mathworks India
IITG (10-10-17)
Please update what non-tech ques are asked in the offline video interview?
Questions that Mathworks is asking in their video interview :
1) What about this position interests you?
2) What about your background or experience makes you a good fit for this
position?
3) Tell us about a time when you worked on multiple projects / tasks at the
same time and how you handled it?
4) What is your cumulative GPA?
Profile: Associate in Engineering Development Group
Paisa: 11-14 lakh(CTC) (Monthly fixed salary: 83333.33)
Visited IITG and held a ppt in which they told us about all the responsibilities of an engineer at
Mathworks and other general info. about the company.
Now after 2-3 days we have received an e-mail from the company
(1) This is an offline video interview (link will be active till October 15, 6 PM
ONLY) where you answer a set of pre-recorded non-technical questions. Keep your
webcam & microphone ready before you begin. The entire interview should only take
~15 minutes.
Click on the link below to begin your video interview:
https://mathworks.hirevue.com/openvue
(2) Complete this simple survey (link will be active till October 15, 6 PM ONLY)
which will help us process your application faster. Simply click on the web page
address below or copy and paste it into your web browser -
https://www.customersat3.com/e.asp?IID=xxxxxxxxxxxxxxxxxxxxxxxxxxxxx
(3) After successfully submitting the survey, last step is to apply to the most
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
relevant position below (you will need to use your MathWorks Account to login).
Position Overview -
Link
https://www.mathworks.com/company/jobs/opportunities/xxxxxxxxxxxxxxxxx
Why EDG? -
http://www.mathworks.com/company/jobs/opportunities/students/infographic.html
Why MathWorks? -
http://www.mathworks.com/company/jobs/students/index.html
Mathworks Test
==============================================================
For computer science Interview track →
90 minutes
Mandatory : 10 multiple choice on Quants and CS questions - questions were on probability,
difference between structs and unions etc.
Choose any two of Java, C , C++ : each has two coding questions.
1. C: Given two numbers left, right and another number k , find maximum xor of a,b less than
or equal to k such that left<= a< b<= right ;
2. C: Given two strings like abcgh and def return a resultant ⇒ adbecfgh . that is alternate
charcaters till one string exhausts and append the remaining.
3. C++ : Implement three classes Circle, Rectangle and Square with methods to calculate area
and constructors with parameters.
4. C++ : Given a number N return the number of beautiful arrangements possible with numbers
1 to N . An arrangement is said to be beautiful if ith element is divisible by i or i is divisible by
ith element. (i is 1 based index).
Choose any one of Matlab or Python : ( for python a coding question was given to solve )
For Matlab : (more than one correct option)
1. A is a 4x 3 matrix, B is a 3 x 3 matrix which of the following is valid : [A B], [A ; B] , {A, B} ,
horzcat(A, B) , vertcat(A, B) .
2. Clear B; B(3)= 1 → what will appear on the command window.
3. A=ones(6) B= rand(6,1) C=2 → which is valid : B*A, C.*B , C*B’*A, etc.
Two more similar syntax based questions were asked.
For Core engineering track → 51 questions in total. One section on control theory, signal
processing and embedded systems MCQ’s , Math and aptitude section, Coding MCQs , one
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
coding question of C,C++,JAVA . → it was to find redundancy in linked list in C++; . FInal section
Matlab or python.
iManage
Profile?(??????)
CGPA criteria? Above 5
IITM - 14/10/2017
Alphonso.tv
IITB
Job Profile:Technologist
CTC 30lacs+Benefits Open For : CS, ELEC
Cpi cutoff???
No CPI cutoff
Questions based on unix commands(command to create a file without editor, command to make tcp
connection, check if remote pc is on), write a command to extract first 6 character from every line in
given file, java/c++/python related problems( read about pointers, global variables, access
specifiers), 1 puzzle(adding up to 100, 2 players taking simultaneous move, in each move choosing
any number between 1 and 10(inclusive), who wins with optimal play?) ,1 javascript problem(what
this javascript code do), 1 DFA question( find the regular expression given a dfa), counting sort,
heap deletion problem, 1 question related to network bandwidth required?, output of given program
etc.
IITK
One question on deadlock, one on output of c code, what is complexity of binary search. if array is
almost sorted which is the best sorting algo.
Test 2: 2 Questions, 60 mins
Q1. Millions of users, thousands of servers in a server farm. What are the potential issues and
some solutions?
Q2. A Question related to Synchronization (OS), for implementing FIFO queue - socket- read-write
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
IITD
Test 1: same as IITB
Also there was negative marking even in subjective questions In subjective questions only correct
option was not sufficient.
Q1 Job sequencing problem with profits and different time required for different jobs
Q2. The client software which performs hashing for audio clips and communicate that with the
server . What are the potential issues and some solutions?
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
J P Morgan
JP Morgan visited IITG for Analyst - Quantitative Research profile and conducted ppt on 13th Oct,
where they told that they will take one test in which they will test coding skills and general
mathematics such as probability and stochastic calculus etc. Based on that they will shortlist people
for interview. The test is scheduled for 16th October (Test now postponed). CTC- INR
2520000.00(Base salary: INR 1800000.00)
Also, it came for 2 profiles- Quantitative Research Analyst and Data Science. The test has 2
parts basically quant (which involves lot of maths, probability) and 2 coding questions. For
quant role, 65-70% weightage to quant section and 30% for coding. In case of Data science,
50%-50% weightage.
Is it open for all Btech? And Is there resume shortlisting based on CGPA?
- Yes, its open for all b.tech with cgpa >=7. Yes, the resume shortlisting is based on CGPA,
branch and projects.
Rest of breakdown: 40% of Base (annual variable) + 75,000 (relocation)
Guys can you post the questions of quant? Sure, After the exam.
Exam was supposed to happen on 16th right? ->(Test Postponed to unknown date) Please
upload the questions _/\_
Note : Time management is very very very important. Literally, you have 30 sec for each
question. Don’t read lengthy questions at all (time waste). First attempt all small questions
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
and try to attempt as many as possible as nobody can attempt all questions. It is not
possible to read all the questions also.
1. Math :
Topics - Basic Math, Probability, Permutations & Combinations, Integration, Differentiation
etc.
- Starting questions are lengthy, skip them and first try to solve easy questions.
- Questions are same for everyone but order is different for everyone.
- BEWARE OF NEGATIVE MARKING
2. Programming MCQ :
Topics - C, C++, No Java (OOPS, Pointers, Trees)
- Questions are same for everyone and order of questions is also same.
- Questions are like code will be given, you have to tell the output of that code.
- Most of the codes given are very lengthy (15 - 20 lines). So, first attempt those questions
which have less code
- Most of the questions are in C++. No single question is in Java. So, java people at least
make sure you know the syntax of C++ classes and objects.
- Be careful of pointers.
3. Coding :
- Sum of Specific nodes in a binary tree (Difficulty - Hard)
- You are given a binary tree, a node(n) and some distance(k). Return the sum
of the values of all the nodes that are at a distance of k from node n.
- http://www.geeksforgeeks.org/print-nodes-distance-k-given-node-binary-tree/
- A binary tree and 2 nodes are given, you have to return the least common
ancestor of the given 2 nodes.
- http://www.geeksforgeeks.org/lowest-common-ancestor-binary-tree-set-1/
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
IITR (13-10-17)
Test is conducted on cocubes platform, one can find some mock papers of cocube
available online
Questions division :- 20 quant, 10 LR, 10 English
Difficulty level: Avg and above for quant. English and LR were relatively simple
In quant, revise ratio and mixtures properly
Also questions on sum of factors, nos. of factor of given no. (see formula)
Try attempting anything above 35
4) a+b+c=0 , a3+b3+c3=?
5) Hypotenuse=20, find other sides if they differ by 4.
6) There were two DI paragraphs (total 5 ques.) based on calculating percentages.
7) There are two sets each consisting of 10 different objects. How to choose objects
from two sets such that you have to select at least one object from each set
ISRO
IITG
Open for EEE, ECE and Mechanical Dept. at IITG.
Only for BTech people
No test.
Just resume shortlist and interview.
CPI cut off 6.84.
Open.for Dual Degree? -----> No dual degree in IITG
CTC = Base Salary = 9.6 LPA
M.TECH students are allowed???? -NO
Everyone who filled the form was shortlisted for interviews which are to be held in November 1st
week or so
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
PayPal
CGPA criteria? CGPA >= 7.4
IITR
- Total test duration was 90 minutes, 10 MCQ’s + 1 coding question.
- MCQ’s were based on OOPS, Data structures and Java, C++.
- Platform ? Hackerrank
- Coding Question
There are n students that need to be arranged in a queue for the morning assembly. Given
that queue will always start from student no. 1. There is an interaction matrix [A ij], where Aij
stands for the interaction between student i and j when ‘j’ is standing at the immediate back
of ‘i’. (Note: Aij and Aji need not be same). Find the optimal arrangement such that the total
interaction between the students is minimum. ( if the arrangement is [1,2,3], then total
interaction is given by A[1,2]+A[2,3]).
Constraints: 1<= n <= 16 ; 0<= Aij <= 1000.
[Backtracking or bitmasking dp were enough]
Only check for the minimum sum of all interactions, if the interaction sum of the current
queue is greater, no need to check further. Stop backtracking of that permutation. Try the
question once, its easy.
Won’t it exceed time limit? 16! Permutations max to check. Or when we backtrack it
executes within given time limits? The test cases were weak. Even the least optimal solution
using DFS cleared 6 out of 10 test cases.
// Simple backtrack
// There could be some minor mistakes, as I have not tried writing the actual code.
Int ans = MAX
recurse(int idx, int mask, int currans){
if(idx == n && mask == 0) ans = min(currans, ans), return;
if(currans > ans) return;
for(int i = n-1 to 0){
if(mask & (1<<i))
{
recurse(i, mask^(1 << i),currans + (idx==-1)?0:A[idx][i] )
}
}
return;
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
main(){
recurse(-1, (1<<n) - 1, 0);
}
Do we have to print the arrangement also ? No
All test cases passed using backtracking? YES
E.g. mask = 0001011 i.e. only 1st, 2nd and 4th person are present in the current solution
Can we do it using greedy approach? Maintain an array arr[n] where arr[i]=true indicates i is already
in queue. Lets say we have a queue of i students and we need to (i+1)th student , then we need to
find min( summation over j, A[i][j]+A[j][i] and arr[j]==false). ( No, I tried it but was not giving ac for all
test cases).
IIT(BHU) 17 oct
Given a set of nonnegative distinct integers, and a value K, find out number of subsets of the
given set with sum divisible by K using exactly M integer elements of array.
IIT Bombay
Total 10 MCQ
1. Number of colors required to color planar graph
2. https://www.completegate.com/askus/157/question-on-circular-queue
1 question in SQL
3 more questions on C++/Programming
Given three arrays, a, l, r. Array a contains integers. Array l and r contains left and right boundary.
For each element from l[i] to r[i] in array a , calculate result[i], where result[i] = Sum of distinct prime
divisors of all elements in a (From l[i] to r[i]. )
Ex
A = [ 2, 3, 10, 5,6]
L = [1,2]
R = [2,3]
For first test case L= 1, R = 2, So result[1] = 1+1 = 2 (Number of unique prime factor for 2 = 1, for 3
= 1)
For second part, L = 2, R = 3, so result[2] = 2+1 3 (Number of unique prime factor for 10 = 2, for 5
= 1)
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
HSBC Analyst
IITM (Platform)
(cgpa cutoff for test??+5 >=7)(ctc? 14lpa)
Everyone had a different paper, time was not an issue but needed to be accurate.
IITK
AMCAT test,prepare for math section that is tough-two
simple program like prime no, question on matrix mult. ,
string. , remove duplicates from arrays
Was there any cgpa criteria in IIT K? I guess not
Can we use stl here?? No
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Mercari
(cgpa cutoff for test How much?) NO
IITB(15/10/17)
Two very easy online coding questions in 1 hour. Each candidate got a
different set of questions. (what were some of the questions ??)
Given a string, consisting of digits, spaces or dashes(-), convert the string into
block of numbers such that there is a dash after every 3rd digit. Space has to
be removed. If the last block has just one digit, modify it, such that last and
2ndlast block consists of 2-2 digits.
Ex: 203 984- 940- -> 203-984-940
203 984- 9 -> 203-98-49
IIT Roorkee
Q 1. Given top face of n dices find the minimum no. of steps so that each dice has same value.
Value of n ranges from 1-100
Q 2. For an array a, k is defined as 2^a[0]+2^a[1]+...+2^a[n-1]. Find set bits in 3*k. Length of array
1-10000. Value of a[i] ranges from 0-1,000,000,000. O(1) space complexity. O(n) time complexity.
Number of 1’s in the binary representation of 3*k??
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Capital One
For last years ques, please refer the docs posted in the description of the
FB.(Has this been updated yet , Couldn’t see any link regarding this)
Where?
IIT KGP(23/10)
ML Profile: 26 Questions, 30 Marks, 35 Mins
Two Sections: 1. Data Interpretation 2. Reasoning + General Maths
Each section has individual cutoff so it’s important to attempt each of them.
Section 1 - 3 parts: 1. Pie-chart, 2. Line charts 3. Bar graphs
Section 2 -Quant
(Time management is very very important,it makes all the difference,dont
waste much time on single question)
DI was fairly simple, Quant was slightly difficult considering the time per
question.
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
SAP LABS
IITG (20/10/17)
Topics:
IIT BHU
Coding part:
1. Given a tree,in which we have to calculate value of node, which is defined as
r_val_currNode - l_val_currNode + value left subtree, where each l_val and
r_val are given for each node. Root node was not given, we had to construct
tree from given inorder and preorder traversal array. Then perform the
required calculation.
2. Simple BFS based question: Given a 10x10 binary matrix, where each row
defined a state, binary 1 in (i,j) means we can jump from i’th state to j’th
state.Find minimum number of steps needed to go from one state to another.
Tricky part: The platform sucked in coding part.Read only part of 1st question was
wrong,hence was just waste of time for those who attempted it.
And in addition to this there was some problem with Java editor,so Java guys didn't
solve any coding question.
>True that
Coding Questions:
1. Given inorder traversal, level order traversal of a binary tree and number of
nodes, you have to find out the minimum height of the tree.(Did you construct
the tree here ?) - you dont need to, send in recursion parts of arrays which are
subtrees
2. Given the number of rows and columns of a binary matrix, find number
of perfect matrixes possible, a perfect matrix is defined as, if a binary
matrix can be converted into all 1’s on any number of steps. In one step
you can tap on any block then the values of all elements in same row
and column of that block flips.(Are we suppose to count no. of ways to
convert matrix to all 1’s ??)No , we have to count how many matrix have
solution.(all possible combination of 0 and 1 to construct a matrix with
given no. of rows and column which are perfect)
(How to do this^)
Note : You can use stl(Dude editing was not possible outside the function). I have
edited the header files. You can add your own functions, header files as required.(i
added) Nowhere it is mentioned that u cannot use stl. The header files are outside
the read-only section of the code. So u can edit the header files.(True)
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
IIT Kanpur(21-10)
75 min, Mettl Platform
Quant - 10 Questions
LR - 10
Guesstimate - 1
Computer Knowledge - 10
Coding - 2
Coding:
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
MICROSOFT : IDC
IITM
There were different set of Papers.Platform Cocubes.Time 70mins 3 questions
● Simple problem on String Manipulation(If string has A in ith position and E in
i+2th position remove the i+1th character in string and return the reduced
string)
○ - expected output for AAEE? Ambiguity :D
○ Shouldn’t it be AE?(maybe replace blocks of Es with one E and then
operate)
● http://www.geeksforgeeks.org/dynamic-programming-set-13-cutting-a-rod/
● http://www.geeksforgeeks.org/count-distinct-subsequences/
There are 2 tests of 2 different profiles. One for Data Scientist, another for Software
Engineer. Please post the test questions asked separately for each profile. How
were the 2 tests different?
IITR
IITB
There were different set of Papers.
Platform Cocubes - BEWARE don’t change tabs, (they monitor your tab activity,
many people who opened tabs were asked to leave.,
Time 70mins 3 Questions
● Last Digit in Factorial
○ www.geeksforgeeks.org/last-non-zero-digit-factorial/
● Rod-Cutting
○ www.geeksforgeeks.org/dynamic-programming-set-13-cutting-a-rod/
○ DP Solution only works
● Maximum expression in a string with numbers and “*” and “+”
○ www.geeksforgeeks.org/minimum-maximum-values-expression/
● Maximum sum path
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
○ http://www.geeksforgeeks.org/maximum-path-sum-matrix/
● Count distinct subsequences
○ http://www.geeksforgeeks.org/count-distinct-subsequences/
The questions will repeat with very high probability, so make sure you revise all
these questions before going to the round. They have a common set of questions
which are asked everywhere. Also, they use C style arrays (not strings or vectors),
that could be annoying. Yes It was -_- (+1)
~50 questions, 3 sections. First section had ~20 questions, +1/-0.25. Second section
had ~15 questions, +2/-0.5. Third section had ~15 questions, +3/-0.75
Points to note :
- A good fraction of questions were around graphical models. Which of the
following (junction tree, message passing) is an algorithm, what is kalman
filter, stuff about conditional random field (definition only), markov random
field etc.
- Most ML questions will be of the form : Which of the following is true, which of
the following is false, in such a scenario what is best algorithm. The questions
will be straightforward if you know the material.
- Numericals - focus on probability basics only. Stuff like how to compute
maximum of n random variables etc.
- Time will be sufficient, if anything it will only be lack of knowledge that stops
you. It is like a GATE exam based on probability, linear algebra, statistics, and
machine learning.
- Thanks
IITG (23/10/17)
Same pool of questions as IITK
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
● Last non zero (from right) digit of the Factorial of a big number.
● Diameter of tree
● Maximum sum path in a tree
● Maximum sum path in a matrix
● Given an array of size n with given capacities of items in it, a robot with maximum capacity
max has to pick nearest number of items less than max while also it cannot pick items from
consecutive positions in array. Return max num of items it can pick.
CAN SOMEONE PLEASE EXPLAIN THE QUESTION PROPERLY?
Any link for this question or/and solution?
Did O(n^2) solution work? Yeah(My DP solution worked just fine)
Can you explain your DP soln??
● http://www.geeksforgeeks.org/minimum-maximum-values-expression/
● An array consists of number of employees required for each month. ‘Hire’ is the cost of
hiring an employee and ‘serv’ is the cost of removing an employee. What is the minimum
possible total cost for the ‘n’ months.
Question unclear. Link appreciated.
and 41. What is the minimum possible total cost for the ‘n’ months. Modified
KnapSack problem. Brute Force solution is also accepted in the test.
- Maximum expression in a string with numbers and “*” and “+”.
- Maximum path sum in matrix
- M.L. problems- type of error based on ROC
Backpropagation algorithm, different types of error function, some probability
questions and some algebra. Svm and KNN based question based on their
boundary shape with varying input data.
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Next Education
IIT D
1. Format -- 20 objectives (puzzles, output of code) , 2 design questions(subjective), 3
programming quesions.
3. Questions--
a) Estimate number of school teachers in Delhi.
b) Design an app to track school buses . Explain Client Server model for this application.
Functionality and technical details something like that.
c) Given N numbers from 1 to N. you have to change sign of exactly floor(N/2) elements such
that the resulting sum of whole array should be 0.
Sol-- N*(N+1) should be divisible by 4.
d) Longest non decreasing subsequence for a given array.( note since it’s non decreasing
elements can be repeated).
Note--- O(N^2) solution results in TLE. so use segment or BIT tree.
e) Given N consecutive buildings find maximum amount of water which can be filled between
two buildings. Suppose if buildings i and j are selected then all in between buildings will be
removed. I.e amount of water will be min(h[i],h[j]) * distance between them. Ex. 2 3 4
(select 1st and last building. Distance between them is 1 so ans is 2).
Note -- O(N^2) solution results in TLE. so for every index i find the farthest right and left
index such that value as those index is greater than value at index i (can be calculated in nlog(n)
using binary search and two array Lmax and Rmax where Lmax[i] = max(h[0] …. h[i-1]) and
Rmax[i] = max(h[i+1], … h[n-1]). Then try to fill water between i and those farthest indexes.
http://www.geeksforgeeks.org/trapping-rain-water/
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Societe Generale
IITD - 24/10/17
Sections - Aptitude,Software Testing questions,English, Java/C# Questions
Time - 70 min
Aptitude - Was moderate Topics? Is it Quant or LR? Or general Aptitude?
Qaunt - Level >=medium,English-Easy,Software Engineering-Testing and Models-Medium
Revise Oops concept .
No coding questions? No
Can you list some questions?
Question on software development, types of model (eg. waterfall model), types of testing (eg. unit
testing, integration testing etc) and related.
Platform ?
RAZORPAY
IITM
10MCQ + 3 Coding Questions
MCQ were covering one question from each of oops dbms networks os aptitude dsa etc..
1)Chef loves lucky numbers. Everybody knows that lucky numbers are positive integers whose
decimal representation contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4
are lucky and 5, 17, 467 are not.Find number of changes which needs to be made to a integer to
convert it to a lucky number
2) Problem based on 2variable array sorting.
3)A number is lucky number if it contains only digits <5 and all are in ascending order. Find
number of such lucky numbers till given n. N can be upto 10^18
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Saavn
IITB CTC?
1hr - hackerank
http://www.geeksforgeeks.org/minimum-number-of-manipulations-required-to-make-two-strings-
anagram-without-deletion-of-character/
http://qa.geeksforgeeks.org/2038/count-number-of-power-numbers-in-the-given-range
http://www.geeksforgeeks.org/element-1st-array-count-elements-less-equal-2nd-array/
4 MCQ questions -
Data struct for Level order traversal
Complexity of a code given
Complexity of DFS
Which algo doesn’t need backtracking - Knapsack , tower of hanoi, n queen etc
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Tesco
IIT BHU
Hackerrank platform, 60 mins, 2 coding questions
1) Simple question based on stack, some application of next number larger than current
2) String question: Lexicographically smallest substring that starts with a vowel and ends with a
consonant. n^2 solution passed 8/10 test cases Test case? What if the string is abc?ab or ac? In
case of substring only contiguous seq should be considered . ab is anyway lexicographically
smaller than ac . for test case efgach, the answer should be ach ??
For efgach, why not ‘ac’?
(Length vs Lexicographic order, which one should be prioritized?)
Length doesn’t matter
Any one from IIT BHU can clarify the 1st Q. properly??
An application of this
http://www.geeksforgeeks.org/next-greater-element/
IITG (30/10/2017)
(IITG Friends, kindly rephrase and improve the ques)
1) Given an array, return the MINIMUM sum of the unique elements. If an element is not
unique, make it unique.
Eg: arr={2, 2, 4, 5} arr[1] is not unique. Make arr[1]=3 to get min sum, which is 14
2) Given a string “acdapmpomp”, find two palindromic subsequence, such that the product of
length of the two subsequence is maximum and the two subsequence should not overlap.
Suppose, 1st subsequence (start, end) = [1, 6], 2nd subsequence = [3, 8] ==>overlap
“acdapmpomp” = “aca”(3) multiply “pmpmp”(5) ⇒ 15(answer)
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Fidelity
IITG
CTC??? 11LPA
TEXAS INSTRUMENTS
IITD
There were 3 profiles, Software Engineer, Hardware Engineer, and Software & Hardware Engineer.
You were allowed to take the test for only one profile. I applied for Software Engineer.
Nutanix
Envestnet Yodlee
CTC??
(open for?)(CSE, EE, Maths n Computing): 2 Profiles-IT(MTS) and Lead Data Scientist
41 questions 50 marks
CISCO
Which profile? Is it SE II?
IITK
Simple aptitude and probability questions and some questions on microprocessors. 60 minutes 50 questions.
(can you elaborate on what kind of qns were asked in aptitude and probability?)
- Very easy stuff. Ratio, permutations combinations. Some simple puzzles.
No real need to practice for this part.
- Can you describe something more on the microprocessors part? What to study? +1
(IIT Kanpur)(Did they ask on Networks?) +2
For microprocessors, they asked what certain instructions meant / did. Do not recall if there were
Network questions.(I am a math major. I might not have recognized them).
Do you mean MIPS instructions??
(^^^^Can someone from elec shed more light on this??)+2
Were microprocessor questions compulsory for everyone? Or was it only for non-cs background?
- Test was common for all the depts
IIT BHU
Same as above^^
Regarding microprocessor, there were 2-3 questions. Which mode of operation in 8255 PPI, 8095
machine instruction to clear flag, how many chips required to design 64k of memory when individual
chips had 12 bit address line and 4 bit data line, simple questions related to NOR gates and
boolean algebra.
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Citicorp(Bangalore)
IIT BHU
3SECTIONS: platform:amcat
1. Quant :
16 questions-16mins, very easy, just maintain your speed to attempt all questions
2. DI: 10 questions 20 mins
(2 sets of 5 questions each)
3. Critical Reasoning: 22 questions 30mins
NO negative.
In our portal the total duration of test for citicorp is mentioned to be 120 min.So does it contain
coding problem of 60 min as well or not?
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Symantec
IITG (28/10/17)
10 MCQ
2 coding ques.
1. Given n sentences of max of w words in each sentence. M queries having 1 or few words,
you need to output index of sentences where you can find these words.
Ex:
3
John likes Tom
Tom likes Mary
Mary and John are friends
2
Likes
Mary likes
Output:
01
1
2. Given matrix with 1’s, 0’s, -1’s. 1 - diamond, -1 wall, 0 no diamond but you can travel
through it. You need to start from (0,0) , go to (n-1,n-1) and return back to (0,0) with max
diamonds.
Once collected the diamond there will become 0..
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Cohesity
IIT Kanpur(22-10)
Rakuten
CTC ??
IIT BOMBAY
My question was
I am using ^ symbol for bitwise XOR
Given 2 integers M, N where(M<=N)
Calculate M^(M+1)^(M+2).....^N
Conditions: O(log(n)) worst case time complexity; O(1) space complexity
Platform provided???
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Myntra
-Roorkee walon myntra ke updates de do
Test has been postponed
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Auctus Advisors
Coming to IITB, shortlist methodology will be similar to Bain, BCG, ATK
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Amazon
IIT DELHI- PLEASE GIVE INFO OF AMAZON TEST
Deloitte
Questions anyone??
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Yahoo Japan
Any test in IIT’s till now?
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Nasdaq
Questions Anyone???
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
AB InBev
Questions Anyone??
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
AXTRIA
(Technical Analyst/ Business Analyst)
IIT (BHU)- test on 31st oct
Uber
Questions Anyone??
Wanna add ques ?? Use this doc --> https://goo.gl/LNWwuC
Honeywell
Pattern and questions Anyone?