Find C++ solutions to coding problems at the following github page:

https://github.com/kaushal02/interview-coding-problems

Some interview experiences here(please share more if you have)-+1

1. Interview questions:
   https://docs.google.com/document/d/1rDZA_tqdTdGVE_VHf8szw_cYNwAALKQE6HPkPtd-4Cs
2. Placement_Interviews_2011_CS: https://docs.google.com/document/d/1rvf0VTDlhbRR4LOC5czU2LIKI73L6qRhlD37Sil6SGs/ 

Instructions:

• Apply HEADING-1 (ctrl + alt + 1) style for new company name to show in outline

• Apply HEADING-2 (ctrl + alt + 2) style for your college name        
• While typing, use Ctrl + Enter to go to new pages
• PLEASE KEEP COMPANIES ON SEPARATE PAGES
• Enable outline for Company Shortcuts  View  Show Document Outline
• Page edit history will be maintained in History Page

• If possible, mention whether the company is open for M.Tech. or  notF
• While adding external solution links, please apply green color highlights
• Mention CPI Cutoff and eligible discipline, please apply red color highlights

Please don’t edit or remove heading 1 or heading 2 style , it screws up the outline and makes the document look chaotic.

You can search the questions of the companies.

KINDLY ENTER COMPANY HERE, IF ANY INFO IS ADDED IN DOC

(Anyone who solved the question completely is requested to share the solution and/or approach)

History of Companies

Answered Queries

Has Apple shortlisted for SRE role from any of the colleges apart from IIIT-H? If so, when is the interview?

IITR guys, please update questions for Societe Generale.

IITD guys please add questions for Rivigo’s business analyst profile

IIT M guys please update the questions for AQR capital. Exam tomorrow evening.

Dell in any IIT ?????????- Dell’s test is scheduled in IITB on 26th Nov.

IITD people, please share questions of Axis Bank? Please………. ?+10

Can someone from IITK post the questions asked in the EORM profile of Credit Suisse ?

IITR people, Please share Squarepoint Capital Questions? Updated

Someone please add Flipkart Questions!!! IITD? +1+1+1

Guys, what’s the link for FB group as mentioned in other G-Doc?
https://www.facebook.com/groups/1540488506008368

Can you tell about the Morgan Stanley written pattern? In my college it will be for 3 hours.

What is the compensation offered by Microsoft in any campus this year?

39-LPA https://www.thehindubusinessline.com/news/record-offers-at-campus-placements-in-tn/article24949073.ece 

Have FICO visited any college yet?

Does Flow Traders look at the CGPA? ---->>> Nope.

Anybody had a technical interview after HR round ?

Where can I find the last years DOCs?

Have Saavn visited any college yet??Plz upload question  IIT Roorkee question already uploaded.

Please update fquestions

Please update Finmechanics IITD

Have Lenskart visited any IIT??

Gartner(Lead-it)

IITK, IITD

Platform : amcat

5 sections

14 LR questions in 14 minutes

22 Verbal questions in 14 minutes

12 Machine data questions in 18 minutes

12 basic statistics questions in 15 minutes

12 python questions in 15 minutes

Oyo Rooms

IITR

25 MCQ, 2 coding questions on hackerearth

• https://www.geeksforgeeks.org/maximum-profit-by-buying-and-selling-a-share-at-most-k-times/ 

Paytm

IIT BHU

Platform :Cocubes

Note: No constraints mentioned in problems.

3 Coding questions in 70 minutes

1. https://www.geeksforgeeks.org/merge-two-sorted-linked-lists-such-that-merged-list-is-in-reverse-order/
2. https://www.geeksforgeeks.org/find-maximum-path-sum-two-leaves-binary-tree/
3. https://www.geeksforgeeks.org/find-combinations-k-bit-numbers-n-bits-set-1-n-k-sorted-order/
4. https://www.geeksforgeeks.org/merging-intervals/
5. https://www.geeksforgeeks.org/transform-one-string-to-another-using-minimum-number-of-given-operation/
6. https://www.geeksforgeeks.org/count-bst-subtrees-that-lie-in-given-range/
7. https://www.codechef.com/problems/CHINSM
8. Sum of unique elements in array

IIT GHY

Platform - Cocubes

Set-1

1. https://www.geeksforgeeks.org/transform-one-string-to-another-using-minimum-number-of-given-operation/
2. https://www.geeksforgeeks.org/number-of-elements-that-can-be-seen-from-right-side/
3. https://www.geeksforgeeks.org/find-maximum-path-sum-two-leaves-binary-tree/
4. Given a matrix representing which child likes which toy.
   matrix[i][j]=1 represents that child i likes toy j. One child can get only 1 toy and one toy can be assigned to only 1 child.Find maximum number of children who can get the toy they wished.
5. LIS problem
6. https://www.interviewbit.com/problems/largest-number/
7. Subtract two linked lists in place.

Note: Paytm has been asking questions mostly from its archives - https://www.geeksforgeeks.org/tag/paytm/

I got to know this just before the test, from one of my friend. But questions for me were easy. (^ Might be helpful for others.)

IITR

        Same questions as mentioned above

PayPal

  IIT Kgp

Please update second question              

2. Number of distinct substrings of a string (Use suffix array).

IITM

Same as in IIT

IITKGP.

The second question on finding all the distinct substrings of a string passed only 5 test cases using Map, 6 with Trie, and all using only suffix array.(For passing all the test cases, take the substrings lengthwise and clear the map on inc the length of substring.)

IITH

1. Mobile Keypad problem. Variation of this: https://www.geeksforgeeks.org/combinations-strings-can-used-dial-given-phone-number/

2.

**Upper_Bound STL passed 9/11 test cases.sale

**Apply two pointer to pass all test case.

MindTickle

IITG

4 coding questions (90 mins) - Hackerrank

1. https://www.codechef.com/problems/SUBLCM
2. https://www.spoj.com/problems/QUEST5/ 

        Don’t remember other 2 questions. But they were very easy.

Can someone update other two questions ?

WorldQuant

IITB,IITD

Most of the questions were based on distributions, very few of type find the output of a pseudo code.

All questions were to be answered within given time.

Few Questions to get an idea of questions asked :

Flipkart-SDE

IITK, IITB, IITG, IITKGP,IITBHU

1. maxCoins
2. minRec Area
3. travelingIsFun Another Solution: https://ide.geeksforgeeks.org/JEdRJ8EIze

IITH, IITD

1. https://www.geeksforgeeks.org/minimum-steps-reach-target-knight/
2. Time conversion - eg :
   31st Jul 2017 ---> 2017-07-31

1st Jul 2017 ---> 2017-07-01

2nd Jul 2017 ---> 2017-07-02

3. Given 3 lists: friend_from, friend_sto, and candies where friend_from[i] is linked to friend_to[i] where weight is candies[i]. Your task is to find maximum connected component with same candy and return maximum product of 2 friends from that connected component.

How this problem can be done using union ? can You please provide the code .

I guess have a  modeified disjoint set union where basically where ur greatgreatSupergrandad dad would have the parameters as total candies and max1 and max2 in that component whenever u do union i Guess it helps.

IITR, IITM, IIT-Dhanbad

3 ques, 90 min, hackerrank/

smallestRestrictedPalindrome

(Approach: If we can find whether a given number in the array is prime or not, the question is done. No problems after that. So, the aim is to find all the prime numbers lying b/w the range minelem and maxelem(minelem and maxelem are the minimum and maximum elements of the array.) Find all the prime numbers till 10^6 using normal sieve. After that, in another array( call it primeNos), store the number starting from minelem till maxelem such that primeNos[1]=minelem, primeNos[2]=minelem+1, …...primeNos[maxelem-minelem+1]=maxelem. Now, run a loop on the previously found prime numbers and start cancelling the multiples of those prime numbers in primeNos array by marking them 0. All which will be left after processing all will be your primeNos. Make sure that you start cancelling multiple from somewhere near minelem and not from the very start, i.e near 0. For more information, check out question named Prime Generator on SPOJ.)

Q.No. 3 -> https://imgur.com/a/8UwCXPU

(Solution please??)  Solution please??++

Please Upload sample test cases 1 and 2 as well if available

For Q-2 Can we define seive function upto 10^9?or time limit will show? You have to use segmented sieve to pass all tests

IITH   (28-Oct-2018)

1. Knight tour problem. Given matrix of size N*N, Source(i,j) and destination(i,j). Find minimum number of steps to visit destination from Source.
   https://www.geeksforgeeks.org/minimum-steps-reach-target-knight

(Better use Queue and store pair (vertices) of pairs(count steps) and do do BFS)

2. Date Formatting  
   Ex: 1st Jan 1992 ---> 1992-01-01
   3rd Mar 1980  ---> 1980-03-03
   4th July 2010  ---> 2010-07-04
   14th July 2010  ---> 2010-07-14

3. Candy Problem. Need to do union-find. Question is almost (98%) similar to Flipkart IITK 3rd question travelingIsFun https://www.hackerrank.com/contests/hack-it-to-win-it-paypal/challenges/q4-traveling-is-fun

Can you please explain how it can be done using union-find?

Morgan Stanley

IIT BHU

please update(Python available??)

1.  Coin change problem. https://www.geeksforgeeks.org/coin-change-dp-7/
2.  A variation of https://www.interviewbit.com/problems/capture-regions-on-board/
3. Don’t remember the third

IIT G

        7 Syntax/Logical error correction coding questions in 20 minutes

                                +

        10 aptitude questions in 20 minutes

                                +

        3 coding questions in 40 minutes

<First two questions were similar to https://leetcode.com/problems/friend-circles/.

1. Given a binary 2D matrix, you had to convert 0s to 1s, maximizing the conversions when you can convert a group at once. You are supposed to leave a minimum of k groups. Return the number of 0s converted.
2. You just needed to copy paste the code from the first and change 2 lines :P
3. A simple problem, could be solved using warshall’s algorithm or simple dfs, finding the node with longest dfs in a directed graph.

>

{The constraints were pretty small, brute force solution worked like a charm!}

{If someone has screenshot or if someone can write the full questions, please do so!}

IIT KGP : 30th Oct 2018

Platform : Amcat

20 minutes - 10 aptitude (timetaking)

20 minutes - Syntax correction - 7 questions (easy)

60 mins - 3 coding questions

1. Given two circles with their centres co-ordinates and their radii , we need to find the non overlapping area between the circles. But the catch here was people didn’t know the function for cos inverse, sine inverse
2. CPP
   Refer : inverse trigonometric functions in cpp ...its asin(), I guess
3. Given  a 2D matrix of 1s(bright areas) and 0s(dark area, and s) N = Number of dark areas to be removed is given.
   Now, we had to find the least zeros left after converting the least N dark connected areas in the matrix.
   Ans : Connected Components of the graphs concept
4. Find the minimum of product all the paths from the tree to leaves. (question was not this)
   Ans:If we construct the tree, it takes time. So, just maintain an array of parents and perform this multiplication.

Optiver

IITB

1. Online Test : 8 min 80 questions - simple arithmetic questions ( +1 correct , -2 incorrect, -2 blank)
2. Offline Round :

1. Test 1 : 8 min 80 questions - same as above but this time with OMR ( +1 correct , -2 incorrect, -2 blank)
2. Test 2: 30 min 26 questions based on prediction of next term in series ( +1 correct , no negative)
3. Test 3: 20 min 45 questions: Guesstimates (+c correct, -c incorrect, -2 for blank)

1. Marking: For each question we had to write our confidence level from 1 to 5. So if we write a confidence level 3 in a question then if that question is correct we get +3 else -3.
2. Answer format: the nearest power of 10 to the guesstimate

1. Eg: population of india = 1.2 billion ,  ans = 9 (as 1.2 billion is closer to 109)

3. Questions were like:

The number of trees on earth?

Pages in oxford dictionary?

15!?

No of cycles in amsterdam?

No of hair on human head?

FIDELITY

IITG

4 sections:

1. Verbal
2. MCQs-Data structures+Networks+Mysql+OOPS
3. 2 Coding Questions(1 hr- easy)
4. 2 algorithm questions (given 2 random problem statements, had to write pseudo codes for both) (i)Minimum moves for Knight to reach King whose position is fixed.(BFS).

CODING ROUND-(STL,Python were allowed)

1. Given 2 strings A and B. Output the count of jumbled words of string A which are substring of string B.
   Input: A= ram, B=cmarma
   Output: 3 rma, mar, arm
2. Given three students A,B,C. They have to plant N saplings in a playground. They can use only 1,3,7 numbers, starting from A find the last student who sows the seed.(have to use maximum number possible each time).

1. Input: N=6
   Output: B (A=3 B=3)

Input: N=9
Output: C (A=7 B=1 C=1)

JPMC (SDE)

IIT (BHU)

CTC: 21LPA

2 coding questions on Hackerrank. Time: 65 min

    1.Stock buy and sell with two given conditions:

    -> Sell only after buying the stock(array keys can be considered timestamps)

    -> Sell beforehand and buy it later (just find maxima and minima)

    It was required to return (4)  iterators(days) on which you buy and sell in both conditions to maximise profit.

    The same question has been mentioned somewhere in 17-18` doc section)

Can someone elaborate on this question?+2

    2. Given an array and a window of size m. Pick the maximum element out of starting or last m elements if sizeof(arr)>m,

       else  find maximum out of sizeof(arr) elements.The no  of elements to be picked  was given.

       In case of two same valued maximas, return one with lower position in the array.

       (Use priority queue)  https://ide.geeksforgeeks.org/r4w1QC6W7z

I guess using 2 priority queues would be useful,one for starting m elements and the other for last m elements.

    Everyone came across same questions. I wanted some more time to solve both =(

IITB

65 mins 2 programming questions, hackerrank platform

1. Given an array and a number K, segment the array into K contiguous subarrays with at least 1 element in each subarray, such that sum of averages of each subarray is maximum. For example- arr=[9,1,2,3,9] and K=3, maximum value = 9+(1+2+3)/3+9 = 20

Any one plzz suggest solution for ques 1

2. Given a two dimensional array with 1 ‘R’, 1 ‘E’ and rest of them ‘O’ or ‘P’. Goal is to find the number of steps required to go from ‘R’ to ‘E’ while remaining on ‘O’ and avoiding ‘P’. It was given that, there is only 1 unique path which exists. Example-

O R O

P P O

E O O

This 3x3 matrix requires 5 steps- (0,1)->(0,2)->(1,2)->(2,2)->(2,1)->(2,0). Note- array need not be square.

This is not the exact language, but these were the essence of both the questions.

IITKGP

1. Same as IIT BHU Q. 2.

JPMC (Quant/Research)

IIT KGP, IITR, IITK, IITD,IITB

Platform: cocubes

a

Quant:

35 mins

18 MCQs : Puzzles, Probability(expected values, dice, card questions) etc

5 MCQs: JEE Math

7 MCQs: Coding (recursions, time complexity, tree etc)

Coding: (Different Sets)

2 Questions 40mins

1. Given a binary tree containing n nodes. The problem is to get the sum of all the leaf nodes which are at minimum level in the binary tree https://www.geeksforgeeks.org/sum-leaf-nodes-minimum-level/
2. Create a singly linked list of Leaf nodes from a binary tree

https://effprog.wordpress.com/2011/04/05/create-a-singly-linked-list-of-leaf-nodes-from-a-binary-tree/

      3.  Sum of all the numbers that are formed from root to leaf paths

https://www.geeksforgeeks.org/sum-numbers-formed-root-leaf-paths/

      4.  AGGRCOW: solution https://www.geeksforgeeks.org/place-k-elements-such-that-minimum-distance-is-maximized/

IITG

MCQ s same as IIT KGP --- Quant and probability was tough and really time consuming.

Coding (2 questions)

1.https://www.geeksforgeeks.org/place-k-elements-such-that-minimum-distance-is-maximized/

2. https://www.geeksforgeeks.org/kth-largest-element-in-bst-when-modification-to-bst-is-not-allowed/

3. https://www.geeksforgeeks.org/find-possible-words-phone-digits/

4. https://www.geeksforgeeks.org/sum-numbers-formed-root-leaf-paths/

5. https://www.geeksforgeeks.org/sum-leaf-nodes-minimum-level/

IIT B

Quant Type same.(Prepare Expectation Value..)

Some questions..

1. Expected number of times a dice to be rolled to get all faces once
2. Expected people to have some given prob of 2 having same birthday etc..

Coding-

1.Given a linked list get the deepest node which is the left child of some node and has the max value.

2. Convert all the leaf nodes in a Tree in the form of a linked list starting from rightmost to leftmost.(Just simple recursion).

IIT KGP

Platform: cocubes

Quant:

30 mins

18 MCQs : Puzzles, Probability(expected values, dice, card questions) etc

5 MCQs: JEE Math

7 MCQs: Coding (recursions, time complexity, tree etc)

Coding: Everyone had different pair of coding questions

2 Questions 40mins

1. Given a binary tree containing n nodes. The problem is to get the sum of all the leaf nodes which are at minimum level in the binary tree. https://www.geeksforgeeks.org/sum-leaf-nodes-minimum-level/
2.  Create a singly linked list of Leaf nodes from a binary tree

https://effprog.wordpress.com/2011/04/05/create-a-singly-linked-list-of-leaf-nodes-from-a-binary-tree/

3. Given a binary search tree, find all subtrees  such that all elements of the subtree are in the given range (l, h)

4. Given a binary tree, find the number of subtrees that are BST’s

5. Given a binary tree

                1

                 /    \

              2       3

           /    \        

           4      5      

For the above tree find the sum of numbers formed (here possible numbers are 124 + 125 + 13 = 262)

6. https://www.geeksforgeeks.org/place-k-elements-such-that-minimum-distance-is-maximized/

Razorpay

IITR

PrisonBreak

Another Set :-

90 min. (3 coding+10MCQ); test was on hackerrank platform.Climb the hill`

Q.No. 1 -> https://www.evernote.com/l/AVH55Vp41glDq4DUhgGDUA5FRBURfYXLsGU/

Solution to Climb the Hill: https://www.geeksforgeeks.org/minimum-incrementdecrement-to-make-array-non-increasing/ 

Q.No. 2 -> https://www.evernote.com/l/AVGkas-I-L9KCo7GmbZljaQKaq63Gxgf5rM/

Q.No. 3 -> https://www.evernote.com/l/AVEt83J4bORB66Odbv0-OnOP43qrV_XQ8BI/

(https://www.geeksforgeeks.org/count-ways-express-number-sum-consecutive-numbers/)

IITG

Duration : 1.5 hrs Platform- Hackerrank

Coding Section:

1. https://leetcode.com/problems/degree-of-an-array/
2. Find minimum elements of all k size window of an array , and find max element among them.

        Similar problem: https://www.interviewbit.com/problems/sliding-window-maximum 

      3.   Similar to: https://www.geeksforgeeks.org/making-elements-distinct-sorted-array-minimum-increments/ 

Objective question:

        10 objective questions related to Binary tree, N-ary tree, Sql, Probability, Time-complexity

IITM

1.5 hrs; 3 coding + 8 Technical MCQs

1st Coding question was same as IITG 2nd Problem.

Link to other coding questions: https://postimg.cc/gallery/270u1w6mc/

IIT BHU

1.5 hrs; 3 coding + 8 Technical MCQs

1st Coding question = Q.No. 1 -> https://www.evernote.com/l/AVH55Vp41glDq4DUhgGDUA5FRBURfYXLsGU/

Solution to Climb the Hill: https://www.geeksforgeeks.org/minimum-incrementdecrement-to-make-array-non-increasing/ 

Link to other two coding questions: https://postimg.cc/gallery/270u1w6mc/

EXL Private Ltd

CTC: 11.2 lac In-Hand

IITR

(12-10-2018)

CGPA Cutoff- 6.7 (shortlisted about 300 students)

Test on cocubes; 45 minutes- 40 questions

20 Quant, 10 LR/DI, 10 Verbal

LR/DI was a bit trickier than the rest

Verbal was easy could be done in 7 minutes while quant and LR/DI were time consuming so overall paper was lengthy according to time. Paper was quite tough if compared with Pariksha papers/practice.

1. Test Sections

45 min 40 question

Marking Scheme :- +1, -.25

Test is conducted on , one can find some mock papers of cocube available online

Questions division :- 20 quant, 10 LR, 10 English

2. Test Experience

Difficulty level: Avg and above for quant. English and LR were relatively simple

In quant, revise ratio and mixtures properly

Also questions on the sum of factors, no. of the factor of given no. (see formula)

IITK

Position: Consultant 11.2Lakh

45 mins 40 questions on cocubes

10-verbal

10-reasoning

20-quant+DI

Quant is the most time consuming section, topics were similar to standard aptitude topics like cistern-pipe, work-time, probability.., functions

BNY Mellon Technologies/INAUTIX

80k USD for New York and 21LPA in India

Any information on option for pittsburg hiring

IIT(BHU)

Date - 24th September,2018

Profile - Software Engineer

5 coding questions/ 2 Hour test on hackerrank(different sets for everyone)

New set:

1. Cavity Map https://www.hackerrank.com/challenges/cavity-map/problem
2. To find number of possible paths in a matrix of 1’s and 0’s from top left to bottom right (with condition given that the path doesn’t go through any zero
3. Fused nuclear rods https://www.careercup.com/question?id=5721734273564672 C++ code
4. Two operations are possible: ADD- add 1 to number and MULTIPLY- multiply number by 2. Find the minimum number of operations to take number from 0 to k (given) using only above two operations        
5. Friend Circles        https://www.hackerrank.com/contests/juniper-hxackathon/challenges/friend-circles C++ code

New Set:

1. https://www.geeksforgeeks.org/stack-set-2-infix-to-postfix/  Stack Operation    
2. https://github.com/Nehoss/Ascending-Binary-Sorting C++ code
3. https://www.geeksforgeeks.org/count-ways-reach-nth-stair/
4. https://www.hackerrank.com/challenges/travel-in-hackerland/problem [Similar question not exactly same]
5. Generate all possible sub-sequenc a string https://www.geeksforgeeks.org/print-subsequences-string/           
6. Maximum points from top left of matrix to bottom right and return back g4g Topcoder

New set:

1. Given two arrays A and B, print the elements that are common in both
2. Convert the given prefix expression to postfix expression.
3. Problem was on disjoint set. Given 3 arrays, A, B , C (A for starting node, B for end node, C for query type). Query type will be either 0(to take union of groups in which A[i] and B[i] fall) and 1 (to print sum of size of group of A[i] and B[i]).
4. Read .json file. Didn't attempt as only option was to use Objective C.
5. huffmanDecode

IITK

Date - 1st October,2018

Multiple sets. Listing them sequentially -

New set:

1. https://github.com/josergc/min-max-product: C++ proposed solution`
2. https://www.geeksforgeeks.org/check-whether-two-strings-are-anagram-of-each-other/
3. https://www.geeksforgeeks.org/program-chocolate-wrapper-puzzle/
4. https://www.geeksforgeeks.org/connected-components-in-an-undirected-graph/
5. https://www.hackerrank.com/challenges/strplay/problem

New set:

1. repeat: Read .json file question (above mentioned by IIT BHU)
2. Given an array of integers, return total number of pairs having sum multiple of 60.
3. Given intervals within range of 1 to n, find the least position having maximum overlap.
4. https://www.geeksforgeeks.org/count-ways-express-number-sum-consecutive-numbers/

New set:

1. https://www.geeksforgeeks.org/find-minimum-difference-pair/ + print all pairs with minimum difference (no duplicates)
2. https://www.geeksforgeeks.org/minimum-number-of-manipulations-required-to-make-two-strings-anagram-without-deletion-of-character/
3. Given 2 numbers a and b, you have to return 2*x+3*y if solution exists for following equations:

1. x + y = a
2. x xor y = b
3. x >= 0 (https://www.geeksforgeeks.org/find-two-numbers-sum-xor/)

4. https://www.geeksforgeeks.org/count-possible-paths-top-left-bottom-right-nxm-matrix/ 
5. huffmanDecode

New set:

1. repeat
2. repeat: Given an array of integers representing seconds. Find number of pairs whose sum gives some minute (i.e. a + b = multiple of 60) : Example : [20,40,60] -> ans = 1
3. (Medium) Decode the string given formed of {1-10, 11#-26#, (some integer)}. Decode following this scheme.

1. 1-> a, 2 -> b, ..., 10 -> j
2. 11# -> k, ..., 26# -> z
3. 11# (3) -> kkk, (i.e. consecutive letters are represented with their code and followed by parentheses with their occurence)                  

4. (Hard) repeat: https://www.geeksforgeeks.org/maximum-points-top-left-matrix-bottom-right-return-back/
5. (minimum steps to travel from (0,0) to (x,y) collecting all gold coins. Can move in East-><-West, North-><-South.Hard) Given a matrix and (x,y). Matrix consists of 0,1,2. 0 means non-blocking, 1 means blocked, 2 means gold. Find m

New Set:

1. (Easy) Find the size of the largest connected component given the graph.
2. (Medium) g4g 
3. Degree of an array is the maximum frequency of any element. Find the length of the shortest subarray which contains all occurences of the most frequent number (there can be more than one most frequent number).
4. (Hard) Given a matrix and (x,y).Matrix consists of 0,1,2 . 0 means non blocking, 1 means blocked, 2 means gold. Find minimum steps to travel from (0,0) to (x,y) collecting all gold coins.Can move in East-><-West, North-><-South. Number of 2 <= 10 (????????? Solution for Q4 anyone ???????????)
5. (Hard) Find Number of Pairs

IITR

Questions were same as IIT Bhu and IIT K in different sets

5 ques., 2 hrs, hackerrank

Set1: 1. https://imgur.com/a/r614S79 

           2. (Hard) Given a matrix and (x,y). Matrix consists of 0,1,2. 0 means non-blocking, 1 means blocked, 2 means gold. Find     minimum steps to travel from (0,0) to (x,y) collecting all gold coins. Can move in East-><-West, North-><-South.

          3.

Set2:   1. Generate all subsequences of a string and return in lexicographic order

        2. Prefix to postfix (same as above)

        3. Beautiful subarray https://www.geeksforgeeks.org/number-subarrays-m-odd-numbers/ 

        4. Nuclear rod (same as above)

        5. Travel from (0,0) to (x,y). Grid has 0, 1, 2. 0- you can pass, 1- blocked, 2 - gold. Shortest path. (same as above)

IITG

Date 27th Oct 2018

 New Set:

   1- https://github.com/josergc/min-max-product: C++ proposed solution

   2-Given a graph, find the minimum of all friend factor of each trio. (trio is a triangle of edges)

What is friend factor : for each trio (3 nodes that are all connected to each other), the friendship factor is defined as the sum of number of nodes that each of the three are connected to, other than each other.

   3- https://www.hackerrank.com/contests/hack-it-to-win-it-paypal/challenges/q4-traveling-is-fun/problem

   4-Fused nuclear rods https://www.careercup.com/question?id=5721734273564672 (Done using Disjoint Sets  Problem similar to Friend Circle Problem - Approach used- Counting of Size of each Component in graph)

  5- Beautiful subarray https://www.geeksforgeeks.org/number-subarrays-m-odd-numbers/ 

Microsoft

Hosting on cocubes platform: STLs allowed

IIITD

Date - 6th July 2018

Profile - Software Engineer

3 questions/ 1.5 Hour test on cocubes

When is the Microsoft test in IITs? Any test before 10th October? Please post the questions immediately. :) +1

Eligibility: B.Tech. CSE, EE, ECE, MSM

                IDD CSE, EE, ECE

                M.Tech. CSE, EE, ECE (IITR) No CGPA cutoff to apply

1. https://www.geeksforgeeks.org/round-the-given-number-to-nearest-multiple-of-10/ C++ efficient code
2. Similar to https://www.hackerrank.com/challenges/30-binary-numbers/problem C++ proposed code
3. Delete N nodes after M nodes of a linked list C++ code (function linkdelete)
4. Given 2 arrays, find sum of uncommon elements

1. Sorted arrays: C++ code
2. Unsorted arrays: C++ code
3. Unsorted arrays elegant code (uses STL): C++ code with explanation

(There was one more set I will ask my friends to add those & cocube interface was too poor we couldn’t debug the codes)

IITG

Date - 10th Oct 2018

IDC profile: 3 questions/ 1 Hour 15 minutes test on cocubes

Languages: C, C++, JAVA, C#

Different sets

1. https://www.geeksforgeeks.org/reorder-a-array-according-to-given-indexes/
2. https://www.geeksforgeeks.org/maximum-sum-such-that-no-two-elements-are-adjacent/
3. https://www.geeksforgeeks.org/arrange-consonants-vowels-nodes-linked-list/
4. https://www.interviewbit.com/problems/sorted-permutation-rank/
5. Finding Minimum-Cost Path in a 2-D Matrix with Right, Down and Diagonal move allowed. Variant: https://www.hackerearth.com/practice/notes/dynamic-programming-problems-involving-grids/
6. https://www.geeksforgeeks.org/lexicographic-rank-of-a-string/ This question was there originally. Deleted by someone.

IITR

Date - 10/10/2018

1. A string is given. Minimum no. of characters to append to the string such that it will become palindrome. Print them
2. A number is given in string form. Manipulate the string to tell the next greater element that can be formed
3. https://www.geeksforgeeks.org/sum-leaf-nodes-minimum-level/
4. Given an array of n elements and an integer k. Group the elements in k. And then sort the array

Ex: [1, 23, 4, 3, 8, 9] and k = 2. So number formed are 123, 43, 89. Now after sorting, it will be 43, 89, 123. Return the array as [4,3,8,9,1,23]. n will always be multiple of k Can someone provide solution for this?+4  https://codeshare.io/2jDxRR

5. https://www.geeksforgeeks.org/maximum-sum-such-that-no-two-elements-are-adjacent/
6. https://www.geeksforgeeks.org/find-distance-between-two-nodes-of-a-binary-tree/
7. Decode the string. Given a character array number is mapped to corresponding alphabet and “_” is mapped to space. If there is “#”, after “#” is a number. There will be no “_” and “#” in returned string. Something like that.

Sample Input -  3 2 20_21 # 1 # 2_#11 4 @11

Sample Output - CBT U12 11D@H

Question is not clear...can someone please explain in little more detail..

Please take care of char pointer it waste so much time , cause me one ques (microsoft) (seriously, don’t overlook this.)

IITD

1. Print sum of the cousin nodes of a given Binary tree. (Cousin nodes are at same level but of different parents)
2. Given a date and a day pair in the calendar, return the day corresponding to a query date.
3. Given a string, return the minimum no. of characters to append at the end of string such that it becomes a palindrome
4. Given an array of n elements and an integer k. Group the elements in k. And then sort the array
5. https://www.geeksforgeeks.org/find-distance-between-two-nodes-of-a-binary-tree/
6. Delete N nodes after M nodes of a linked list 
7. https://www.geeksforgeeks.org/sum-leaf-nodes-minimum-level/
8. Given a number in the form of a string. Find the the next larger number that can be formed with the same set of digits. Print -1 if not possible.

IITM, IIT BHU, IIT Dhanbad

Exactly same set of questions as above, no problem other than the ones mentioned by the other IITs above.

IIT KGP

Most questions same as above

1. Find the no. occurences of the given word (char *) in a char board of size m*n - e.g. no. of occurrences of hello are 2

IITB, IITH

Repeat from above questions

(Many questions need to be solved without using extra memory take care of that in test)

https://ideone.com/laser0/microsoft_2018

Goldman Sachs

IIITD

Date - 6th July 2018

1 Position - Analyst

1 hour test @hackerrank

1 coding question(20 min)    

count all possible quadrilateral by joining different sides of a quadrilateral. count all possible quadrilateral by joining different sides of a quadrilateral (is it by joining different sides of a quadrilateral or different sides of a regular polygon?)

4 Q’s on Computer science basics(20 min)

AVL tree,  Probability & Stat and addition of two hexadecimal number.

4Q’s on Analytical comprehension(20 min)

IITR (internship)

Coding:

1. Given strings with (x,y) coordinates , for an input string find the nearest string . two strings are nearest if they have same value at x or y coordinates.
2. Find the smallest number greater than given number and largest number lesser than given number , with same number of set bits as in given number.link
3. Which of the following will be the correct method to swap two numbers in all possible case. Options were exor, product & division, sum and difference: Correct answer - exor

Quant:

1. Find the expected number of events required to get three consecutive sixes on a dice. ( E = 258)
2. Same as 1 , given that first two outcomes are two sixes. ( E = 216)
3. Two questions on hamiltonian cycles in a graph. Conditions and conclusions.(Could you please recollect and tell they questions, at least the outline)
4. A paragraph on Buffon’s Needle - (find the expected number of “crossings” a L-shaped bar , and a ring would do) (The distance between the lines and the diameter of the ring and the two sides of the L shape were given)

IITD

Nov 2, 2018

1. minBin

   MCQ Questions

    2.  A tree was given in the question (containing around 30 nodes) and the location (node no.) of police and the thief was given, the thief will try to avoid the police till the time he can, both police and the thief will select the optimal node always.

Find the time when the thief will get caught. At each section the thief can either jump to the next node or stay at its position.

Approach?

   3.  We have 128 students, we need to organize minimum number of matches to find the second best student.. The ordering follows transitivity i.e if a beats b, b beats c then a can beat c.

•    4.  Code for queue implementation using stacks was given. If we have n insert and m delete operations, then find the range in which the number of push operations(x) and number of pop operations will lie. Eg. options were of this form n+m<=x< 2n and  2m<=y<n+m https://www.geeksforgeeks.org/data-structures-and-algorithms-set-17/

5.  Find the expected number of inversion, for all permutations of elements of the array.

The answer was n(n-1)/4.The options were nc2,nc2/2,nc2/4,2*nc2

Passage on Lambda calculus

Given Lambda Calculus Formulae for True, false, and the definition of a Function, its parameters, arguments etc 

6. What will be the lambda calculus formula for and operation?

7. What will be the lambda calculus formula for if x then y ?

 Passage on Hamiltonian cycle

8. Questions were based on properties of Hamiltonian Cycle with >=10 vertices.To find the true statement among 4 options. A graph having >= 10 vertices and each vertices having even degree was given.

The options were( others could check and correct)

a.Whether a bipartite graph can be formed from the above graph.

b.Whether a cycle with n edges exists

c. Hamiltonian cycle exists.

d. Don’t remember !!!

e. None of these

9. Sufficient condition to have hamiltonian cycle.

1. All should have even degree
2. All should have odd degree.
3. ……..didn’t remember………..

Quant Section:

1.Find the 100th element of the series 1,3,4,9,10,12,13,27,28…

The option correct was 981.

2. Find the f(19)=94, and for each x, f(x)+f(x-1)=x^2. Find f(94)%100.Ans 61 how?

3.Weather Question, Probability of sunny is 0.4, rainy is 0.4, and cloudy is 0.2. Given 10 days, find the expected number of contiguous blocks of weather. SSSSRRCCCC is 3 blocks. Explanation?

4.We have a line segment of length 2, given a uniform distribution of choosing a point on the line, find the probability of the rectangle formed by 2 partitions formed by choosing a point having an area less than 0.5(so if x is chosen on the line segment, the l and b are x and 2-x, and area is x(2-x) solution?

5.Which of these are not affected by outliers - mean mode median and one other option.

The Options were 1 and 2, 2 and 4 etc etc Median is least affected.

6.If model has low bias and high variance which of the the following options are used to remedy it.

Regularization,Increasing the number of samples, decreasing the number of features,and increasing number of features

7.

8.2 stock questions which were really of probability and normal, and Geometric distribution, and correlation. Seemed Difficult   af.

9.Given a circle, and a dart is thrown on the circle, find the probability of dart being closer to centre.

1/4

10.Find the probability if there is a square instead of circle. Integration using Parabola is required.
https://web.calpoly.edu/~sherman1/puzzleoftheday/potw_019soln.pdf

 20 questions, 2 hours

IITM

2 Sections 2Hrs.

Computer Science ( 1 coding question + 8 MCQs)

Quant (10 MCQs)

Coding Qutestion: https://postimg.cc/gallery/dslda03o/

Alert: ML questions were there!

Link

(IITB, IITKGP, IITR,IITG,IITBHU)

x 

https://math.stackexchange.com/questions/990418/maximum-value-of-sin-a-sin-b-sin-c/990423#990423

(answer is 3sqrt(3)/2)

https://ide.geeksforgeeks.org/l8wRDc3gJ8

(Quicksort moves element 50 out temporarily in one of the steps considering array {53, 91, 50, 40, 90, 80, 35} )

Ans of 14 question (ML Classifier)?

 IIT-D

2 Sections (Coding and Quant)
Coding Section - 1 Coding Question(20 marks), 4 MCQs(10 each), 2 comprehensions each consisting of 2 MCQs(10 marks each MCQ)

Quant - 6 MCQs (10 each), 2 comprehensions, 2 MCQs in each (10 marks each MCQ)

Total time 2 hrs. (you can attempt any question at any time, there is no separate time for any section)

Coding -
1) Given an array of whole numbers, you can remove subset of elements from that array, till all elements are removed.
The elements of any subset should satisfy the condition 2^b1 + 2^b2 + …. + 2^bn = 2^x for some integer x (b1, b2, ….., bn are elements of one subset). What is the minimum number of subsets that need to be removed

Eg. array = 1, 1, 2, 3, 3
Ans. 2
2^1 + 2^1 + 2^2 = 2^3
2^3 + 2^3 = 2^4
Therefore, two subsets need to be removed

n<=10^6

0<=a[i]<=10^6

Ans.If two elements are same, merge them into one and add one to it, keep on doing it till all elements of array are distinct, size of that array will be your ans
Eg. 1, 1,  2, 3, 3
Can be converted to 2, 2, 3, 3

3, 3, 3

4, 3

Ques 2) A graph and a node was given, we need to find the depth of it(distance of farthest node from it)(MCQ)

Q3) 128 players play in a tournament, there strengths are ordered eg. if x beats y and y beats z then x will beat z, what is the number of matches required to find out the second best player

Ans 133

Q4) Expected number of inversions in a permutations of N numbers (i < j) and A[i] > A[j]

Ans. N(N-1)/4

Q5)

Q6)

Q7 and Q8 were a comprehension on lambda calculus
Q9 and Q10 were on hamiltonian cycle

Quant
Q1)

Find out the 100th term in the series 1, 3 , 4, 9, 10, 12, 13, 27, 28 ….

Ans. 981
Ith term is convert i to binary then read that binary notation in base 3
Eg. for i = 5
I in base 2 is 101, converting it to decimal using base 3 is 3*3 + 1 = 10

There is one other visualization of it, the even terms of series are a series of 3*(terms of series) 3*1, 3*3, 3*4, 3*9 ….  And odd term is even term+1

  Q2)

f(x) + f(x-1) = x^2

f(19) = 94

f(94)%100 = ?

Ans. 61

Q3)

On any day, P(rain) = 0.2, P(sunny) = 0.4, P(some other type of weather) = 0.4, a block is defined as continuous days with same type of weather, expected number of weather blocks in 10 days = ?

Ans. 169/25 (Linearity of Expectation)

Q4)

On a stick [0, 2], a point is randomly chosen and stick is broken there. A rectangle is made by using the two parts of sticks as side length. What is the approx. probability that Area of rectangle < 1/2

Ans 0.3 was nearest among the options
Not verified

Q5) Which among the following are unaffected by outliers
1) mean

2)median

3) …..Can’t remember

4) Inter- Quartile range

Ans. 2 and 4 (options were consisting of multiple combinations of 1, 2, 3, 4)

Q6) Something on how to improve model with low bias and high variance

Q7) and Q8) Comprehension on correlation of market with stock

Q9) Probability that randomly chosen point inside a circle is near to center than side

Ans. ¼ (Way too trivial)

Q10) Probability that randomly chosen point inside a square is near to center than side = (a*b^0.5 - c)/d, Find out a+b+c+d

Ans. 14

Regions where point is nearer to center can be expressed as parabolas (by definition of it) , integrate one parabola and multiply by 4

 IIT-KGP Nov 3

2 Sections (Coding and Quant)
Coding Section - 1 Coding Question(20 marks), 4 MCQs(10 each), 2 comprehensions each consisting of 2 MCQs(10 marks each MCQ)

Quant - 6 MCQs (10 each), 2 comprehensions, 2 MCQs in each (10 marks each MCQ)

Total time 2 hrs. (you can attempt any question at any time, there is no separate time for any section)

Questions of Quant Section

Q1) For a ordered pair(a,b) ax + by = 1 and x^2 + y^2 = 50 has atleast one solution. Find total number of integer pairs of (x,y) Ans: 72

Q2) find the minimum value of the function in [0,pi/2]:

Ans: 12

Q3) Train accuracy is 40% and test accuracy is 30% for a classifer. Which of the following can be done?

        I.        Increase the data

        II        Increase the features

        |||        Decrease the number of features

Ans - II only

Q4)        For a triangle , find the minimum value of sinA + sinB + sinC

Q5)        Find the min value of

Ans:        1

Q6) f1(k) = square of the sum of the digits of k. And for n > 1, fn(k) = f1(fn-1(k)). Find the value of f1998(11).

Ans: 169

Q7  X and Y are two random variables with uniform distribution (0,1). Find probability of x*y < 0.5.

Ans - 0.85

What is the answer of 14 (ML Classifier)?

I think its 2 only (Increase the features).

What did you mark?

Both (increase features and data sample)

Qualcomm

(CPI Cutoff?)  (Branches Allowed ?)

IIITD

Date - 6th July 2018

Position -

1.5 hour@ HirePro (+3, -1)

CGPA: 6.5 & above

20 Q’s/30 min Aptitude, DI and LR

20 Q’s/30 min C  

C pointers (Around 5 questions), , operator precedence (Around 5 questions), switch cases etc

20 Q’s/30 min CSE                                        Topics

OS, Architecture, digital logic, semaphores, Algo,

IITM

Date - 6th oct 2018

1.5 hour@ HirePro (+1, -0.25)(yes negative marking was there )

Same as IIITD

After 2 section, we have choice of selecting one section from ML, CS, Communications, Hardware

ML part

Simple questions on linear regression, Neural network(time and space complexity), loss function, some OS questions, LRU page fault count.

Adobe

(CPI Cutoff?)  (Branches Allowed ?)

IIIT D

Date - 6th July 2018

Position -

1.5 hours Coding + 1 Hour aptitude(NO Negative Marks) @ Hackerrank

Q1. Sort the characters of a string and print the string

Q2. find the lexicographically smallest string after rotating a string (What is required time complexity??)

Q3. In a directed graph find all pair of node which can be traversed 

IIITA

Q2 kadane algo take the substring of temporary string of size same as original string starting from second character (or index 1). What is the question?
Step 4 : Increase the count.https://www.geeksforgeeks.org/adobe-interview-experience-set-55-campus-full-time-mts-profile/

Q3 substring search

    s1:
aab  s2:a*b o/p 2(ab, aab)

    * can be anything null also

Could someone please explain the question and its solution

https://www.geeksforgeeks.org/adobe-interview-experience-set-55-campus-full-time-mts-profile/

Coding round questions from above experience(link) were exactly same at IIITA

PLZ SHARE SOLUTION??

IITKGP

Requested Clarifications: When was the test? Only one coding problem? Aptitude test? -> This question has been asked in internship because for placements adobe is yet to come at kgp.

     A square grid(matrix - n x n) is given, with values 0, 1 or -1 in each cell. 0 means there is a path via that square. 1 means there is a diamond in it(and obviously a path via it). -1 means no path, i.e. obstacle. Starting from (0,0) u need to go to (n-1,n-1) and return back again. When going from (0,0) to (n-1,n-1) you can take only right or down and during returning u can only take left or up. The question is to find maximum number of diamonds that can be collected in a round trip.If no path exists return 0(since u collected no diamond) g4g Topcoder

IITM

06/10/18

# of Coding Questions: 3

Time : 90min

Platform: Hackerrank

        Ex:         given array = 11223

                Output: 3

                Exp: Remove 11 and then 22. Only 3 is left in the array.

                Given array = 21123

                output : 3

                Exp: remove 11, then array will be 223, now remove 22.

                Given array = 21132

                Output: 232

                Exp: remove 11, then array will be 232. Can’t remove further.

Solution: can use linked list and after deletion go back to head or previous node (keep a pointer for that). I got full points using this.

Output for the following? 2121:  2121  , 112213: Is it 13 or just 3?

Can We use Stack instead of LL?  yes

Q2.0.

Input 1: babababa        

Output 1: ababa

Input 2: babababab

Output 2: babab

Solution: take an unordered map(string, int) and put all substring of length 5 in it, sort it , now traverse the map, the first maximum count(frequency) value will correspond to largest frequent substring of length 5. This solution pass all cases, except the one, which was giving timeout. Replace unordered_map with array of length 26^5 to get AC for all cases. How does taking array help? Can anybody please elaborate?

Q3.https://www.hackerrank.com/challenges/challenging-palindromes/problem

        Ex:        given: 3

                        ban

                        3

                        ana

                Output: 5 (because of anana)

                Exp:        palindromic string S will be an + ana = anana.

        Solution: concat s1 , s2 lets say s3 = s1+s2, apply LCS on reverse of(s3)(row) and s3(column) , bottom rightmost value, will be the answer. I did it that way and got full points for that

How this can give the answer? Here subsequences from s1 or s2 may come up in sol but that is not allowed ryt? So what's the problem, that's what is asked. The whole batch used this approach and able to get full marks.!!

In the link that has been mentioned, we have to pick substrings from s1 and s2 and not subsequences. The solution that has been given above is for the latter case.

IITK

Q1. https://www.geeksforgeeks.org/queries-counts-array-elements-values-given-range/

Q2. https://www.geeksforgeeks.org/minimum-sum-absolute-difference-pairs-two-arrays/

Q3. Traverse all node of polygon using diagonals only, initially few diagonals are given, condition of drawing new diagonal is it should intersect any previous diagonal, return no of ways.

Eg in hexagon, {1,4,2} is given, o/p 1. How{2,6,3,5,1}.

Tried to brute force, 7 passed out of 10 hidden, rest TLE.

IITD

---

 

Can there be a greedy solution to Coconuts Easy problem?  

Solution Link : http://qa.geeksforgeeks.org/4323/qa.geeksforgeeks.org/4323/finding-maximum-number-of-mood-swings.html?fbclid=IwAR17pY87_Dq2jM934XaSEH3T7jczsKfU5fn3YpqQXH5HrULWjR1k_7c9QWc 

Estee

IITD

1. Turnstile
2. https://www.interviewbit.com/problems/knight-on-chess-board/

Bidgely  → test done?

Cisco

IITM

Date - 17th September 2018

Role : Software Engineer

Open for : Btech, Dual, Mtech, MS in CSE and EE

Exam Pattern :

1 hour MCQ type exam, based on HackerRank, 50 questions.

Questions covered areas like aptitude (time and work, logical reasoning), probability, OS(scheduling, concepts of paging), questions from Electrical Engineering (3-4), Computer Networks (Most were from subnet masks and host / IP addresses), permutations and combinations, finding output, questions about linked lists (3-4 basic ones).

IITG

Date - 24th Sept 2018

Exam Pattern : Same as IITM

Questions covered areas same as above including Digital Logic design , Counters(Ripple counters , input and output frequency relation in counters ), from Programming MCQs few problems are from bitwise operators (Like : “int a = 2 ; int b = 3 ; a ^= b ^= a =^b ; “ what will be the change in values?) ,structures.

3 ants in a triangle. Probability that  2 or 3 of the ants collide ?

https://www.quora.com/If-5-letters-are-posted-for-5-different-addresses-how-many-ways-are-there-for-each-of-the-letters-to-reach-wrong-addresses

Postorder from preorder traversal.  

Basic Networking Questions like where does routing takes place ?

Samsung R&D Bangalore

Samsung Software-Competency Test

1)    Test Details & Pattern

         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, Samsung

·   NOT dependent on any Platform/API

2)   Preparation recommended

             Refresh/Learn 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 external websites for study/practice: geeksforgeeks, hackerrank, codeforces, topcoder, codechef, spoj, project-euler etc.

 They have very frustrating software which need to be installed on the day of exam(compatible only with WINDOWS).

In that software, you may face a lot of login issues. Make sure once you login,you stay in it. If you come out, after logging in, that same password doesn’t works. (coordinator may give common password to all then)

Note:

1. There is some sample input pop-up from where you need to copy the test case in order to run for your local testing.
2. There is some full screen button somewhere(though I was not able to find it out, very few of us got it)
3. Scrolling up and down is a big pain.
4. Eclipse will be prefered(or save code  in Notepad).
5. Don’t trust their server, your code may be flushed, if in case you are facing network issue.
6. In case test starts at 9, but due to some issue, you logged in at 9:15, then your 15 mins are gone.(They have some common server timings)

Can we use vector , stack , queue etc from #include<vector>, #include<stack> etc ? In test these worked. ??? (Nope you can’t use any of the above asked libraries ) what does it mean ??? Was string class allowed in cpp ?(nope you can’t use string , only the functions mentioned in above table are allowed ) was sort() function allowed? (you will have to implement sort function if required sort() not allowed )

IIT M   Solution please?

Role: software engineer and software engineer research

Test  was of 3 hour. Only 5 submission allowed(compile as many times you want). 10 test cases to be passed

Date: 24/09/2018. Question was same as that of previous year.

gscs.samsung.com/download/gscs103.zip]

Cycle in directed graph number of vertex(n), number of edge(m). Then in next line m pairs of numbers representing edges of directed graph. Find if there is some cycle. If yes, print cycle in ascending order of vertex numbers involved in the cycle else print 0 (if there are multiple cycles print any one)

Total no. of test cases: 10                None of them had the “No Cycle” graph.Samsung

IIT D

Role: Software Engineer and Software Engineer Research

Date: 28/09/2018

2-coloring in Undirected graph Given an undirected graph, if the graph can be coloured in two colors such that no two adjacent vertices are of same color then print the vertices which belong to the same color (you can print vertices with color 0/1), otherwise print -1.

Input :  First line gives number of vertices(V) and edges(E) (e.g. 7 10)

          Next line contains E pairs representing edges.

IIT K

Role: software engineer and software engineer research

Date: 09th Oct 2018

Test  was of 3 hour. Only 10 submission allowed(compile as many times you want). 50 test cases to be passed

Question:  Constraints: N <= 50; M <= 50

Inefficient Solution (passes all test cases): Consider jump of length = 1 to N-1 and for each case check if Destination is

reachable. For first jump_length we reach destination return that.

Start at bottom {

For jump_length in 1 to N-1 {

For all continuous 1’s in that row{e

        For (current row - max_length) to (current row + max_length) {

                Visit node if not visited;

Another method using backtracking. C++ CODE

IITG

Mr. Kim has to deliver refrigerators to N customers. From the office, he is going to visit all the customers and then return to his home. Each location of the office, his home, and the customers is given in the form of integer coordinates (x,y) (0≤x≤100, 0≤y≤100) . The distance between two arbitrary locations (x1, y1) and (x2, y2) is computed by |x1-x2| + |y1-y2|, where |x| denotes the absolute value of x; for instance, |3|=|-3|=3. The locations of the office, his home, and the customers are all distinct. You should plan an optimal way to visit all the N customers and return to his home among all the possibilities.

You are given the locations of the office, Mr. Kim’s home, and the customers; the number of the customers is in the range of 5 to 10. Write a program that, starting at the office, finds a (the) shortest path visiting all the customers and returning to his home. Your program only have to report the distance of a (the) shortest path.

Constraints

5≤N≤10. Each location (x,y) is in a bounded grid, 0≤x≤100, 0≤y≤100, and x, y are integers.

Input:

You are given 10 test cases. Each test case consists of two lines; the first line has N, the number of the customers, and the following line enumerates the locations of the office, Mr. Kim’s home, and the customers in sequence. Each location consists of the coordinates (x,y), which is represented by ‘x y’.

Output:

Output the 10 answers in 10 lines. Each line outputs the distance of a (the) shortest path. Each line looks like ‘#x answer’ where x is the index of a test case. ‘#x’ and ‘answer’ are separated by a space.

I/O Example ::::   Input (20 lines in total. In the first test case, the locations of the office and the home are (0, 0) and (100, 100) respectively, and the locations of the customers are (70, 40), (30, 10), (10, 5), (90, 70), (50, 20).)

5  Starting test case #1

0 0 100 100 70 40 30 10 10 5 90 70 50 20

6  Starting test case #2

88 81 85 80 19 22 31 15 27 29 30 10 20 26 5 14

10  Starting test case #3

39 9 97 61 35 93 62 64 96 39 36 36 9 59 59 96 61 7 64 43 43 58 1 36

Output (10 lines in total)

#1 200

#2 304

#3 366

IITR

Date : 28 Oct’ 2018

Role : Software Engineer (Research and Developer) .

Same Question for both.

Test was of 3 hour. Only 10 submission allowed (compile as many times you want). 50 test cases to be passed

Question Link : There is dedicated Samsung software for coding test the question is given below:

There is one spaceship. X and Y co-odinate of source of spaceship and destination spaceship is given. There are N number of warmholes each warmhole has 5 values. First 2 values are starting co-ordinate of warmhole and after that value no. 3 and 4 represents ending co-ordinate of warmhole and last 5th value is represents cost to pass through this warmhole. Now these warmholes are bi-direction.

Now  to go from (x1,y1) to (x2,y2) is abs(x1-x2)+abs(y1-y2).

The main problem here is to find minimum distance to reach spaceship from source to destination co-ordinate using any number of warm-hole. It is ok if you wont use any warmhole.

(solution is also in comments in the post link) .

Constraints : 0<=N<=5

All the best!

IITBHU

Signal Amplifier : (see IITK )

IITB

We are given a function f  = a*n + b*n*logn + c*n^3 . The function is monotonic, we will be given a, b,c as input and a variable k ( value of function at some value of n). We need to find the value of n such that f(n)=k.

0 <= a,b,c  <=10^6

0 <= k  <= 10^63 - 1

1. The upper bound of n was given
2. They gave code for finding logn
3. Sol: Binary search

IIT Dhanbad

AirplaneGame  Question

Samsung Delhi

IITD

Time Limit: 3hrs

Number of Submissions: 10

Solution with problem statement: energyDifference

Initially you have H amount of energy and D distance to travel, you are given two arrays of size 5, each indicating the amount of energy you can utilise and the time it will take to cover the next distance with that energy. For eg.

h(array of energy) = { 4 , 5 , 7 , 12, 2 }

t(corresponding array of time) = {5min20sec,  3min20sec, 2min30sec, 1min0sec, 15min20sec}

You start at 1 and you need to take one of the five energies to move to 2 and so on until you reach D. The task is to find the d        minimum time required for given H,D,h and t.

Question reworded: Initially you have H(<4000) amount of energy and D(<1000 km) distance to travel. You may travel with any of the given 5 speeds. But you may only travel in units of 1 km. For each km distance travelled, you will spend corresponding amount of energy.  E.g. the k;given speed are :

The task is to find minimum time required to cover total D km with remaining  H >= 0.

IIT-BHU

Mr. Kim has to deliver refrigerators to N customers. From the office, he is going to visit all the customers and then return to his home. Each location of the office, his home, and the customers is given in the form of integer coordinates (x,y) (0≤x≤100, 0≤y≤100) . The distance between two arbitrary locations (x1, y1) and (x2, y2) is computed by |x1-x2| + |y1-y2|, where |x| denotes the absolute value of x; for instance, |3|=|-3|=3. The locations of the office, his home, and the customers are all distinct. You should plan an optimal way to visit all the N customers and return to his among all the possibilities.

You are given the locations of the office, Mr. Kim’s home, and the customers; the number of the customers is in the range of 5 to 10. Write a program that, starting at the office, finds a (the) shortest path visiting all the customers and returning to his home. Your program only have to report the distance of a (the) shortest path.

Constraints

5≤N≤10. Each location (x,y) is in a bounded grid, 0≤x≤100, 0≤y≤100, and x, y are integers.

Input:

You are given 10 test cases. Each test case consists of two lines; the first line has N, the number of the customers, and the following line enumerates the locations of the office, Mr. Kim’s home, and the customers in sequence. Each location consists of the coordinates (x,y), which is represented by ‘x y’.

Output:

Output the 10 answers in 10 lines. Each line outputs the distance of a (the) shortest path. Each line looks like ‘#x answer’ where x is the index of a test case. ‘#x’ and ‘answer’ are separated by a space.

I/O Example ::::   Input (20 lines in total. In the first test case, the locations of the office and the home are (0, 0) and (100, 100) respectively, and the locations of the customers are (70, 40), (30, 10), (10, 5), (90, 70), (50, 20).)

5  Starting test case #1

0 0 100 100 70 40 30 10 10 5 90 70 50 20

6  Starting test case #2

88 81 85 80 19 22 31 15 27 29 30 10 20 26 5 14

10  Starting test case #3

39 9 97 61 35 93 62 64 96 39 36 36 9 59 59 96 61 7 64 43 43 58 1 36

Output (10 lines in total)

#1 200

#2 304

#3 366

IITK

There was shortlisting. I don’t know the criteria but 78 applicants were shortlisted. Total 5 submissions were allowed.

2-coloring of undirected graph (Same as Samsung Bangalore IITD)

IITB

A Doctor travels from a division to other division where divisions are connected like a graph(directed graph) and the edge weights are the probabilities of the doctor going from that division to other connected division but the doctor stays 10mins at each division now there will be given time and had to find the division in which he will be staying by that time and is determined by finding division which has high probability.

Input is number of test cases followed by the number of nodes, edges, time after which we need to find the division in which he will be there, the edges starting point, end point, probability.

Note: If he reaches a point where there are no further nodes then he leaves the lab after 10 mins and the traveling time is not considered and during that 10 min at 10th min he will be in next division, so be careful

IITG

Time Limit: 3 hours

Number of Submissions: 10

Test Cases: 50

There is one spaceship. X and Y co-ordinate of source of spaceship and destination spaceship is given. There are N (0<=N<=5) number of wormholes each wormhole has 5 values. First 2 values are starting co-ordinate of wormhole and after that value no. 3 and 4 represents ending co-ordinate of wormhole and last 5th value is represents cost to pass through this wormhole. Now these wormholes are bi-directional. Now to go from (x1,y1) to (x2,y2) is abs(x1-x2)+abs(y1-y2). The main problem here is to find minimum distance to reach spaceship from source to destination co-ordinate using any number of wormhole. It is ok if you won’t use any wormhole.

Link -> https://www.careercup.com/question?id=5677905146281984 (May be useful!) https://ide.geeksforgeeks.org/pC9w4ETP2x

Samsung Noida

IITM

https://www.geeksforgeeks.org/samsung-delhi-interview-experience-set-38-campus/

Solution for the question given below is slightly different.  we can just write 4  if conditions for mentioned 4  conditions in question to get score C++ similar code

IIT BHU

Repeat: Signal Amplifier (explained below by IITK)

IITD

We are given a function f  = an + blogn + cn^3. The function is monotonic, we will be given a, b,c as input and a variable k ( value of function at some value of n). We need to find the value of n such that f(n)=k.

4. The upper bound of n was given
5. They gave code for finding logn
6. Sol: Binary search

IITK
Same as IITD

IITG

Initially you have H amount of energy and D distance to travel, you are given two arrays of size 5, each indicating the amount of energy you can utilise and the time it will take to cover the next distance with that energy. For eg.

h(array of energy) = { 4 , 5 , 7 , 12, 2 }

t(corresponding array of time) = {5min20sec,  3min20sec, 2min30sec, 1min0sec, 15min20sec}

You start at 1 and you need to take one of the five energies to move to 2 and so on until you reach D. The task is to find the d        minimum time required for given H,D,h and t.

Question reworded: Initially you have H(<4000) amount of energy and D(<1000 km) distance to travel. You may travel with any of the given 5 speeds. But you may only travel in units of 1 km. For each km distance travelled, you will spend corresponding amount of energy.  E.g. the k;given speed are :

The task is to find minimum time required to cover total D km with remaining  H >= 0.

Samsung Semiconductor(SSIR)

IITK

Signal Amplifier: You​ ​ have​ ​ a ​ ​ matrix​ ​ of​ ​ 0 ​ ​ and​ ​ 1 ​ ​ of​ ​ order​ ​ N*M​ ​ and​ ​ a ​ ​ parameter​ ​ K ​ ​ is​ ​ given. You​ ​ have​ ​ to​ ​ perform​ ​ the​ ​ operation​ ​ of​ ​ flipping​ ​ any​ ​ column​ ​ of​ ​ matrix​ ​ exactly​ ​ K times. Flipping​ ​ means​ ​ changing​ ​ 0 ​ ​ to​ ​ 1 ​ ​ and​ ​ 1 ​ ​ to​ ​ zero.​ This​ ​ operation​ ​ can​ ​ be​ ​ performed any​ ​ number​ ​ of​ ​ times​ ​ on​ ​ the​ ​ same​ ​ column​ . ​ ​ Using​ ​ this​ ​ operation,​ ​ maximize number​ ​ of​ ​ rows​ ​ filled​ ​ with​ ​ all​ ​ 1. First​ ​ line​ ​ is​ ​ number​ ​ of​ ​ test​ ​ cases,​ ​ next​ ​ line​ ​ is​ ​ N,​ ​ M ​ ​ and​ ​ K,​ ​ and​ ​ then​ ​ N*M​ ​ matrix follows.

Total 50 test cases had to be passed and maximum allowed submissions were 10

Constraints:

1 <= N <=100

1 <= M <= 20

1 <= K <= M

Sample Input:

2

5​ ​ 3 ​ ​ 3

1​ ​ 0 ​ ​ 0

0​ ​ 1 ​ ​ 0

1​ ​ 0 ​ ​ 0

0​ ​ 0 ​ ​ 1

0​ ​ 1 ​ ​ 0

3​ ​ 3 ​ ​ 2

0​ ​ 1 ​ ​ 1

1​ ​ 0 ​ ​ 0

1​ ​ 1 ​ ​ 0

Sample Output:

0

1

Efficient algorithm

Zendrive

20L base, 27L CTC

IITD

Two profiles opened (cgpa >= 6.5):

1. Associate Data Scientist
2. Software Development Engineer 1

Total 1 hr test with 15 questions for Data Science and 3 simple coding questions for Software development (attempt only one section)

Software Developer Profile-Pe

1. https://imgur.com/Gk7c8rq Solution: Take GCD of array elements
2. https://imgur.com/4jf39Jv Solution: Initially take all a’s. Keep changing a->z from the end.. lastly a->{b, c, …, z}
3. https://imgur.com/aAY9m1j https://imgur.com/s0jaNfj 

Data Scientist profile- https://imgur.com/Gk7c8rq https://imgur.com/a/YcCZ7nM

15 MCQs (+4,-1)(1 hour), from topics like probability, stats, Apti, and some ML.

IITM



Solutions: Seive + DP (Recursive), Seive + DP (Iterative)

IITG

IITR

solution: https://www.geeksforgeeks.org/count-total-set-bits-in-all-numbers-from-1-to-n/

IITB

It was open for M. Tech too

--

CITRIX 

IITM

(CPI Cutoff?)  (Branches Allowed?)        

Software Engineer

Date: 25/09/18

2 hours of test, in which you have 50 MCQs(with no negative a), 2 coding questions on Hackerrank Platform

Coding -> 1.  Similar problem with explanation A set of number is called golden set, if it has 2 subsets which equal sum. Ex- for 3 .[[1,2],[3]] -> golden set for 3. Given n , find number of golden set possible using first n natural number

Coding -> 2. It was based on some share markets terms. You have n users , with some number of shares, bidding prices, timestamp. Input will be [user_id, no_of_shares,bidding_prices, timestamp]. You have total shares to be distributed among bidders.

For which -

• User with highest bidding prices will be given shares first.
• If 2 users have same bidding price, then we give 1-1 shares to them iteratively in the order of their timestamp .
• This process continues till all bidders get shares or no more shares are left,whichever happens first.

You have to output the number of users which will not get any share.

Suppose input is:

[1,5,5,0]

[2,7,8,1]

[3,7,5,1]

[4,10,3,3]

Totalshare = 18

Explanation: User2 bidding prices is high , so we give it 7 shares as it wants. Left share = 18-7 = 11.Now user 1 and 3 have same bidding prices, so we give 1 to user 1 , then 1 to user 3(because of timestamp order). Keep on doing till 5 iterations, left share 11-10 = 1 and user1 is done

Now with 1 share left we will give it to user3. So the answer is 4, as user4 didn’t get anything

MCQs -> based on Networks(gate level), apti, programming(find output n errors)

Were there MCQs from DBMS or OS ?  OS, no DBMS.

IITB

MCQs similar to what is described above.

Coding :- similar to this one :- https://www.hackerrank.com/challenges/largest-permutation/problem                                                                 

b) partition array into two subsets of size n/2 with the minimum difference.

Thoughtspot

IIT BHU

CSE and MnC

date: 25/09/18

CPI: 6.5

Member of Technical Staff

1hr test on interviewbit - Constraints were given

1. [200 pts] http://codeforces.com/contest/493/problem/C         Sol-> https://ide.geeksforgeeks.org/oquYq2Ju5m
2. [300 pts] https://codeforces.com/contest/408/problem/D        Sol-> https://ide.geeksforgeeks.org/E2DxIFgc2b
3. [500 pts] hackerearth

IIT R

What is the other question asked in Roorkee?

IIT K

1. countDerangementInversions

IITG

1. https://www.hackerearth.com/problem/algorithm/c-14/description/

KLA Tencor

IITM

Date: 25/09/2018

KLA Tencor opened several profiles like Software Engineer, Algorithm Engineer, System Engineer and Application Engineer.

Online test was different for each of the profiles. Students were allowed to write for only one profile as all test were conducted at the same time. However they announced during PPT that those who write for application engineer will be considered for system engineer as well.

Profile: Software Engineer

Open for Masters of CS, EE, Math, and Physics

Platform: Hackerrank

# of programming question: 2

# of apti + technical MCQ: 15

Time given: 75 min

P1: Something related to traversing a tree using adjacency matrix. Finding height of the graph (binary graph). The input is given in 2d vector.

P2: given a matrix with 0 and 1, finding the longest path of 1 in the matrix.. Finding height of the graph (binary graph). The input is given in 2d vector.

Apti + Tech questions were of standard quality. Questions were from Computer Networks, DB, Operating System, Permutation, Combination, seating arrangement etc.

Tip: Time is very less for 2 programs and 15 MCQs. Manage your time properly, start with coding. 15-20min is more than enough for MCQs.

Profile: Algorithm Engineer

Open for Masters of CS, EE, and Physics

Platform: Hackerrank

# of programming question: 2

# of apti MCQ: 15

Time given: 60 min

P1: https://www.geeksforgeeks.org/longest-palindromic-substring-set-2/

P2: Find the strings in the list of string which does not have an anagram.

Aptitude questions were of standard quality. Questions were from Probability, Proportion , etc

All running codes https://ideone.com/laser0/kla

IITK

Date: 8-oct-2018

Same format as in IITM, and same coding questions(Software Engineer).

Profile: Application Developer Engineer

Platform: Hackerrank

# of programming question: 0

# of apti MCQ: 25

Time given: 60 min

IITB

Profile: Algorithm Engineer

Platform: Hackerrank

# of programming question: 2

(Same questions from IITM Algo Engg post)

# of apti MCQ: 11(Time and work, Mixed ratio etc )

Time given: 60 min

Profile: Application Developer Engineer

# of programming question: 0

# of apti MCQ: 25 (10 verbal questions and 15 apti including puzzles like bridge cross, who wins the game first)

Time given: 60 min

Cohesity

IIT D

(CGPA cutoff ??)

CTC: 18L

Date: 27-sep-2018

Platform: Hackerearth (1 hour)

https://imgur.com/gallery/M0RKXgJ

Good luck guys.

IIT BHU

(CGPA cutoff ??)

Date: 7-oct-2018

Platform: Hackerearth (1 hour)

1. https://www.geeksforgeeks.org/find-number-of-islands/
2. StackOverflow HackerRank C++ code

IITK

(8+ CGPA) (34 lakhs in India)

1. https://www.geeksforgeeks.org/maximum-sum-in-circular-array-such-that-no-two-elements-are-adjacent/
2. From 0 make X such that you can add, subtract and double. Cost of adding and subtracting is A whereas cost of doubling is B. Find minimum cost. (35 M)

        I/P  -        X=4, A=1, B=1                 

O/P-        3        

 Explanation 0->1->2->4 #each link is of cost 1.

(Can anyone suggest solution to this one?) I think BFS should do the trick.

IITR

(7.5+ CGPA) (CTC- 18 LPA)

Two questions. 1 question for 50 marks and other for 20 marks.

Platform : Hackerearth (1 hour 30 minutes)d

1. Similar to this question : https://www.interviewbit.com/problems/capture-regions-on-board/ (50 marks)
2. You are given a string s, of length n and you have to insert k commas in between and return the maximum possible substring. (20 marks)

Anyone has any idea what approach to follow ??

For eg :  s=”122”, n=3, and k=1

You can partition it like 12,2 or 1,22. So you have to return max possible substring that is 22.

IITKGP

Two questions. 1 question for 50 marks and other for 20 marks.

Platform : Hackerearth (1 hour 30 minutes)

1. Given a 2D grid, starting point, return minimum distance to reach the boundary of the grid. Some of the cells in the grid have obstacles. (Sol. - DFS/BFS) - 50 marks
2. Same as IITR Q. 2. - 20 marks

Nutanix

IIT Bombay

Both questions were easy, most of my friends did it :)

IIT BHU

1. Easy Adhoc Problem (Don’t Remember)
2. https://leetcode.com/problems/cat-and-mouse/ - Nobody was able to solve this in allocated time, also input format was not proper

IIT KGP

IITK

1. Given two axis-parallel segments denoted by end points (X11, Y11) (X12, Y12) and (X21, Y21) (X22, Y22), you need to check if they span a single connected path (both are connected and degree of each vertex is <= 2).
   ie., either they represent a single straight line (vertical or horizontal) or they make an “L” shape.
   Number of test cases = 10^5.
   Simple condition checks were needed.
2. Given a string of digits (0-9), and an integer K, partition the string into substrings representing numbers bounded by K, such that sum of all partitions is maximized.
   0 <= K <= 10^12. Length of string, |S| <= 3000
   E.g., S = “2345” and K = 40.
   We can partition and sum it as 2+3+4+5 = 14 or 23 + 4 + 5 = 32 or 2 + 34 + 5 = 41, of which 41 is the max possible sum.
   You have to print a pair <max sum, ways> (here ways = the number of ways max can be obtained % 10^9+7).
   E.g., S = 0000 K= 0, ans is: 0 8
   

IISc

11 October 2018

Questions: 2  

Time: 1.5 Hrs

1. nutanixSportsMeet
2. killingZombies

IITD

What are the constraints for 2nd problem?

27 SEPTEMBER 2018

2 coding questions- 1.5 hr- Hackerrank

1. findTheShapeOfTree
2. There are N points on a 2D- grid in the form (x,y). The distance between any two points x1,y1 and x2,y2 is=|x1-x2|+|y1-y2|. We have to traverse all the points starting from any one such that the total distance travelled by you is minimum. But, there are M restrictions, in the form u,v such that you cannot traverse v after covering u.

e.g.:

Input- 5  (N=Number of points)

                1,1 2,2 3,3 4,4 5,5    (xy coordinates of these points)

                2   (M=number of restrictions)

            1 2           (meaning you cannot traverse 2nd point(2,2)  after covering 1st(1,1))

            4 3                (meaning you cannot traverse 3rd point(3,3) after covering 4th(4,4))

              Output- 10

explanation--- >   traverse in the order-----   2,2---> 1,1----> 3,3------>4,4------>5,5

Arista

20th Oct

IITK

Platform : Hackerrank, 1hr 30 mins test

Question 3:
Given an n-ary tree with arbitrary number of nodes (but no more than MAX_CHILDS), find the maximum of sum of nodes from root to leaf.
Solution: same logic as binary tree, just expand for n children

Question 2:
Given a routing table at a router, which consists of a IP prefix and next hop information. We have to construct a trie to felicitate a query of an IP address and report the next hop. Example.
--------------------
Routing Table
--------------------
prefix         | Next Hop
--------------------
11011        | CCCC

1010        | DDDD
110        | EFEF
0101        | GCGD

Query
110101 -> EFEF
001           -> NO OUTPUT
101000 -> DDDD

Question 1:
Given a client-server environment with multiple clients interacting with the server. Each client is identified by a clientID and each message is identified by msgId and has an attribute msgAge. Sever maintains a separate message queue for each client (with size no more than MAX_CLIENT_MSG_SIZE).

To begin the interaction with the server a client has to register with the server with a window size.
register <clientId> <window>
window specifies the number of msg the client can accept from the server.

A new message can be sent to the client specified by clientId as
newmessage <clientId> <msgId> <msgAge>.
When a message for a clientID is received the server can send the message to the clientID if the window of clientID is not consumed. If the window of clientID is consumed then the server can queue the messages, and must maintain the sorted order according to msgId. If a message with same msgID and diffent msgAge comes to the queue, the msg with greater msgAge must be kept in the queue.

A client can send a query to adjust the window of the client,
adjustWindow <clientId> <window>

Alphonso

CPI Cutoff Or eligible branches?

No Cutoff

IITD

Business and data Analyst profile.(22/9/2018)

Questions for Technologist role? For tech role test is not conducted yet. When is the test?

1 hr test on hackerrank. 26 questions. 24 of them were MCQs [stats, probability, aptitude based] (+1,-1), and two were subjective in which you had to write the pseudo code.

2 subjective questions-

1. Sort a given array without using intermediate(Extra) memory. (Could you please elaborate how to solve this?)

What do you mean by intermediate memory?? If someone understands it please answer. You have to do Inplace sorting.

2. Write pseudo code to find the difference between two times given in HH:MM:SS format

IITD

3 sections. First 2 sections consisting of MCQs and subjective type. Lat section of 1 coding question, 2 subjective. Some questions were based on operating systems, networking. Some were implementation specific to  python, javascript(Only 3 questions as I remember). Most were based on implementations in C language.

1. C language specific:

1.  LInked list questions(Addition, deletion of nodes based Qs)
2. fork() function call (predict the output of parent and child process)
3. “Rdtsc” assembly instruction based:

Given cpu of 2GHz, what would be the output of the following code snippet. Marks would be awarded only if the answer is justified.

a=rdtsc();

sleep(1);

b=rdtsc();

printf(“total cycles = %d”, b-a);

Options are.

i) 2*(10^9)

ii) greater than 2*(10^9)

iii) something other

2. OS specific

         a. Deadlock problem. Code snippet given. The verbal explanation is as follows.

             5 processes.5 resources. Last process P4 acquires R0 and R4. Among rest of processes, each process Pi

             acquires R(i) and R(i+1) resource. Is there any possibility of deadlock? How would you resolve it? Write

             Pseudo code for resolving the deadlock.

//question :p4 already have r0 and r4 or it wants to acquire

And what about other Pi are they requesting or they already have resources.(please clarify)

         b. Simple problem on non-preemptive shortest job first scheduling

3. Database specific

     Table of records given. Each record consists of {Name, gender}. Unfortunately genders have been interchanged.

     E.g all males have been shown females and vice-versa. Write a sql query to bring the records to normal form i.e c

     change  all females to males and all males to females.

     One more sql query based on “group by” clause and using aggregation.

4. Networking questions

    Bandwidth at sender and receiver given. Total data to be sent from sender to receiver given. Round trip time

   given. Window size is given. Estimate the time to send the entire data to receiver.

   One more question on TCP fragmentation.

   One question on what field values change when IP packet traverses from one point to other? (Ans: checksum,

   TTL, etc.)

      5. Automata question

          Find the regular expression for a given finite automata.

     6. Compiler question

         What are steps in compilation? 4 options.

         (Ans: syntax -> semantic -> assembler -> linker -> loader)

     7. Coding question

         Given a table of tasks, with each task requiring time to execute/perform and profit associated with that task. So,

         Given a deadline, find the maximum profit that can be earned by completing tasks within the deadline.

         (Ans: simple dynamic prog question. Use 2-D array  dp[deadline][last task completed]  Or dp[index][ time ] after sorting)

IIT K

PPT: 14th Oct

IITB, IITKGP, IITM

15th Oct

https://imgur.com/a/q9I5w7j (Answers marked might not be correct)

UBS

X : 70.00%    XII : 70.00% 

CGPA : 7.00 Course(s) : btechidd

     Department(s) : cse eee ece mat

IIT BHU

Platform: Hackerearth

Date: 28/9/2018

Time: 1.5 hours

Section A: 30 MCQ covering Networking, DBMS, basics about finance, aptitude, OOPS (JAVA), english

Section B:  programming question

Q1-> Given n cities and the profit earned by visiting that city, calculate maximum profit one can earn provided he can move to city 'j' from 'i' iff 'j' > 'i' and profit that he can earn in city 'j' is multiple of profit earned in city 'i'.

Ex-> P[]={1, 2, 3, 4, 9, 8}, output is 15.

PhonePe

IITM

Date: 1/10/18

Open for all Btech and Dual, along with CSE and EE MTech and MS

Cutoff CGPA > 6

Ctc 23 , base 14

Is python allowed???+1

Time complexity is really important. If you solve using brute-force, expect no more than one test case to pass. Take long long int instead of int. Hosted on doselect.com

1. [50 pts] Given an array and value K, find the max no. of array elements avg which will be less than K
2. [100 pts] Given N: array size, U: number of updates, Q: number of queries. Initially array is filled with 0s. There will be U updates lines consisting I, J, K. You need to update array from index I to J (both index inclusive) with K, i.e if I = 0, J = 3, then perform a[i] += K for i ∊ [0, 3]. Finally there  will be Q no. of single number as queries IDX. you need to print what is the content of the IDX in array. If IDX = 1; then print a[IDX]         
3. [200 pts] Given acyclic graph, find total no. of ways to traverse the entire graph starting from node 1

1. Traverse dfs and count number of unvisited nodes in source’s adjacency
2. Multiply its factorial to prodz
3. Do this recursively C++ code

Please update +2

IITK

Date 29/10/2018

1. 100 marks : Min operation to make the N - > K where K has all even digits. Operations allowed -- +1, -1 to the number

1. Input   11  output - 3
2. Input   199  output - 1
3. Input   2018  output - 2

2. 50 Marks : Input N K Q . N - Number of diff types chocolates . K - Number of chocolate boy eats everyday given he eats only one of each kind . Q - Query for Qth Day . Next N lines contains names of Chocolates in order of preference of eating .Initially all chocolates are in same quantity. Boy decides to eat K chocolates everyday . He eats chocolates which greater in number first . if they are in equal quantity he eats in order of preference.  

1. Input - 4 3 3

        A

        B

        C

        D

Output - A

          C

          D

( first day -A B C , Second Day - D A B Third Day- C D A)

Input - 4 1 3  

        A

        B

        C

        D

Output - C

IIT B

3 questions, 180 mins

1.Modified LCS of 2 strings where the common string must have even number of a’s and odd number of b’s

(I solved it using dp[x1][y1][f1][f2] where x1,y1 are pos in the 2 strings and f1,f2 is whether we have even a’s or odd b’s respectively) Got 100% correct -300 points.

2. Number of subarrays in an array whose sum is divisible by k .. each element in array is between -1e5 to 1e5

K is 1e9 ,

use prefix sum and all subset[l,r] which satisfy must have the same mod r and mod l (0 is a special case here)

3. Given N Points in 3D space (xi,yi,zi), we can reach a point (x1,y1,z1) from another point (x2,y2,z2), iff x1=x2 OR y1=y2 OR z1=z2. Find the minimum number of points needed in the given space so that we can reach a point from every other point.

 It was a connected component problem seemed easy but all test cases didn’t pass

IIT G

3 questions, 90 mins

1. Given an integer N, output the total number of strings possible of length N comprising of only 1s and 0s with at least one pair of consecutive 1s. (50 marks)
   Eg. N=3
   Ans = 3 (110,011,111)
2. https://www.hackerrank.com/challenges/candies/probl
3. https://www.geeksforgeeks.org/find-length-largest-region-boolean-matrix/

Saavn

IITR

• Test was on interviewbit, 1 hr 3 coding questions

• https://www.geeksforgeeks.org/coin-change-dp-7/ (expected space complexity was O(n))
• https://www.interviewbit.com/problems/best-time-to-buy-and-sell-stocks-iii/
• https://www.interviewbit.com/problems/median-of-array/

Off campus(how to apply?)through interviewbit.com/jobs, might not be there now

• Test was on interviewbit, 1 hr 4 coding questions

• https://www.interviewbit.com/problems/palindrome-partitioning/
• Easier version of this problem (only two subarrays)
• https://www.interviewbit.com/problems/max-sum-path-in-binary-tree/
• https://www.interviewbit.com/problems/nearest-smaller-element/

Jaguar Landrover (JLR)

{Eligibility=CS,MnC,ECE/EEE,Mech}

CPI cutoff=6.5

Base - 17.86L , CTC - 20.30L  Bangalore

IITG

(SOFTWARE profile ) 20 minutes aptitude + 45 minutes coding round (on firstnaukri.com)

Only 1 Coding Question -

Given a string, remove isolated vowels from a string, i.e, don’t remove it if there are 2 or more continuous vowels together. Both lower and uppercase to be handled.

25 minutes psychometric test consisting of 53 questions.

IITK

Coding question similar to :https://www.geeksforgeeks.org/find-possible-words-phone-digits/

Rest same as IITG

IITD

1. Aptitude 20 questions 20 minutes(easy, time management imp)
2. Coding 1 question 45 minutes: given a natural number ‘x’ find minimum integer ‘j’ such that ‘x*j’ should have digits 4 and 0 only. Then count the number of 4’s and 0’s and return 2*number of 4+number of 0. Eg for input 5, 1, 9……..output will be: 3, 1, 18( for 5, 1, 9 minimum number would be 8, 4, 49382716 respectively).

Only C, C++ and Java

3. Personality test: 53 questions 25 minutes (ethical and behavioral questions)

IIT KGP (31st Oct)

1. Aptitude 20 questions 20 minutes
2. Coding 1 question 45 minutes (took <10 min)

Given a 5x5 matrix of integers, print the coordinates of the saddle points. If a number is greater than or equal to all the numbers in that row and is less than or equal to all the numbers in its column then it is considered a saddle point.

      3.   Psychometric test 54 questions 25 min.

Walmart Labs

(They generally ask same set of questions)

IIT Dhanbad

Python also allowed

Time: 90 min

1. Palindrome And Substring
2. minCostAddSubDouble

Alternate Solution : For this question you have to use the MIN HEAP(key will be the cost of the reaching to the point i.e. min_heap<pair<cost,point>>. Now pop the element having minimum cost in the heap and then add the element that can be reached from this point with their respective cost (if they are not visited and cost is less than previous cost -> for this you have to maintain array having current cost of visiting any point ). Do this until you reach X.

3. How many K length string can be made if you can use exactly P alphabets from given X alphabets and exactly Q digits from given Y digits. You are given values of K, X, Y, P, Q

DONT DELETE QUESTION PLEASE

IITG

(17/10/2018)

1. making?
2. Check if the binary representation of provided number is only made of alternate sequence of  1 and 0 or not .
   For example : 2 => [10] => yes, 3 =>[11]=>No, 4=>[100]=>No, 5 =>[101]=>yes.
3. minCostOddPrimeSum

      3)  A array is provided , you have to provide answers of range queries.

        There was  three type of query (i) calculate the multiplicative sum of given range. (ii) calculate reverse order multiplicative sum in given range. (iii) Updation of an element in the array.

## Multiplicative sum = SUM( k*Arr[i]) where  0 < k < =L-R+1 , where i is from L to R

## reverse Multiplicative sum  = SUM( k*Arr[i]) where 0 < k <= L-R+1 , where i is from R to L

Example : 5 3                  // array length , no of queries

             1 2 3 4 5                 //array

              1 1 2                 //Q1 ( 1*1 + 2*2)

                  2 1 2                 //Q2 (2*1 + 1*2)

              3 1 2                 // Q3 update position 1 value with 2

             Output: 5 4         //5 is the o/p Q1,4 is o/p of Q2, Q3 will update the array as [2 2 3 4 5]

Sterlite

IITK

Test was on cocubes platform. 1hr for Verbal, Aptitude and basic quant. 30 mins for technical test.

Technical test was department wise.

For CSE question were mostly on C, synchronization and DBMS.

For EE - Out of 30 questions, at least 10 were from control systems , mostly open loop, closed loop transfer functions. Others were from power systems, 1-2 on BJTs, and 5-6 from signals , unit transfer functions, laplace transform.

For ME- 30 questions, topic asked machine design, manufacturing, Refrigeration, IC Engines, theory of machine, questions were basic but involving formulae. Different people got different sets.

For CHE - 30 questions. Topic asked were Organic Chemistry, Properties of Materials, Polymer Physics, Chemical Process Industries, Chemical Reaction Engineering, Kinetics

For MTH- No technical test

Intel

(Please update for hardware profile also!)

IITM

-> (Only for software guys) Coding question Merge two sorted arrays very easy

-> Aptitude 15 mins 10 MCQs

 -> Technical sections (Hardware or Software - 45 mins 30 MCQs)

-> Software MCQs on OS Networks Comp arch. (Bit Difficult for elec guys)

IITG

We needed to select one profile among software or hardware at the start of test!

HARDWARE Profile

-> Aptitude 15 mins 10 MCQs

-> Coding MCQ’s 15 mins 10 questions

-> Technical Hardware section - 45 mins 30 questions

Topics - JK Flip Flop, Mod-6 gray counter, Number of bits in DAC given load resistance, current taken and voltage applied,

        Microwave given characteristic impedance source impedance and length find load, Sampling of cos in time domain,

        Min num of Multiplexer to implement function, saturation region of mosfet current vs voltage relation, setup hold time,

Software Profile

{Someone update this!} Multiply a matrix and its transpose.

Intel hardware

IIT KGP

Apti was OK…

Few verilog questions, RC circuits, microcontroller instructions, logic gates , overall easy but need speed to solve

Tesco

IITM

06/10/18

2 coding questions were asked on hackerrank and time limit was 90 min.

Questions were very tough.

Q1. some variant of Knapsack problem. Total money a girl have is N, then total no. of shops given, then bundle quantity of notebook in each store was given as an array. Bundle cost of each bundle quantity was given in another array.Find max no. of notebooks she can purchase in N money.

Ex:       50

        2

        24 20

        20 19

        output : 40(We need to return number of notebooks but this is total cost. right?) yes, return total  notebook

        Exp: she have 50$, from 0th store she purchase 24 notebook bundle for 20, then she repeats the same, to have 24 + 24 = 48 notebooks spending 20+20=40 $.

Q2. huffmanDecode

IIT BHU

Hackerrank, 2 coding questions 90 min

Q1) Consider a normal keypad with alphabets(ex on key 2 it is 'a', 'b', 'c'), and an encoded string, find the number of messages that can be obtained from it.

Ex: "222": 4(possible outcomes: "aaa", "ab", "ba", "c"),

        "7777": 8(possible outcomes: "pppp", "ppq", "pqp", "qpp", "qq", "pr", "rp", "s").

Q2) https://www.careercup.com/question?id=5721734273564672

IIT Roorkee

https://www.geeksforgeeks.org/deutsche-bank-interview-experience-on-campus-2018/

2nd question of round 1.

IIT KGP(10/11)

https://www.hackerrank.com/contests/hack-it-to-win-it-paypal/challenges/q4-traveling-is-fun/problem
https://www.geeksforgeeks.org/minimum-steps-reach-target-knight/

ANSYS Software

IIT Guwahati

There were 2 papers:

Paper-1 (16 MCQ from OOP concepts, Operating Systems, Data Structures and Algorithms) [Time 30 minutes] [all were from Geeks Quizzes and almost all OS questions were direct questions asked in GATE exam]

Paper-2 (2 coding questions) [Time 45 minutes] Written round on paper!

1. Implement Round Robin Scheduling Algorithm for a number of processes and print the Completion Time, TurnAround Time and Waiting Time of the processes.

2. Given a binary tree, modify it as follows:(Note-we had to clone the binary tree as per given specifications, not just modify)

•  The left pointers are kept intact
• The right pointers point to the next right sibling, if there is none to the right, then the right pointer should point to the first node in the next level.

Da Vinci Derivatives

CTC details??

IITD

1st round (Speed Maths)

(OMR sheet) - 25 questions (15min) - mathematics, currency conversion comparison (exchange rates were provided), stock comparison (Basic multiplication and addition)

Johnson Matthey

IITK

45 mins for 45ques, pen paper based, open for Btech, Mtech: Mech,Chemical, No CPI criteria

4 sections: Aptitude, Verbal, Data interpretation, Technical based on Department

For Mech:(Heat Transfer, Manufacturing, Design of Machine, Power plant)

SAP Labs

IITB

All Profiles

-Hackerrank platform (1 hour) 2 coding question. Different sets of question were given to students.

1. 
   Solution:https://www.careercup.com/question?id=5647083983863808
   
2.    

Answer to 2nd question:

All test cases passed with this O(n) solution.

IITM

All Profiles

-Hackerrank platform (1 hour) 2 coding question

Test was in sets. So people got different questions:

1. https://discuss.codechef.com/questions/134734/most-frequent-substring-problem
2. Given two strings, find the minimum  of characters that have to be changed to make them anagrams.
3. Given a string find number of valid substrings. [O(n) solution was expected] Valid strings are of the form:

1. Followed by any number( 0 is also allowed) of lowercase alphabets, digits, or colon
2. Followed by a forward slash
3. Followed by at least one lowercase alphabet or digit
4. Followed by backslash
5. Followed by at least one lowercase alphabet  

                   Start with a lower case alphabet

4. https://www.geeksforgeeks.org/check-if-a-givehttps://www.geeksforgeeks.org/check-if-a-given-sequence-of-moves-for-a-robot-is-circular-or-not/n-sequence-of-moves-for-a-robot-is-circular-or-not/
5. https://www.hackerrank.com/contests/hack-it-to-win-it-paypal/challenges/q4-traveling-is-fun

1. https://github.com/kaushal02/interview-coding-problems/blob/master/travelingIsFun.cpp
2. https://ide.geeksforgeeks.org/JZINZtJEza
3. code c++

Requested solution for 1 and 3

IITG

All Profiles

        Different sets of question were given to students. It was on hackerrank platform, 2 questions 1hr. Python was allowed.

1. https://leetcode.com/problems/cherry-pickup/description/
2. https://www.geeksforgeeks.org/check-if-a-given-array-can-represent-preorder-traversal-of-binary-search-tree/
3. Team Formation:
   Given an array of non negative integers, select x largest numbers from it given the following conditions:
   Choose the numbers in sequence and keep removing them from the array, every time number can only be selected from first or last m elements, in case of conflict choose the one with lower index. In case first and last m elements overlap, choose the largest number of array. Return the total sum of them. C++ code
4. Travelling Salesman problem
5. https://www.careercup.com/question?id=5647083983863808
6. Similar numbers (simple permutation)
7. Closest city given x,y coordinates
8. of cities based on query . Find out the closest city to a given city(in query) such that it has either same x or y coordinate, else return None.
9. Harder lengthy version of

https://www.hackerrank.com/contests/freedom-fest-coding/challenges/phone-keypad

      9. SAP questions on hackerrank google drive link - hea

          1. https://drive.google.com/open?id=1vkAT9IqPARME5C2TVZYhRfViQbpBlnB1  please share the approach +7(solution)

          2. https://drive.google.com/open?id=1qqtFWJGeU0p5cEiulqQbrA8WE2odrMid

10.            

s

IITK

All Profiles

1. Given a graph where nodes can have multiple labelled edges between them. Find the pair with maximum common labelled edges.(There 3rd test case is wrong, is there any one who solved it).+1 I fully solved the question using just the problem statement. So possibly you left some case.
2. You’re given a number n. You had to convert the number to all 0’s, only operations allowed were:-

1. Flip last bit.
2. Flip ith bit only if (i+1)th bit is 1 and (i+2)th to end bits are 0.

                E.g- 1000->1001->1011->1010->1110->1111->1101->1100->0100->0101->0111->0110->0010->0011->0001->0000

PS- [Koi solution daal do yaar, Indeed mein bhi aaya tha same question]

Soln - Basically the above question reduces to “Finding the index of given number in list of all gray codes”. See from right side - the sequence is 0,1,11,10,110,111… which is exactly the gray code sequence

Is the gray code solution correct? Please confirm Grey Code Solution got accepted.

ANS - Just convert the given no to binary(B1) and then considering this binary representation(B1) as a gray code- just write O(n) solution to convert gray code(B1) to binary(B2)----convert that binary(B2) to decimal(D1) ...that(D1) is your last answer.

PPS - Uber IITG me bhi same aaya tha

        3. Count number of Subarrays with product of elements <= k

IITK - Set 2

1 hour test on hackerrank. Python allowed. 2 Questions, different sets

Q1. A 2D array(NxM) filled with 0 and 1. Find the number of paths through the cells containing 1 from (0, 0) to (N-1, M-1).

Q2. Same question as asked in Indeed India Test in IITK(Q3). Find the number of operations to convert a binary number to zero. Each operation consists of changing one bit from 0 to 1 and vice versa. This operation can be carried out at ith bit if an only if (i+1)th bit is 1 and (i+2)th bit onwards is 0. (i is measured from left end)

IIT BHU

Platform: Hackerrank, 1 hour 2 coding questions

Q1) https://www.geeksforgeeks.org/maximum-points-top-left-matrix-bottom-right-return-back/

Q2) Given a graph, find all the cycles of length 3.

The score of 3 length cycle is defined as the summation of degree of all the vertices taking part in cycle formation. Print the minimum score of such cycles formed.

Limit N=500, E=max(500, N*(N-1)/2), brute force approach is sufficient to pass all test cases

Ex: Nodes: 6

Edges: (1--2), (2--4), (2--5), (4--5), (3--5), (5--6), Output: 3

Expl: For cycle(2--4--5), degree(2)=1 (as 4 and 5 are part of cycle, thus not counted in score calculation), degree(4)=0, degree(5)=2.

Q3) Find the no of distinct substrings of a string. (|s| = 10^5)

Q4) https://www.geeksforgeeks.org/number-subarrays-product-less-k/

Q5)https://www.geeksforgeeks.org/count-possible-paths-top-left-bottom-right-nxm-matrix/

Sandvine

IIT (ISM) Dhanbad

https://www.geeksforgeeks.org/sandvine-interview-experience-for-fte-2018/

Uber

IIT R

^Someone please give whole sample input

solution: https://www.geeksforgeeks.org/find-k-cores-graph/ 

IITD 

Sol for custom array- https://www.geeksforgeeks.org/segregate-even-odd-numbers-set-3/ 

This doen’t give min count https://www.geeksforgeeks.org/segregate-even-odd-set-2/ 

This gives min count: https://www.geeksforgeeks.org/segregate-even-and-odd-numbers/

Will O((2^n)*(n^2)) pass? This will be the order when we apply bitmasking+floyd warshall Can you clarify which problem you’re talking about? Uber-shuttle??7++ Solution anyone?

I think this solution will definitely work for this problem.

.

Approach for uberball- https://math.stackexchange.com/questions/1293020/calculate-different-sequence-of-scores-in-a-volleyball-match

IITG

Soln - Basically the above question reduces to “Finding t all gray codes”. See from right side - the sequence is 0,1,11,10,110,111… which is exactly the gray code sequencehe index of given number in list of

(IITG Junta: if anyone else has the other Qs or sample input of Q1, please put below.)

Q2 ...

Q3 was https://www.geeksforgeeks.org/find-sum-maximum-difference-possible-subset-given-array/ 

IIT KGP

3 coding questions, 90 mins

1. Task master: Given to you are n tasks, and m number of pairs (a, b) such that a depends on b, a can be executed only after b. If you wish to execute a, and b is not executed yet, a will also not be executed. Return the maximum number of tasks you can complete. DFS.

2. Ash and Gary catch a and g pokemons respectively, until one of them wins. Winning condition is:

Winner has caught at least 25 pokemon. Winner has caught 2 more pokemon than the other. A repeat of last year’s question. Sol: https://math.stackexchange.com/questions/1293020/calculate-different-sequence-of-scores-in-a-volleyball-match

3. Uber has a retention rate of r. It means if R riders join today, number of riders by m months because of them will be R * r^m. You are given an array of size m, with number of riders joining in that month, and you are given a target C to reach. r is in [0, 2). Return min value of r to complete target. Precision of first 6 digits required.

Ex: If answer is 1.12345600, output must be 1.123456, else if answer is 1.234567, return 1.123457 and so on.

Binary search can be used, but handling precision becomes tricky. C <= 10^9. M <= 10^5

IITB

3 coding questions, 90 mins

1. Travelling is Fun!! Hackerrank

1. You are given a list of edges in a graph and for each pair of vertices that are connected by an edge, there are two edges between them, one curved edge and one straight edge i.e. the tuple (x, y, w1, w2) means that between vertices x and y, there is a straight edge with weight w1 and a curved edge with weight w2. You are given two vertices a and b and you have to go from a to b through a series of edges such that in the entire path you can use at most 1 curved edge. Your task is to find the shortest path from a to b satisfying the above condition

Mentor Graphics

IITH

Min CGPA: 7.0, EE,CS (B.Tech and M.Tech)

50 min 4-coding questions

3 Sections (Apti, C++ basics, Coding)

1. Number N, number of bits K, rotate number R bits
   e.g.: N = 0000 0010 0001 1010, K = 12, R = 3, output = 0000 0100 0100 0011
2. Rotate every pair of linked list
3. https://www.geeksforgeeks.org/add-greater-values-every-node-given-bst/Rotate every pair of linked list
4. Given char array, replace every duplicate char by next non-repeated char e.g.: GeekG ----> GefkH

HarnessIO

IITR

Test was conducted on 9/10/2018.

CPI cutoff: 7.0

10 MCQ’s computer science basic

2 functional coding problem

(i) Operations of stack.

 Super Stack -

• Push
• Pop
• inc e k(increment last e items by k)

(O(n^2) doesn’t pass all cases) Solution: Think it the Given char array, replace every duplicate char by next non-repeated char e.g.: GeekG ----> GefkH way.

(ii) Count the min modification to make two strings anagrams.

https://www.geeksforgeeks.org/minimum-number-of-manipulations-required-to-make-two-strings-anagram-without-deletion-of-character/ Solution: Maintaining simple count array works. Which is almost bruteforce :)

IITG

1. Find minimum elements of all k size window of an array , and find max element among them.
2. Count no of path from (0,0) to (end,end) of a grid. You can go only left and down from any point. There will be obstacles in the matrix . ( https://www.interview https://www.interviewbit.com/problems/unique-paths-in-a-grid/bit.com/problems/unique-paths-in-a-grid/ )

IITD

Platform: HackerRank. Questions: 10 MCQ + 2 Coding. Time: 1 hour.

1. Mobile number keypad problem. Total different combinations possible from 5556477 etc where 555 is tapping a numeric key in your phone thrice for a letter. For eg if keys mapped to 5 are fgh so 555 can represent fff, fg, gf, h so  4 .
   
2. Count number of distinct substrings of a string. N ~ O(10^5) so a straight up bruteforce wasn’t working (5/10 cases passed.)

Can someone post the solution/idea of Q2

        https://www.geeksforgeeks.org/count-distinct-substrings-string-using-suffix-array/

Greenland Investment Management

IIT K

Date: 10/10/18

Pen paper based 1 hour,  3 sections: first one focused on writing programs/functions: printing Fibonacci numbers using recursion, reversing a string using memory efficient method, detecting loop in a linked list.

Second one focussed on SQL

Third one was from Prob and Stats and stock prices

1. Given positive correlations between A and B and B and C, does it imply positive correlation between A and C
2. Finding monthly volatility given the annual volatility rate=2*(3)^0.5.
3. If Annual Volatility of Stock is given to be 2*(3)^0.5 then what is the probability that the stock closes above Rs102 after a month’s end. ( Price of the Stock=Rs100)

Juniper Networks

IIT K

CPI Criteria- 7.5; Date- 10/10/18

There were 10 Aptitude, 20 Technical and 3 coding questions.

For Technical questions practice memory allocation in C and pointers. Some of them were on networks. A few were on simple algorithms. Practice OS well if you want to do good in this section. There were some hard questions from OS.

1 question I remember from this section. Given 4 data structure you have to tell which is sufficient to store given IP address.

Aptitude questions were normal but time consuming.

Q1- You are given a string of length 24 consisting of 1’s and 0’s. First 8 chars represent Red component, next 8 Green and last 8 represents Blue component of a color.

You are given RGB values of 5 natural colors(as integers and fixed). You have to return closest color. Here closeness is defined as euclidean distance between colors.

For e.g- White = (255, 255, 255); Black = (0, 0, 0); Red = (255, 0, 0); Input = 000000001111111100000001

Here for this input RGB components are (0, 255, 1);

Distance with White = 359.918

Distance with Black = 255.1

Distance with Red = 359.919

So this is closest to Black, hence output is “Black”

Q2- This was related to N queens problem. You are given column number of queens in each row. You have maximum number of times a queen can be attacked. Here is modified version of this problem:- https://www.hackerrank.com/challenges/queens-attack-2/problem

Instead of obstacles there were other queens and you had to find number of times this queen can be attacked by another queens and then maximum of it. There was a catch e.g- If 3 queens are in diagonals(say (1,1) (2,2) & (3,3)) then this will be counted as 1 attack for (3,3).[This is what I think as all tests were not passing, so it’s my guess why]

Q3- You are given a library of n words(say w[0]......w[n-1]), length of each word is maximum 60. You have to choose a word and you can delete one letter from this string and if this results in string from this set then continue doing so and return the max number of steps this can continue. Solvable in O(n*60)

E.g- dictionary = {“abc”, “bc”, “b”, “bde”, “a”}

Then answer will be 3 as “abc”->”bc”->”b”  

Rivigo

 please add questions for Business Analyst profile also

IITD

2 coding question - 1hr 15min

For which job profile (Business Analyst/ Algorithm Engineer/ Software Engineer), these questions were asked ? for SE & AE

IITG

2 coding questions 1:20 hrs

CPI cutoff = 6.5

Solve all dp from LeetCode

1. https://www.geeksforgeeks.org/minimum-steps-reach-target-knight/
2. https://leetcode.com/problems/cherry-pickup/description/

IITK

2 Coding 75 min

1. Gray Code
2. Turnstile

Quadeye

IITD

1 hr pen-paper test.

        Two profiles: System Engineer and Quant

        3 sections of paper:

                1st(both profile): 30q, Gate level C programs, OS related it, general probability e.g find expected values, use bayes theorem etc. This section has to be done by all

                2nd(For quant profile): 7q, Main Quant section. Don’t know much.

                3rd(For system engineer profile): 7q, C and OS, diff between deadlock and livelock, what is switching & routing, Determine No. Of vtble & vptr of given classes, predict output of given C program, related to Preprocessor manipulation etc,

Good luck

IITK

60 min Pen Paper test

section A: Quant 30 most of them single correct choice

section B: Strategy role 7 subjective

section C: Engineer role 7 subjective

Very less time to complete. Do take your watches with you. Try to do your section B or C fully

Section A

1. Given rv’s X and Y in (0,1) find the probability that X + 3Y lies in [1,3] {½, ⅔, ¾, ⅖}
2. Minimum integer value of v where x⩽y⩽z⩽w⩽v has median 25 and mean 30 {1, 14, 25, 37, 38}
3. How many minimum comparisons to get second largest number out of an array of 32 numbers {18, 32, 64, 76}
4. What is the expected number of rolls to get two consecutive 5s? {36, 42, 56, 112}
5. Plot x1/x.
6. Write a method to return nth fibonacci number
7. Write a method to return the number of trailing zeroes in n!
8. person A rolls twice and the sum of the numbers on top is 4, similarly for person B the sum is 11. What is the probability that B has higher sum?
9. In Bag A there are     Black,     Blue marbles. One is chosen randomly and put in Bag B that already     Black and     Blues marbles. What is the probability that a Black one comes out of one is now chosen at random from Bag B?
10. A lily leaf in your pond grows to twice its area every day and the pond gets full in 33 days. If you start with 8 lily leafs in the beginning, in how many days does the pond gets full? {15, 18, 25, 30}
11. Number of cuts to completely divide 6x8 chocolate bar into 1x1 units.

Section B

1. If there are 100 rods and you bend them so that all 200 ends are indistinguishable and now you keep choosing 2 random ends and gluing them together (a) what is the expected number of loops formed? (b) what is the probability that a single big loop is formed? http://brainstellar.com/puzzles/207
2. If a postman puts letter 1 to 100 randomly in 100 envelopes numbered 1 to 100, what is the expected number of letters that are put in the correct envelope?
3. If X & Y are uniformly distributed pdf then find the cdf of X+Y.
4. What is the expected number of cards that need to be turned over in a regular 52-card deck in order to see the first ace? http://brainstellar.com/puzzles/209

Section C

1. Semaphore s = 2, there is a shared variable x = 0 initially, process X, Y use wait P, do x++, signal V, while processes Z, W do wait P, do x-=2, signal V. Give a possible scenario where the final value of x is (a) -3 (b) 2
2. What is the final output?

int main() {

        try {

int *p = NULL;

        *p = 5;

        printf(“%d\n”, *p);

} catch {

        printf(“pointer was NULL”);

}

return 0;

        }        

3. Print the output:

int main() {

        u_int8 arr[] = {45, 16, 7, 231, 45, 8, 7, 231};

        u_int32* a = (u_int32 *)arr;

        printf(“%d\n”, a[0] - a[1]);

return 0;

        }

4. Algorithm to find if two strings are anagrams
5. Objective: Get only 5 objects of a particular class. Write Pseudocode
6. Difference between IPC and RPC
7. Write a method to determine whether your system is operating in little endian or big endian

IITB

Date : 13/10/18
Duration: 1 hr pen paper
Open for: CS , EE Btech
Roles : Quant Strategist & System Engineer
        
Question paper same as above for IITD & IITK.
section A: Quant 30 most of them single correct choice

section B: Strategy role 7 subjective

section C: Engineer role 7 subjective
Checkout the probability puzzles from brainstellar.com . Some questions in section A & B were directly from here.

Indeed India

IITK

3 coding problems on Hackerrank platform - 90 minutes

1. Turnstile
2. Total different combinations possible from 5556477 etc where 555 is tapping a numeric key in your phone thrice for a letter. For eg if keys mapped to 5 are fgh so 555 can represent fff, fg, gf, h so  4  
3. Converting gray code to binary

IITD

3 coding problems on Hackerrank platform - 90 minutes

1.  Given a nxn square matrix containing integer values. You have to find the value of largest k ( size of a smaller sub     square) such that all subsquares of that size has sum < R. for eg. you can first try with k=1 if all the sub square of  size of 1 has sum < R then you can proceed to k=2 and so on. ( Even after using dp to store sums and using binary search for k was giving TLE on 2 test cases out of 14).

….2.  Given a array, you have to increment the values such that all the elements become unique. Find the smallest sum you can get by incrementing the numbers.

Eg: arr[]= {1,2,2,3,4} you can increment the value of 2 to 5, final arr is {1,2,3,4,5} and the output will be sum of the final array = 15        

3. https://stackoverflow.com/questions/44554450/sub-sequence-of-vowels

Oracle

IITR

Date - 14th October, 2018

Profile:- Application Engineer and Server Technology (Test was same)

1st Test

MCQ-3 section-Total 7 sub-sections,time allotted as per sub-section, 87 min test, Roughly around 60 questions. (AVL Trees, Trees, BST, DBMS- 25 questions around) (20 questions- Aptitude)

2nd Test

2 Coding Ques in 1 hr

Were there questions from OS? ??  yes there were many hard que from os

23154

Someone please add an example of the Bletchley Park problem??(+2)

Can anyone suggest solution to the above problem?

IIT K

Cut-off was 7.0 GPA

Aptitude/technical  questions :- many different sections based mainly on AVL and BST trees,OS,DBMS,flow charts, maths etc.

Coding:

1. https://math.stackexchange.com/questions/188812/n-th-digit-in-the-sequence-of-natural-numbers constratins 1<=N<=1000.

2. Graph based question, find the least cost path under certain constraints.  The test cases were really simple, I just found the min in the array and boom, it passed all the hidden once though I know it was wrong and got a counter case

IITB

There were 2 tests.

Fractal Analytics                                                                                                                              

IITK

Date - 13th October,2018

Profile - Data Scientist

4 coding questions/ 1:15 Hour test on hackerrank

1. superStack
2. https://www.geeksforgeeks.org/check-destination-reachable-source-two-movements-allowed/ 1 <= x1, y1, x2, y2 <= 1000
3. Minimum Operation on the string so as no consecutive letters are same. (Operations : Select any char an8d replace it with any another) e.g.: Boook -> Boxok (expected output: 1)
4. circularSubstring

IIT G

https://www.geeksforgeeks.org/minimum-incrementdecrement-to-make-array-non-increasing/

You

Sprinklr

(Is it open for Mtech CS ?)

IITK

Date - 14th October,2018

Profile - Product Engineer & Platform Software Engineer

3 coding questions / 1:45 Hour test on hackerearth

Codes provided by default in all the 3 questions can be completely removed. I was overwhelmed by the code for Q1 and I wrote complete new code from scratch and passed all cases.

Q1(150 marks) - Given a tree with N nodes and values assigned with them, root R, n-1 edges. You had to perform Q queries, queries can be of 2 types: (i) update i k: add k to the value ith node (ii) sum i: Report sum of subtree rooted at i.m

Constraints: N <= 105 ; k <= 107 No need to implement Segment Tree :( n2 algo passes all cases )

Q2(50 marks)- You are given a function f(i) = f(i-1) * (A*i9 + (B*i! + 1)*ii + C*(i^(i^i))). Where A = a*m, B = A*(b+c), C = 5*B + (A*log10(b*c))

Input:- n, m, a, b, c

Output:- f(n)%m

Solution- In case (n >= m) it’s divisible by m so return 0;

In case(n < m) the problem boils down to (n^n * (n-1)^(n-1) * ….. * 1^1)%m as A, B and C are divisible by m.

Q3(100 marks)- You are given an array (length <= 105) of 0’s and 1’s. Is it possible to split array into 3 parts such that decimal value of all 3 parts is same? If possible, return the decimal value else return -1.

Solution - Count number of 1s. If 0, return 0. If not divisible by 3, return -1. Else divide by 3 and find the value: if you iterate from the back of given array, you can figure out the number of trailing zeros in the last split, say tz. Now you know the required number of 1s in each split and the number of trailing zeros as soon as you hit the last 1 of any split while scanning from left to right. Store the splits in vectors and remove leading zeros and compare - v1 != v2 or v2 != v3 then return -1. Else you already have the vector and you can report the desired value.

IITR

28th Oct-2018

Profile - Product Engineer & Platform Software Engineer

(4 coding question and 45 MCQ (mostly from OS) | 2 hour test)

1. Given a matrix where 0- blank, 1-plant, 2-source. Find the shortest distance from source to any of the boundary edges. You can traverse through 0 in any of the four directions(left, right, up, down).

2. Find the count of all the submatrices of a matrix of size mxn, such that the sum of the elements of the submatrices is divisible by given number P.

3. Given 3 fruit f1, f2 and f3. Energy per unit of these three fruits is 2, 3 and 5 respectively. Given cnt1, cnt2, cnt3 amount of these fruits and cost per unit of fruits f1, f2 and f3 is cost1, cost2 and cost3. Find the minimum cost such that the total energy gained after buying these fruits is S.

Example: count:[2, 2, 1]

            cost [5, 5, 20]  & S = 10

          Ans: 20 if you buy 2 f1 and 2 f2.

4. There are N nodes. Each node has exactly 1 directed edge. You have to return the node from which maximum elements can be traversed.

For eg : N=3 and A[]={3,3,1}

So there is a directed edge from node 1 to node 3, from node 2 to node 3 and from node 3 to node 1;

So if we start from node 2 we can traverse all the elements.

Output : Return 2

(there was some problem in synchronising array indexes with given code. It’s better if you delete whole code and write your own )

IIT KGP

28 MCQs of varying marks(2 / 4/ 6), 3 coding questions (1 of 100, 2 of 50), 314 marks, 90 mins

MCQ’s based on C++, OS, COA, and some based on storage (don’t recall ever seeing something like that in DBMS or any other subject)

100 marks coding question: Given an array of size N. Q queries given L, R, X (L, R 1-indexed),

Return the maximum between indices(both inclusive) L and R which have X set bits in binary representation. Ex: A = [1, 2, 3, 4, 5] Q = 1, => [3, 5, 2] => 3, 4, 5 fall in L, R. 3 & 5 have 2 set         bits, maximum of which is 5. Return 5.                         Segment tree/ BIT implementation.

Solution:https://ide.geeksforgeeks.org/ZmGxP0pHsn 

50 marks: Given infinite number of 3, 5, 10 denomination coins, how many ways can you generate a sum of x? Sol: https://www.geeksforgeeks.org/count-number-ways-reach-given-score-game/ 

50 marks question: Given an array, choose two contiguous non-overlapping arrays, such that all elements are strictly increasing. Return the maximum length possible for this combination.

Ex: 7 1 2 4 6 5 3 8 9 10 => ans: 7 (Choose  1 2 4 6 &  8 9 10) l

IITG

Date: 4 Nov. 2018

(4 coding question and 45 MCQ (mostly from OS, Linux and Networks) | 2 hour test)

Q1) Given an array with non-negative elements and an integer K, find maximum sum of lengths of non-overlapping (contiguous)subarrays which have K as their maximum.

Q2) (Same as in KGP) 100 marks coding question: Given an array of size N. Q queries given L, R, X (L, R 1-indexed),  Return the maximum number between indices(both inclusive) L and R which have X set bits in binary representation.
Ex: A = [1, 2, 3, 4, 5] Q = 1, => [3, 5, 2] => 3, 4, 5 fall in L, R. 3 & 5 have 2 set bits, maximum of which is 5. Return 5.          

Segment tree/ BIT implementation. Solution:https://ide.geeksforgeeks.org/ZmGxP0pHsn 

Q3) (Same as in IITR) 50 Marks: Given 3 fruit f1, f2 and f3. Energy per unit of these three fruits is 2, 3 and 5 respectively. Given cnt1, cnt2, cnt3 amount of these fruits and cost per unit of fruits f1, f2 and f3 is cost1, cost2 and cost3. Find the minimum cost such that the total energy gained after buying these fruits is S.

Example: count: [2, 2, 1]

            cost [5, 5, 20]  & S = 10

          Ans: 20 if you buy 2 f1 and 2 f2.

Solution: Make an array containing cnt1 times 2, cnt2 times 3 and cnt3 times 5 as its elements. Now find the minimum cost subsequence which sums to S.

Use cost_i instead of count in this approach: https://www.geeksforgeeks.org/maximum-size-subset-given-sum/ 

Q4) Given a number X, following two operations with different costs can be performed on it

1. at Cost A: X →  X-1 or X → X+1
2. at Cost B: X →  X/2

Find minimum cost to reach this number X starting from 0.

Soln: (greedy) Start from X,

If X is 0, answer is 0.-
if X is even then one can reach X/2 in min(A*X/2, B) cost. answer will be min(A*X/2, B) + func(X/2).
If X is odd then make it even using A cost. answer will be A + min(func(X+1), func(X-1))
We are reaching to 0 in minimum number of operations. And at each operation the option with minimum cost is taken.

This solution is giving runtime error because there is no limit for x+1, Can someome please post another sol ?

• The solution above is correct, please check your implementation. X+1 will become (X+1)/2 in the next step. So convergence is guaranteed.
  
  BFS should work

IIT-BHU

Same as IIT-G

NetApp

IITG

te - 13th October 2018

Profile - Software Developer

2 coding questions/45 mins on their own platform

30 MCQ questions/30 mins on their own platform

Coding question 1: Given an array of size n where each the ith index has the value i, count the number of subsequences whose product is even.You are given a grid of size m*n, where there are 3 types of values: ‘X’ invalid, ‘0’ can be visited and ‘1’ can be visited. You are stationed at (0,0) facing right. What is the maximum number of 1’s that you can visit?

The condition is that you can do only two types of movements, either you can move one step to the direction you are faced, or you can move down and reverse your face.

Coding question 2:

The MCQ questions were based on OS, Networking concepts and General Aptitude.

IITK

Set 1:

Coding q1: GIven a number n, 1<=n<=10^18. Find all divisors of n. For each divisor d, count numbers less than d and co-prime to d (basically euler totient function, phi), and sum up these counts.

Ex. for n = 4, divisors are 1,2,4. phi(1) =1, phi(2) = 1, phi(4) = 2. So answer is 1+1+2 = 4

Set 2:

Coding q1: Repeated coding question 1 IITG. {even product subsequence}

Coding q2: Given a binary array find the longest non decreasing subsequence and return the product of number of zeros and ones.

APPDYNAMICS

IIT-G

Time: 90 minutes

Platform: Hackerrank

 Total 15 questions , 12 mcqs and 3 coding :- Coding questions are relatively easy.
Mcqs are based on data structures (easy)..
    * on XOR linked list
    * on recursion tail
    * on B-Trees
    * on stack uses

     * probability

     * Aptitude
1) you will be given value of k and you need to find the value of n for which ;
       n*(n+1) = 2*k; if integer value of n is not possible take the floor of n. The values are big so you need to use long or long   long . I just simplified and given the main part of the question the actual question building was quite different.

2) Given an array you have to find the degree of divisibility of the array which is the max of divisibility of all elements then just multiply degree with 10^5 which was termed as strength. Then 2 terms were given no. of instructions and time for each instruction just calculate the total time by multiplying and if this value is greater than the strength return 1 else return 0.

- very easy problem

3) Have to construct a k-ary tree and then the from the given node have to traverse and return the number of nodes containing prime values.

Please update 2 more questions +102

 IIT D

Questions: https://imgur.com/a/PIXIxR8 

Go, slay them. Good luck.

IITK

1.        https://www.careercup.com/question?id=5721734273564672

2.         Simple Ad-hoc question. Hardest part was to understand the question itself.

        Key-value pairs were given as strings, and if a key appears once again, then you need to update the value of that key every time. And return the values in the order in which their keys appeared first.

3.        Undirected unweighted graph was given. We need to return nodes in increasing order of the distance from a given source. Simply apply BFS to find distances of all nodes, sort nodes according to distances and return.

4.         MCQs based on trees, B-trees, time complexity, sql queries, etc. (Simple GATE level)

IIT R

1. Simple ad hoc math question. (Bruteforce)
2. No of co primes with a number in a given range (Bruteforce)
3. Similar to rod cutting but no DP. (Bruteforce)

 IIT KGP

1.5 hr test

Hackerrank platform

12 MCQs + 3 coding questions

• Given an array(element 1 or -1) of size n you have to return minimum integer k such that

sum_of_elements(0 to k)>sum_of_element(k+1 to n-1)

• https://www.geeksforgeeks.org/roll-characters-string/

Same question O(n) solution(easy)

• https://drive.google.com/file/d/1vkAT9IqPARME5C2TVZYhRfViQbpBlnB1/view

Dp solution of table size 2*n please share the approach +6(solution)

        MCQs based on B-trees, general aptitude, binary trees, BST, data structures, algo, find C given no. of internal and leaf                  nodes in a full C-ary tree, Linear Probing in Hash tables

   IITB

1.5 hr test

Hackerrank platform

12 MCQs + 3 coding questions

1. https://practice.geeksforgeeks.org/problems/ticket-sellers/0
2. https://www.hackerrank.com/challenges/string-similarity/problem
3. Given a list of strings and an interval find how many strings in interval begin and end in vowel

Eg: input list of string -> oru,abc,ace,eyu,dghu,uo & interval = (2,4)
     Then output = 2 (because in 2-4 , string 3 and 4 start and end in vowel)

FORTANIX

2 Questions in 45 minutes on co-cubes

IITK

Date: 14/10/18

1) https://www.geeksforgeeks.org/given-an-array-arr-find-the-maximum-j-i-such-that-arrj-arri/

2) https://www.geeksforgeeks.org/wildcard-pattern-matching/

(1 DP question and 1 other question afaik)

SET 2

1)https://www.geeksforgeeks.org/maximum-product-of-4-adjacent-elements-in-matrix/

2)https://www.geeksforgeeks.org/wildcard-pattern-matching/ 

SET 3

1)https://www.geeksforgeeks.org/transform-one-string-to-another-using-minimum-number-of-given-operation/

2)https://www.geeksforgeeks.org/write-c-code-to-determine-if-two-trees-are-identical/

SHUTTL

IITK

Software engineer:

14 questions (10 multiple choice + 4 coding) on HackerRank

Business Analyst:

60 MCQ in 60 min. (type is same as of Pariksha but bit tougher than that)

Important - Time management

Euler

IITH

1.

2.

3.

3. Gold Mine problem. Collect maximum gold coin and return back to (0,0).

Trexquant

IITK, IITM, IITB, IITD

Platform - Hackerrank 

(Python allowed)

Squarepoint Capital

IITD

2 MCQ + 4 Coding + 1 approx. solution type

Time - 1.5 hrs

Platform - HackerRank

Languages allowed - C,C++,Python (No Java)

MCQs were on basic Data Structures and OOPS.

Almost all of the coding ques. were of Dynamic Programming

1. https://www.geeksforgeeks.org/coin-change-dp-7/
2. https://leetcode.com/discuss/interview-question/124943/dynamic-programming/125712
3. https://leetcode.com/problems/count-binary-substrings/solution/
4. https://www.geeksforgeeks.org/longest-palindromic-subsequence-dp-12/

Credit Suisse

IITK

Risk Management profile

Open for Mtech, Dual all depts., CTC – 14.7 Lakh pa

1 hour-20 question, hosted on Hackerearth. CPI cutoff around 8

Question based on Prob and Stats, Linear Algebra, limits, calculus, series with more focus on prob and stats

Some of question asked:

•  ydx+dy(x-y^2)=0, then some derivative question asked about the equation after solving it.
• Integral of dx/(x^2017-x) with some limits
• lim(t->x)    (f(x)*t^2-f(t)*x^2)/(t-x), question was to find function satisfying relation with some initial value
• x^2+2x+6=0, if r is root of this eqn, value of (r+2)(r+3)(r+4)(r+5)
• lim(x->0)   (x^2*sin(1/x)+2x)/((1+x)^(1/x)-e)
• Power of 3  in multiplication of first 100 odd numbers

 IITKGP

         Exactly same questions as IITD

IIT B

Exactly same as IITD

PUBLICIS SAPIENT

IIT BHU

20 aptitude question, 2 programming (20 mins for aptitude, 90 mins for programming)

1. Number to string conversion- eg. 1253  gives ABEC.
2. https://www.geeksforgeeks.org/minimum-number-platforms-required-railwaybus-station/ same question with different language.

IITR

Same pattern as in BHU followed by an audio video test on hirepro platform.

Programming Questions-        

1.Find the sum of elements of given array and print the 8-bit binary representation of the sum.If sum overflows(i.e. sum>255) then print the 8 least significant bits.

2. Easy Greedy Problem. Please specify the question if possible?

IITG

Same pattern as in BHU and Roorkee. Programming Questions were same as Roorkee.

IITB

Hire pro platform(75 minutes)

Two Coding question asked:-

1. Same as coin change problem
2. A number is given, we have to swap two digit to get the highest even number.

Example:- 54671---> swap digit 6 and 1 → 54176

IITM

1. Two arrays given, One represents Set A and other represents Set B. Print set difference A-B. (original order of set A elements to be preserved)

1. Ex : A = [5, 2, 8, 0, 4, 6, 3 ] and B=[1, 2, 3 ,4], print [5, 8, 0, 6].

2. Array of numbers given. Rearrange them so that the largest element is at the center, second largest to the left of max, third largest to the right of max, fourth largest to the left of second max and so on.

1. Ex : [56, 34, 87, 13, 77, 99] should print 13, 56, 87, 99, 77, 34

IIT Kgp

UBER

IIT-KGP

Solution: https://math.stackexchange

 .com/questions/1293020/calculate-diffOpp-KPHB-JNTU,kukatpally, Hyderabaderent-sequence-of-scores-in-a-volleyball-match

Rakuten

IITB

Test was on Codility platform.

Each student got different question

IIT D guys please add Rakuten questions.

---

Mercari

Is python allowed????

orIITB, IITD         

IIT Kgp

IITH

Honeywell

IITKGP, IITK, IITG, IITH,IIT BHU

IITH

Exactly same questions as above

Amazon

IITD

Please upload walls problem

Can anyone please share the code of both the questions

Can anyone please upload ans of 2nd

IIT BHU

Same coding ques as IIT D. 20 MCQ with .25 negative marking.

In first question for each query you have to return the minimum ladders you have to take to reach a given floor starting from ground floor. Each floor is guaranteed to have a ladder.

Please tell what the second question was.

Does greedy solution Works ?

IIT KGP

300 marks test, 1.5 hr on hackerearth (2 coding questions - 200 marks, 20 MCQ - 100 marks)

https://www.geeksforgeeks.org/minimum-number-platforms-required-railwaybus-station/ (Same question - 100 marks)

https://www.geeksforgeeks.org/count-integral-points-inside-a-triangle/ (For a polygon instead of a triangle - 100 marks)

20 MCQ (5 marks each) - OOPS(4-5), Networks(5-6), OS(3-4), Data Structures (5), Algorithms (2-3)

Running code https://ideone.com/laser0/amazon

Tower Research

IITD

Cut off - 7.00

Resume Shortlisting - Yes                

29/10/18. Three sections:

1. 35 Ques, 30 min, Basic quant: Basic calculation and probability questions
2. 20 Ques, 25 min, Advanced quant (not really, similar topics to basic quant)
3. 2 coding questions, 35 min (different for everyone)

1. Given a chameleon which can change colour from 0-9 and given 2 integers N, M and 10x10 matrix of graph, find least number of steps to go from N to M. (Basic bfs, I guess) BFS Works for this.
2. Given a string of “passwords”, find distinct passwords. Two passwords, a, b are similar if for swapping any ith and jth index of a, such that (i+j)%2==0, a becomes b. Eg abcd==cdab. (+a <> c, b <> d) Solution: https://ideone.com/obetto

IITK

Three sections:

1. Basic mathematics: 30 questions, 30 min
2. Quant and probability: 20 questions, 25 min
3. Programming ability: 2 questions, 35 min

1. You have to distribute n candies to K children: 1,2,3...K. Start from child 1, give 1 candy, then 2, then 3 and so on. Return the number of candies each child has. Ex:

        Consider n = 10, k= 2: child1 gets 1, child2 gets 2, child1 gets 3, and so on.

Output: child1->4 child2->6

2. N people standing in a queue. Three different events occur.
           Event 1: transaction complete, first person leaves the queue.
           Event 2: some person x leaves the queue, x is specified along.
           Event 3: print the position of a person x,specified along.

        PS. Test was on mettl. So, brace yourselves :p. And yes, that finding out different substrings was also asked to some peeps in IIT Kanpur. So, it is possible you might end up on these questions.

Mathworks

IIT Hyderabad

• 2 coding questions- choose any 2 languages from c/c++/java.
• Bonus section for python (8 questions)
• Technical questions on c/c++/python (solve questions for any 2).
• Simple Maths question.
• Note- questions were different for different sets. Approx 3-4 sets were there.

IITG

Same pattern as IITH

Coding questions:

1. (repeated by SAP Labs) Team Formation:
   Given an array of non negative integers, select x largest numbers from it given the following conditions:
   Choose the numbers in sequence and keep removing them from the array, every time number can only be selected from first or last m elements, in case of conflict choose the one with lower index. In case first and last m elements overlap, choose the largest number of array. Return the total sum of them. C++ code
2. Find maximum difference Aj - Ai s.t. j > i and A[j]>A[i]

IITR

        Same pattern as mentioned above

HSBC GM (Analyst)

IITK

Cutoff around 7 CGPA, Btech and Dual

5 sections in approx 2 hours

15-Reasoning

15-Engg Mathematics (Fourier, Laplace transforms were mostly asked in IITR and some ques of differential equations(Level was difficult for students who were not remembering 1st year maths course))

15-Probability Distributions (Tests were asked)(T-test, Z-test, Chi squared test in IITR)

4-Coding questions: C++,Java, python, STL allowed

25-Quantitative aptitude (Speed maths-10 min 25 ques in IITR)

Time was an issue especially in aptitude section, level was above pariksha tests. Can’t switch across sections

Coding questions as follows:

https://leetcode.com/problems/remove-k-digits/

Indus Insights

Cpi cutoff? Reply: None

IITR

29th November. Pen paper test (No knowledge of coding required)

Scoring +1 and -1   lkjadgfla

1st Part- Section 1: Probability based MCQs

           Section 2: Data interpretation (easy af, moreover, calculator was allowed for the whole test)

           Section 3: Critical reasoning

2nd part- Guesstimate on pen paper- Fuel sale in INR in a petrol pump in Delhi/Mumbai in a week

Salesforce

IIT Delhi time?

31st Oct

Please provide sol ?

https://ide.geeksforgeeks.org/JX4QXaWu5j

This sol is giving wrong ans for 12.it is giving 5 output while correct is 4.1->12=4*3.2->4=2*2.3->2-1.4->1-1=0.so total 4 operation        

-

3. https://www.geeksforgeeks.org/count-possible-decodings-given-digit-sequence/ 

1311

IITB (4/11*)

3 questions in 1 hour, HackerRank

1. Minimum number of moves for a knight on chessboard to reach from a given source to a given destination.

2. Array of product prices given. Each product is discounted by the first element to its right which is <= to it. If not present, discount is 0.

3. Lottery tickets numbered 1 to n. Value is sum of digits of the number. Find the no. of tickets whose sum is maximum. n<10^4. Directly scan 1 to n and store counts. Passed all cases.

IITM

1. Some simple definition of class and function problem.We have to complete three classes dog,cow and donkey by completing certain functions (based on the concepts of Inheritance and Abstract Classes)

2. Binary Tree question. To find level of the tree -  Species exist as different indices in an array. The value in the index of a species in an array points to the index of its predator. -1 value indicates it has nfo predator and is at top of the food chain. Find minimum number of ways to group species together across food chains (multiple food chain trees arise from one such array) such that no species in one group eat each other. Essentially boPreOrder given for a tree, we have to print YES or NO if it could be the preorder of a valid BST.

        https://www.geeksforgeeks.org/check-if-a-given-array-can-represent-preorder-traversal-of-binary-search-tree/

IITR - please add(+1)

1. Given two strings A and B, B is a string consisting words  of A only.

Return the missing words are not present in B but are present in A.

Ex - +

A: I love programming.

B: love

Output-

I

Programming.

IITH

1. Candy problem asked in Flipkart.
2. Collect maximum coin in a matrix (with obstacle) and return back. https://www.geeksforgeeks.org/maximum-points-top-left-matrix-bottom-right-return-back/
3. Given two integers, l, r and k, find the maximal value of a xor b, where and satisfy the following condition:

l <= a <= b <= r and a xor b <= k
Same question except condition a xor b <= k. https://www.hackerrank.com/challenges/maximizing-xor/problem

Sapient Data Scientist

(Mention package please :)) 

IIT Delhi (03/11/2018)

35mins(Apti+DS+coding
), 85mins(below)

HeadOut

IIT Dhanbad: 30th Oct 2018

q1.https://www.geeksforgeeks.org/smallest-window-contains-characters-string/ 

Platform: Hackerearth

Test duration: 90 minutes.

Questions: 3 coding questions (100 marks each).

1. Given an array of numbers and a list queries, find the number of factors of the product of the numbers in the range, for each query.

n=5

arr={1,2,3,4,5}

Query: 1 3

Output should be 4

Explanation: the product of numbers between 1 to 3 (1-based indexing) is 1*2*3=6

Factors of 6=1,2,3,6. Therefore the answer will be 4.

Constraints:

1<=T<=10000

1<=N<=10000

1<=A[i]<=1000

(Can someone suggest solution to this one? Also, what is ‘T’ in constraints, shouldn’t it be ‘Q’?)

A = list(map(int, input().rstrip().split()))

prod = 1

for i in range(0,3):

    prod = prod*A[i]

factors = []

for i in range(1, int(prod**0.5)+1):

    if(prod%i == 0):

        factors.append(i)

        factors.append(prod//i)

print(len(sorted(factors)))

     2.    Given a number N tell if its possible to convert it into a fibonacci number by rearranging the digits of N.

        Constraints: 1<=N<=10^15.

        Solution: Similar to finding anagrams of a string.

           Can you please elaborate your solution ?

        https://ide.geeksforgeeks.org/sYgPZBen5t   Wrong solution

     3.    Given a string of lowercase english alphabets find the minimum length of a substring containing maximum number of distinct characters.        

Constraints: 1<=|S|<=10^5.

Solution: https://www.geeksforgeeks.org/length-smallest-sub-string-consisting-maximum-distinct-characters/

IIT Kanpur-please add

IIT BHU - same 1 and 2 of IIT DHN,3rd not remember.

Rubrik

IIT Kanpur

1. Array A = {1} was to be modified indefinitely (3 steps were given on how to modify), it was queried to print A[i] for any i
   (0 <= i <= 10^5). After simulating the modification steps for 3-4 steps, it was very easy to see that the answer for any n was, f(n) =  2^n.
2. Given N coins, one of them weighs lesser than all other. Given a physical balance which can weigh two sets, one on each side. What is the minimum number of times one has to use the balance to find the lighter coin.
   Here also, recurrence was tricky but ultimately boiled down to  
3. Implement a file system with following commands CREATE, READ, EDIT, SIZE, EXIT. question was long to implement but there weren’t any trick involved. You had to implement everything as per the description given.