We Inter IIT Placements 2021-22

—

                                        Interview questions kaha milege? ʕ´•ᴥ•`ʔ˙˚ʚ(´◡`)ɞ˚˙★⌒ヽ(●＾､＾●)Kiss!* ka interview kaha hua hai?  II T

from pg 150

Experience: oohttps:www//bit.ly/2VXut2UMV 

Any link for previous year experiences? here

Ab Interview Doc bhi update krdena sb

@roorkee folks microsoft ka add krdo yrr

Is there any dress code for placement interviews in online mode? (๑ↀᆺↀ๑)

 🎳🎮🎳`        `                `        0

                                        Is suit ♡´･ᴗ･`♡♡´･ᴗ･`♡ shirt and tie is enough ig.CHAL BE TSHIRT MEI DEDO GHANTA FARQ NHI PADTA -

Pehen lo bhai :) Accha impression padta hai interviewer pe :)

How are this year’s placements in all IITs compared to previous years?

IITG aur R ne to mauj kar di is baar

kese? Companies hi companies babu bhaiya

Fuml Placement Bazzi ho rahi iss baar

Roorkee me day 2 khatam huya nahi and already 600+ offers!

IITD ke saamne bacche hai abhi yha 750+porfiles hai

Delhi me itni companieya h sabka test bhi nhi hua :(

(flipkart tak ka paper nhi hua) Paper nhi seedhe job milti delhi mei..

ONLY EMAIL KO ACCESS DO, pta chal jayega kaun delete kr rha hai

To retrieve deleted questions go to file version history and get back the questions from their nincompoops. Don’t restore just copy paste!

view only link 

edit link  (Please CONTRIBUTE, note: this is the link of the current doc) 

The more you will add, the more it motivates other people to share also. PLACEMENT LGANE KE LIYE SHARE KARO BHAIYON or UNKI BEHNO v

Please don’t remove bookmarks of company list :

1. Don’t make other bookmarks of the same company name in the company table list.
2. Just update questions in the respective companies bookmark.
3. If a new company's name occurs to you, add it in the company list and questions.
4. Also put the company name in the outline list (in side panel)

Steps to follow:

1. Select the company name
2. Right click on it
3. In menu list - Add to document outline

When the shortlists are released for interviews? At the enKid nof Nov.  or earlier??+++(I don’t know any seniors, ppl who know seniors plz ask them abt this) In IIT BHUsome shortlists are being released. In IITR, it’s released in the last week of NOV . In IITK some shortlists are released. IITB, a few weeks ahead. In IITKGP last week of NOV PLEASE CONTRIBUTtring: leetcodeE.

People from new IITs, NITs, IIITs, BITS are also requested to add their test questions. indeed. Currently most of the contribution is from old IITs only. let me correct you only few Old IITs  contributing. Yes, exactly!!Everyone is contributing now.ChillYes,but still no contribution from new IIT’s,NIT’s, BITS.++

IIT DHANBAD, BOMBAY GUYS, PLEASEaa ADD TEST QUESTIONS .+++++ADDED

Campus Visiting Companiesjio

Guidelines:

Mention your college name

• Mention CPI Cutoff and eligible discipline (please apply red color highlight)

• While typing, use Ctrl + Enter to go to a new page
• PLEASE KEEP COMPANIES ON SEPARATE PAGES or use horizontal lines to separate them.
• Enable outline for Company Shortcut razorpay
• Page edit history will be maintained in History Page
• Please don’t remove questions, some people are frequently deleting screenshots/questions.
• If possible, mention whether the company is open for M.Tech. or  not  ns
• Red

• For CPI and Discipline Cutoffs

• Orang

• For Very Important details

• Pink

• For Important details

• Cyan

• For a QuestionWhile adding external solution links, please apply green color highlights
• Green

• For External Links and Answers to any question

• 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 the outline and makes the document look cheap.
• Please update here about every company help other

Company List

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

Those who are creating links, Insert -> bookmark in front of the company name where questions are added, then add a link to the bookmark.

For eg see Microsoft link

Hence, in the Editing link select company Accenture Japan name in the table and press ctrl+K then select the bookmark and not heading.

Queries Section

        (INSTRUCTION: Use Bullet Points while asking queries)

Is this docs active still commenting on april 26 2022.If active is there questions posting regularly?

Mtech cse IITB se hu 10 and 12th ke marks bhi matter karega?

• Can somene add wipro questions? (chutiya company hai Python 2.7 pe test liya)

• IITH.IITK,IITBHU please add Mathworks questions. +1+1

• Please upload Deloitte Question paper?

• Has BAJAJ visited any Campus?+Yes in IITB

• Any Core Mechanical profiles??+1

• HAS INDUS INSIGHTS VISITED ANY CAMPUS ?? IITD Questions Added

• NIYO SOLUTION TEST CONDUCTED ANYWHERE????

• Oracle Questions, PLs ADD !!!!
• Has CRED visited any campus?? IITGOther than that?
• Has UiPath visited any campus??IITG,IITK
• Has Brane Enterprises visited any campus other than IITR? Please add questions if any test is conducted Yes IITG but test not happened
• ADD QUESTIONS FOR DREAM11
• Zestmoney visited anywhere??? IITBHU
• Has Gojek visited any campus other than IITG?  Yes, IITR

games24*7 visited anywhere, other than IIT BHU ?

PLEASE ADD QUESTIONS OR DETAILS ABOUT AXXELA

        please add urban company’s questions..

Please add american express questions from IIT kanpur and IIT R (SDE)??????IITK mai american express ka test abhi hua nhi hai

• American Express sde questions anyone?????
• Anyone please share Indus Insights questions?? Ko???
• Have these companies (AB Inbev, Publicis sapient, JP morgan) visited any campus yet?

• IITR,IITK Add Indeed Questions. Plz. ++

• PLEASE ADD DYNAMIC TECHNOLOGY QUESTIONS. IIT Dhanbad(Added), IIT Bombay (questions??) please add questions
• Has Galytix visited any campus? IIT BHU ( Round 1 test done). Previous CAT sets were there in LR and quant.

• has edgeverve visited any college?IITG
• Please Add Mathworks questions!

•  IITD add please add Zomato(Full time SDE) Questions +1++++++1

• Status of campus placements drive in your IIT’s , IIIT’s , NIT’s ?+1+1 +1

• Has companies started visiting for placement? yes
• IITD has worldquant test on 6th Sept. What abt others? (IITM has it on 25th Oct)
• Can IITD guys share the questions/ topics covered in worldquant?(Probability,Statistics) Only MCQs in papers. No coding questions. Some were repeated from previous years. You can check in previous years docs.
• Also regarding finding the output of given pseudocode MCQs- what language are the pseudocodes in?(C/python?)
• IITD is having an Estee Advisors test on 9th Sept. Has Estee visited any other campus yet?

• IIT BHU CONDUCTED TEST WAS EASY WITH DIFF SECTION OF MENTAL ABILITY ,DEBUG AND CODING TOTAL TIME 3 HOURS If you know questions (anything about it) , please add. ++ Yes, please add them in a bookmark. added

• Has Samsung visited any campus for sde?? Please add its questions. iit BHU upload questions ??

•  Has Samsung visited any campus for a Hardware profile? Plz add its ques

• Has Arpwood visited any Campus?? Please add its questions…+1+1+1.Do add questions.

• We Please also add eligibility criteria for companies

• Has Amex visited any campus? Placement IIT KGP + IITG 23rd OCT [Hackerearth] SDE Profile?? Yes

• PLZ ADD QUALCOMM QUESTIONS FOR CORE HARDWARE PROFILE

• Please ADD PUBLICIS SAPIENT  DATA SCIENCE QUESTIONS IIT KGP

• Paytm ,Optum Visited any Campus???

• Has Intuit visited any campus yet?? +IIT KGP Can you please upload the questions?test on 2nd Aug.

• Any Preparation for CISCO ? Only C/Java/Python allowed in its coding round. So prepare for it. Also questions tend to repeat a lot. So  see the last year's docs.
• Has Cisco visited any campus this year ? +IIT KGP, K

• IIITB please add flipkart questions.

• PLEASE ADD WELLS FARGO QUESTIONS???? +1 DONE

• PLEASE ADD EX

• mL ANALYTICS QUESTIONS

• Please ADD NVIDIA 6 month and VMWARE 6month+FT Questions        

• Gameskraft Guys please add questions please

• PLEASE ADD PhonePe full time OA questions….

• PLEASE ADD VISA full time OA questions…+1.+1 +1+1+1+1+1+1+1+1

• PLEASE ADD EXL Analytics Questionssimple QA, VA, DILR Questions, refer previous year questions from such docs. Got 2 prev. year queen in QA. 

• PLEASE ADD ORACLE full time OA questions
• PLEASE ADD TEKION QUESTIONS

• PLEASE ADD   MEDIA. NET questions 🙏 IIT R GUYS PLEASE ADD MEDIA.NET QUESTIONS Added

• IITG GUYS, PLEASE ADD FRACTAL ANALYTICS QUESTIONS?
• Schneider electric R & D profile test
•  question plz ADD URGENT
• ESTEE ADVISORS VISITED ANY CAMPUS?
• Has Trexquant visited any campus yet??IITM please add questions
• IITD add please add Zomato(Full time SDE) Questions +1++++++1apt

• Please Add EightFold.ai Ques. Added.

• CGPA criteria for PWC(ASSOCIATE)????

• **Dream11 and Chargebee questions. Anyone?**For chargebee, they are in this doc

• Has Millennium Management visited any campus?  YES, IITD,IITK, IITR Please add++.

• Please Add InMobi questions +1 Added

• Did Fractal Analytics Visited any campus other than IITG, Please add questions?IIT BHU, dates  not announced 

• How to take screenshots in full screen mode test without getting and violation?
• should I use snipping tool or window+(prt sc) [screenshot] ? Many laptops have ‘PrtScn’ button on keyboard
• I can see many people are posting screenshot, so how they are able to do it?
• Do they detect copy (ctrl + c) ?

• Jaguar Land rover kis campus pe aaya hai abhi???? IITD - Most IITs mei aa gyi
• Add Housing.com questions IITR guys ,chutiya company hai adhe bacho ka test hi ni hua PLEASE ADD MCQS
• Deloitte questions anyone. Khud contribute nhi karoge to koi nahi karega it hardly takes 5 minutes +1
• IIT INDORE guys please add question for deloitte USI.+++++++ +++++1+++1+++1
• Plz add Morgan Stanley Questionsss -Very easy q for stats profile for quant 2 dp questions and apti
• ADD APT PORTFOLIO QUESTIONS++++++++++++++++++++

Add APT Portfolio quant role questions and pattern … pllzzz

Jaguar Land Rover:

20 MCQ in 40 minutes. Adaptive pattern. Question based on Quant, reasoning. Level : CAT level test.

IITB:

IITH: (Same at IITR)

Pure Software Profile  

        - https://www.geeksforgeeks.org/number-of-integral-solutions-for-equation-x-bsumofdigitsxac/ 

- https://www.geeksforgeeks.org/largest-number-with-one-swap-allowed/

8

IITG:

The platform is very bad. Caused a lot of problems. No camera No autocomplete. ++++

Minimum Adjacent Elements

2 coding questions(Easy):

1. Game theory question

2. smallest number greater than given number having same digits (next_permutation)

IIT Bombay:

Q1:https://leetcode.com/problems/longest-increasing-path-in-a-matrix/

Q2: https://www.geeksforgeeks.org/job-sequencing-problem/

IITK - Same as IITB

IITG - Retest - Same as IITB

Google

Google More Question from DTU NIT Rourkela

https://drive.google.com/drive/foldersi/1Zu8bQN4vy5p_PpsQHySMXJX9faF39abj?u 

Anybody has idea how to solve these problems?

*this-question-was-asked-in-google-online-coding-challenge-for-fte-on-10th-july-202 

sp=sharingM7 business schools”

 1

Fareye

1. Leetcode: Rotate string
2. Shared Interest (Hackerrank)

Dunzo

Important Points

• Discipline:                 BTech MTech Allowed? only circuits branches allowed

• Platform:                Hackerrank
• Duration:                 75 min
• Question type:         2 coding problems

There were two questions to solve..time was 75min and platform was hackerrank     (which branches were eligible ?       how to solve the 2nd one?)

subsequences of first n characters in input string. We can recursively write it as below.

Optimized solution to this problem??

This was for the 2022 Batch ?? YES

        SOCIETE Generale DO QUESTIONS REPEAT?? No

IIT BHU (FTE)

1) 10 mcqs from aptitude (14 min)(Medium)

2) 4 mcq on english (2-grammer, 2- passage) (4 min)

3) 15 mcqs on technical (major of software egg, testing, dsa, dbms) (19 min)(Difficult)

4) 3 coding questions 2 easy 1 medium (53 Min)

what are the coding questions??

SRIB - FT coding test

Important Points

• Discipline:                 MTech Allowed?, B Tech, only circuits branches allowed??
• Platform:                CoCubes
• Duration:                 90 minutes
• Question type:         2 Coding Questions

Which college bro??+++++++++

Did Everyone have the same questions?? they repeat questions all the time..i got same questions for my PPO test and same questions could be found in last year INTERIIT doc

IITM, Kgp guys plz add questions!!         

1. Minimum swaps to relative sort two arrays

2. Sum of boundary nodes of a binary tree

IITK Kyun delete kar rahe ho bro? Doosre ki help nahi ki jaati?

1. Count artic
2. ulation points
3. Maximum leaf-to-leaf path sum
4. Count nodes that satisfy children sum property
5. Least weight path with k edges   IIsme Source and destination node di hui thi?? https://www.geeksforgeeks.org/shortest-path-exactly-k-edges-directed-weighted-graph/

Deutsche Bank

Important Points

• Discipline:                 B Tech, only CSE and ECE allowed. Is the test proctored ??
• Platform:                HackerEarth
• Duration:                 90 min    CGPA cutoff??
• Question type:         3 Coding Questions

Didn’t you guys have a situational test? IIT Kgp folks have a situational test College? What is a situational test?
Please update me with more questions on how to do the first one? Any update regarding further rounds?

first one boils down to the sliding window problem in which we need to find the size of smallest subarray with sum>=target

PLEASE Add more ques for deutsche bank please PLEASE

PLEASE SOMEONE ADD MORE QUESTIONS OF DEUTSCHE BANK +1+1+1+1+1+1+1+1+1+1+1+1+1+1+1

PLEASE ADD MORE QUES

IIT Dhanbad

all the qs for all students are same as in the link

https://leetcode.com/discuss/interview-question/1561394/Deutsche-Bank-or-Oncampus-or-Tough-Questions-Hackerearth-or-5th-NOV-2021-1%3A30-hr

Amazon

Important Points

• Discipline:                 
• Platform:        Amcat        
• Duration:                 
• Question type:         

---------------------------------------------------------------------------------------------------------------------------------------------------

TAKING SCREENSHOTS NOT ALLOWED

NITS

Platform : AMCAT

We have to take 4 elements at a time and , every time we take 4 elements . we have to find the max value we can get by picking all 4*n elements.in an array of size 4*n, our values increase by the value of the 3 rd smallest element taken.

Code 1: subtree with max average value

Code: 2 :  least number of unique integers after removal (d k id O(nlogn) solution pass? or were we expected to get it in O(n)

Rest part have : Debugging ques, reasoning question etc

See this to know the exam pattern:

https://leetcode.com/discuss/interview-question/1358837/Amazon-OA-SDE1

More Question from NITs (Amazon)

amazon

IITD

Platform : AMCAT

2 Coding questions. Different for everyone

Eligibility?? no cgpa cut

Mine were -

1. https://leetcode.com/problems/maximum-units-on-a-truck/  all test cases were not passing in the knapsack approach.
2. https://leetcode.com/discuss/interview-question/699973/Goldman-Sachs-or-OA-or-Turnstile

Rest part have : Debugging ques, reasoning question etc

--------------------------------------------------------------------------------------------------------------------------------------------------

IITK

Platform: AMCAT

7 easy debugging/error correction at the start in 20 minutes

2 coding questions in 70 mins

                1. Amazon | OA 2019 | Substrings with exactly K distinct chars - LeetCode Discuss

                2. Amazon | online-assessment | FetchItemsToDisplay - LeetCode Discuss(ye link doesn’t exist bol raha hai)

Workstyles Amazon Test (Personality test)

Aptitude Test (24 Q / 35 Mins)

Last Compulsory Feedback form

`

Coding ques -

1. Fill the truck : https://leetcode.com/problems/maximum-units-on-a-truck/ 
2. Exactly as https://leetcode.com/problems/sell-diminishing-valued-colored-balls/ but in a different phrasing

Rest all sections same as above.

IITR

Platform: AMCAT

Coding questions - 70 min

1. Exactly same as https://www.geeksforgeeks.org/count-number-of-substrings-with-exactly-k-distinct-characters/ 
2. Given an array and a K. To find minima of all contiguous subarray of length  k and find then return max of all the minima’s.(very easy and all test passed with brute force);

        ex: arr = {2,8,5,9} K = 3;

minimum of {2,8,5}= 2, min of {8,5,9}=5;

ans = max(2,5)= 5;

Students have a different set of codYou are given a tree consisting of N nodes, numbered from 0 to N-1. Each Nodes contain one of the ing questions which were common to questions discussed above.

Rest sections were the same as mentioned above.

DE Shaw     

Important Points

• Discipline:                 
• Platform:        Hackerrank        
• Duration: 25+35+35 minutes
• Question type:
• IIT KGP
  

1. Given 3 arrays, count the subsets such that their sum is divisible by 7. solution? (solution: https://ideone.com/edGjJh) What does lets mean? Please clarify the question

2. You are given an array of N integers. Given that you have to pick a non-empty subsequence, what is the probability that you pick a subsequence which has the same value of bitwise and, or and xor?

Solution:

All the numbers in the chosen subsequence should be the same.

Why?

Say, if a= 1100, b=0110  chosen then xor= 1010 or=1110 and=0100, different.

say, if 1110,1110,1110 chosen, xor=1110,or=1110,and=1110

if  1110,1110,1110,1110 chosen, xor=0000,or=1110,and=1110

if, 0000,0000,0000 chosen, xor=0000,or=0000,and=0000

if, 0000,0000,0000,0000 chosen, xor=0000,or=0000,and=0000

Thus, if number chosen are zero then length of subsequence can be odd as well as even,

but if it is non-zero then length must be odd.

So, count the frequency of all elements.

say, cnt0,cnt1,cnt2,cnt3...

res=  (2^(cnt0-1) + 2^(cnt0-1) -1) + 2^(cnt1-1) +2^(cnt2-1)+.......

PS: nc1+nc3+nc5+nc7....= 2^(n-1)

    nc0+nc2+nc4+nc6+...= 2^(n-1)

3. Given a cost for each of the digits from 0 to 9, what is w largest string you can create using exactly K amount?merge s

https://bit.ly/3ueH9os?fbclid=IwAR3Uoc0WtXaxHAk_Lqg2xeEZyTN_-Xq2of7ic0tZuwmPuvqhHjLbNA-xu3k

https://bit.ly/3ueH9os?fbclid=IwAR3Uoc0WtXaxHAk_Lqg2xeEZyTN_-Xq2of7ic0tZuwmPuvqhHjLbNA-xu3k

https://leetcode.com/problems/paint-house-iii/ 

ber

 Important Points

• Discipline:         =
• Platform:                
• Duration:                 
• Question type:

IITH please add questions Company not visited yet

NIT Warangal:6month??->No, this was for FTE

3 questions, 1 hr, Codesignal

1st quest

Please add other Uber questions too @IITH folks++

IIIT Hyderabad :

1. Base 2 to base 6
2. 3.

IITD -

1. base 2 to base6
2. Program to find maximum number of boxes we can fit inside another boxes in python
3. given a string which contains uppercase alphabets and ‘?’, we have to find the number of subsequences ‘AB’ in all of the strings that can be formed by replacing ? with A or B in the original string

Nutanix

Important Points

• Discipline:                 
• Platform: Hackerrank
• Duration: 1.5 hrs
• Question type: 2 Coding Questions

Can someone share their approach for question 1?? GREEDY?

Flipkart

Important Points   FTE??? Please share questions  please update for fte bits guys??

Did everyone receive the same questions on campus?? YES

• Discipline:         
• Platform:
• Duration:
• Question type:

DATA SCIENTIST ROLE (IITK) were there only coding questions for DS

role or it had aptitude as well?? only coding was there

Platform: AMCAT

Time: 90 minutes

Type: 3 Coding Question in Sequential Order - One at a Time

1. Find number of substrings in a string
2. https://leetcode.com/discuss/interview-question/1400533/FLIPKART-or-2022-or-FTE
3. https://discuss.codechef.com/t/need-help-in-a-problem/77896

Flipkart interview questions Please!! (SDE)

Tower Research

Important Points

• Discipline:                 
• Platform:                
• Duration:                 0
• Question type:

1. Gas Station
2. Standard easy leetcode problems
3. Shortlist will probably be based on CGPA.

Western Digital

Important Points

• Discipline:                 
• Platform:                
• Duration:                 
• Question type:

Qualcomm

Important Points      (PLZ ADD CORE TECHNICAL (ECE /EEE)QUESTIONS ASKED)

• Discipline : Electronic and communication        
• Platform:        Hire pro        
• Duration:         2 hrs        
• Question type: aptiElectronic and communication        ion
• Platform:        Hire pro
• Duration:         2 hrs
• Question type: aptitude
• After general aptitude there were 3 options for technical questions

• Computer science
• Digital - flip flops and latches
• Added back the image. Thanks
• Communication

•  Technical interview- memory management, operator like bitwise, struct,pointers in c, preprocessor in c, microcontroller, storage classes in C.

Qualcomm DTU and NIT hamirpur Did qualcomm have coding questions in the test?

  Cisco

Important PointsWhen

• Discipline: IT + ECE and M
• 2. Given an array of N elements.Tech All branch allowed(IIIT-A)
• CGPI>=7(IIIT-A)        when was the test??
• Platform:                Hackerrank
• Duration:         60 mins        
• If you solve 1 coding question correctly and do well in MCQs then you will be shortlisted for sure :)
• There were 15 MCQs.
• Question type:Core question on networks,in interview no coding was asked but grilled on networks questions heap basic operation gfg
• NIT-Calicut when was the test??`
• IIIT Allahabad
• bhai kisiko questions pta h to please add kr do

 is C++ allowed in Coding Round +20 Yes

has Cisco visited any campus recently ??

bhai iska solution bta do n

IIT Guwahati [same in IITK]

1. substring pattern matching
2. cherry pickup

Media.net[Directi]                                    

Important Points clg?

• Discipline:                 
• Platform
• Duration:                 
• Question type:

These are placement questions or internship?? Placements Which institute?Please tell the institute names

ques 1 : Leet code : LRU Cache (implement get & set functions)

ques 2:  Very Tough Problem

solution: https://ideone.com/UHdvqp

question 3: https://www.geeksforgeeks.org/maximum-sum-of-distances-of-a-node-to-ever y-other-node/

someone please add solution for question -3    +1  +1 +1 +1+1 ( https://www.geeksforgeeks.org/minimum-edge-reversals-to-make-a-root/ ) similar approch

question 2 :  

#DONT YOU THINK THIS QUES IS WRONG, HERE IT IS SAYING X IN AN INTEGER WITH NO CONSTRAINTS ON IT , WELL IN THAT CASE THE ANSWER IS ALWAYS -INF……..WHAT THE QUES SHOULD ASK IS SMALLEST +VE X…….ANY VIEWS? There is an constraint indirectly from eqn on x   Can anyone please explain it a bit more because i really couldnt understand it thanks in advance

question 3:

Please read this question. Seems someone deleted it.   bc kisme delete kiya h dal do vrna sara doc delete kr dunga You can get the deleted content from file -> Version History -> See version history . on the right hand side select the version and find the content if relevant add it again

Media.net

                        Platform: Intehr30minrviewBit

                        Duration: 1

      Which institute??

                        Q1: Anagrams of String

                        Q2. Encryption of String

                        Q3. Euclidean DistanceLinks please?

Are these questions for placements? +1 Yes

IITR,IITD

1)https://leetcode.com/discuss/interview-question/1463104/medianet-oa-minimum-cost-to-buy-oranges   Solution please?? hua kisi se??Can someone share some hints/approach please!!!!!!

Plz send correct solution someone??

2)https://www.interviewbit.com/problems/anagram-match/                       // ye bhi solve nhi ho rha interviewbit pr tle aa rha h// Solution please??

  solution: https://ideone.com/C6rQT1 

3)https://leetcode.com/discuss/interview-question/820311/tree-xor-queries      // Question hi smj nhi aa rha koi kuch btao yrr/ solution??give up?yes give up

plz send correct solution someone??

IIT Kanpur Media.net(directi) Placement(14/10)

  Platform: InterviewBit

  Webcam: ON

  Duration: 90 Minutes

  Ques 1.  https://www.interviewbit.com/problems/ways-to-form-max-heap/ 

  Ques 2.  https://leetcode.com/problems/reconstruct-itinerary/

  Ques 3.  https://leetcode.com/discuss/interview-question/820311/tree-xor-queries

IIT Guwahati (Same as IITK)

Webcam: ON

IIT BHU : 

Platform : InterviewBitGiven an array we have to determine the minimum distance between any two consecutive elements after sorting it. Question language was different but we have to calculate the same.

WebCam: ON

Duration: 90 min //

                                        ye problem set dene se acha jhuka lete bhu walo ko

Ques1 : https://leetcode.com/discuss/interview-question/779778/Fruits-on-Tree-Scaler-Hiring-Challenge

Ques2: https://codeforces.com/contest/360/problem/C

Ques3: https://leetcode.com/discuss/interview-question/820311/tree-xor-queries

IIT Delhi :  exactly Same as IITR

ByteDance

Important Points

• Discipline:                 
• Platform:                
• Duration:                 
• Question typ

Swiggy

Are these SDE questions???? YES

Important Points

• Discipline:        Was there resume Shortlisting before test???? NO        is it for full time
• Platform:        Hackerrank        
• Duration:         1:30 hrs        
• Question type: 4 questions: 1 database question + 3 dsa questions

        IITR  (same at IIT Dhanbad)

1. Given an undirected weighted graph, a source node and a destination node.In a path from source to destination let's call the maximum weight present as m. We have to find the minimum value of m among all paths or -1 of no path. solution? Iska solution MST s hoga? anyone can confirm? Fir m destination to source path retrieve kr k maximum edge weight nikal lunga, aisa kooch.
2. Count of distinct substrings of a given string. (please specify string length) ye ques nhi hoga bro….2 ques pe bhi shortlist nikal gya

Questions for Analyst Profile??

JP Morgan  

Important Points

• Discipline:         OTA        (role SDE)
• Platform:                HackerRank
• Duration:                 1 hr
• Question type:        2 coding (40+60 marks)
• Q1: find next permutation of digits of the number  
• Q2: find shortest path between start and end points on a grid with obstacles(here start =0,0 end=n-1,m-1)
• both on gfg.

Morgan Stanley

Important Points

• Discipline:                 
• Platform:        Amcat (chutiya platform)++++++++++++++++++++
• Duration:        
• Question type:

https://leetcode.com/discuss/interview-question/1417818/Morgan-Stanley-OA-SDE-Intern

Please add FTE questions.++++++++++++++++++++++

zeta aai kha kha pe h?

Zeta

Important Points

• Discipline:                 
• Platform:                
• Duration:                 
• Question type:

Trilogy Innovation(CodeNation)  

Important Points

• Discipline: All
• Platform:        Interview bit
• Duration:   ?????????4h
• Question type: 6 coding questions

        IITK,IITR, IITG Placement Test(codcodenation.pdfaegon

 2021):

please share solutions

For Placements(Test date:03/10/2021) IITR :- 

Could anyone solve questions 3,5,6? Please give the soln.

Question 3 Soln:

Numbers distributed in groups and merged in such a way that makes a lexicographically largest array. That means basically the array is sorted in order. Final problem is to find minimum number of swaps to make array into sorted array.

$ This kind of problem can be easily solved using graphs.

$ Make a graph with N nodes and join node i to node j if ith node should be present on jth index

$ This will create several non-intersecting cycles, in which a cycle of 2 nodes will require 1 swap and cycle of 3 nodes will require 2 swaps.

$ Therefore a cycle with n nodes will require n-1 swaps.

$ Find cycles (connected components problem)

$ Find number of nodes in each cycle (traverse in each cycle), say n, then no of swaps in that cycle = n-1

$ find Total swaps

        Intuit( 2 tests, at IIT Kgp )media

Important Points

• Discipline: Plz add discipline  FTE or intern?        
• Duration:                 
• Platform:        Glider(test 1) + Hackerearth(test 2)
• Question type

• Test 1
• Time - 90 minutes
• Questions can be  done in any order and can be visited later.
• Proctoring was done 121 with a chrome extension that records the screen, so if you open anything else you can get into trouble. Camera and mic were turned on.Also strict posture rules, you can’t see outside screen lol !!! WTFF, What if you want to write the example corner cases and check lol

1. There are N rides in an adventure fair. Person can go for the first ride at most N times, second ride at most N-1 times and so on. There's an array of tokens, where token[I] is the number of tokens for i-th ride. You have a total of k tokens. Maximize the number of rides (ining repeated clouds)
2. Given a string, the master string is obtained by repeating the string an infinite number of times. You are given q queries,                 each query having L , R and a character C. Find the number of instances of C in the master string in [L, R]
3. Mirror a binary tree
4. Given an array of passwords, each password is tried out in increasing order of its length, until the correct password is found. If more than 1 password has the same length, then random order among them. Each password takes 1 second to be tried out. After every k failed attempts there's a penalty of 5 seconds. Find the min and max time required to find the correct password (given).(its on codeforces)                                                                                                                    

• Test 2
• Test 2(1 hr)- only for peeps who solved all 4 problems in Test 1, IIT kgp

1. Prefix Sums based problem on STRING
2. Greedy problem on array based on idea of Median, min moves to put all elements  together. ( tricky and hard implementation)

Nvidia

Important Points

• Discipline:                 
• Platform
• Duration:                 
• Question type:

SHortlsting ka criteria pta nhi kya tha...bhot students ko exam nhi dene diye.

CureFit

Important Points ANY college please update test pattern here??it’s a startup bro, visits/allowed very late in IIT’s, other companies are preferred first. 

• Discipline:                 
• Platform:                
• Duration:                 
• Question type:

Please add test questions if visited any college++++IITR?

3 questions in 1 hr

1 EASY

2 hard questions

1 based on dp

1 killer question based on tree dp  

IITG

• Profile: Software Engineer
• Eligibility Criteria : BTech (CSE , MnC , ECE , EEE and other of these branches are also allowed) , CPI>=7.0
• Selection Process:

• 1. Resume Shortlist
• 2. Online Test (60 mins)
• 3. Virtual Interviews

Question1. https://www.geeksforgeeks.org/minimum-number-of-cameras-required-to-monitor-all-nodes-of-a-binary-tree/ 

the root of the tree was not fixed.Also it need not be a binary tree.

  50 marks

Question2.

Finding the Sum of Minimum Absolute Difference of the given Array by removing from front and back , or,

              Find a subarray whose sum has minimum absolute difference with given value.

     Question 3: It was same as this one :           iitd-q1.mp4  Does anyone has solution?????

Fundwave visited anywhere?

Instabase

Important Points

• Discipline:                 
• Platform: hackerrank
• Duration: 90 mins        
• Question type:

IIT Dhanbad and IIT KGP Internship or placement ??

1.Given an array of size n and q queries. Each query contains an integer d.

For each query we need to print whether it is possible to select at most two distinct integers from the array such that the three selected no. forms a valid triangle or not. n<=1e5, q<=2*1e6, d<=1e6

2.Given an array of size n, find  the subsequence is a multiple of m(could be 0 as well) ie abs(A[i]-A[j])=k*m for any two indexes in subseq.

3. Given two strings A and B. Find length of longest palindrome that can be formed using characters from two palindromic substring A and  |A|, |B|<=1e5

NetApp

Important Points

• Discipline:         CSE,ECE
• Platform: talentwork
• Duration: 75min + 30min
• Question type: Coding + MCQ

I have written a very detailed post on Leetcode. Please upvote it!

       https://leetcode.com/discuss/interview-question/1388242/NetApp-MTS-Intern-OA-2021

Disney+Hotstar

Important Points: FTE or 6month?

• Discipline:         CSE ECE EEE MAT        -- IIT(BHU)
• Platform: Hackerrank
• Duration: 1 hour
• Question type: 2 coding from medium to tough and 20 MCQ based on dsa, debugging and logical ability.

1. You have a broken calculator, only the given digits are working, the only operation you can use is multiply and equal. You are given a number, find the minimum number of clicks on the calculator to obtain the given number. ```````````````  Test case <=100 N<=106 . Example: n= 60, working
2. digits are 2,3,4,5 Possible      solutions 3*5*2*2=60, 3*5*4=60 Answer is 6(clicks counted till equal to)
3. Running 1: lk

how to do that broken calculator? r u sure it is 10power(6) or just 10power(4)?

Tip: All debugging mcqs were in java, study java stacks and list. Also see the garbage collector on java. That will be sufficient.

VMware  

Important Points

• Discipline: CS/IT Branches (Btech + Mtech).
• Platform: HirePro
• Duration: 107 minutes
• Question type: MCQ + coding ques (Sectional time limits)
• 1 coding ques(Easy implementation) 30 mins
• 10 aptitude MCQs 15 mins
• 19 technical MCQs(OS, CN, DBMS, DSA) 30 mins
• Coding MCQs (Output type) in two optional languages from C, C++, JAVA, Python. 30 mins.

Please ADD  VMWARE 6month+FT Questions

Please also add 2 months internThere is another doc for internship this is for placements

Please Add Question++++++

PLEASE ADD QUESTIONS

1 coding question in 30 mins (fte) rest were mcqs

IITG

• Profile: Software Developer (Member of Technical Staff)
• Eligibility Criteria:

• BTech: CSE, MnC, ECE, EEE (Students having minor in CSE dept are also eligible)
• MTech: CSE, Data Science
• MSc: MnC

• CPI Cutoff: NA

1 Rippling

 Important Points

• Discipline: CS, MnC, EE ...was Mtech CSE allowed?????No. CLG?
• CPI Cut-off: 0.00 (No CPI cut-off)
• Platform: Hackerrank
• Duration: 3 ques in 1.5 hr
• Question type: 3 ques,one from painter-partition(medium),another from segment tree (medium-hard)and another super easy

First ques was Painter-Partition Problem The painter's partition problem

 Second ques was based on Segment Trees but was passing through brute forces approach too
https://discuss.codingblocks.com/t/proble-asked-in-sabre-campus-hiring-test/108125/7

Third ques was “There are N people standing in queue each of them are either facing left or right .these people can listen to a person if they are facing towards that person, so we need to find a leader among N peo inple to whom most of the people can listen,Our task is to find maximum possible number of people who can listen to their leader.”

Can be done by making two array(namely left and right) of size N,one(namely right) should be filed by traversing from forwards direction and increasing the count whenever we encounter a person in right direction,same applies to another(namely left) array which is traversed from backward and increasing the count whenever we encounter a person standing in left direction. and then finding maximum in left[i]+right[i].

Q1 - https://drive.google.com/file/d/1-Piwr4gM-iC20Q9W5NaT73mFyZ-y3keS/view?usp=sharing  [40 pts]

Q2 - https://drive.google.com/file/d/1xDbjGMVCKkJnQ0Ct8-wfaYEdcYsGhiym/view?usp=sharing [80 pts]

Q3 - https://drive.google.com/file/d/1b4KUE1S1MojrVHubGOc6H_MECfJEHfVE/view?usp=sharing [30 pts]

IITG

• Job Profile: Software Engineer

• Eligibility :

• Bachelors: Only B.Tech CSE, MNC, ECE, EEE
• CPI Cut-off: 6.80 (Company changed cpi cutoff twice, first it was 0 ie no cpi cutoff then changed it to 6.5 and finally to 6.8)

• Selection Process:

• 1. Resume Shortlisting
• 2. Online Technical Test (60 mins Coding Round)
• 3. Video conferencing (Skype Interview)

• Coding Round: Hackerearth, 60 mins, 3 Coding Ques: Easy, Medium, Hard

0

IIIT Hyderabad (28 Nov)

        3 ques , 1hr

1. N containers, each having some litres of water in it. Two arrays(of length N) given:

W : Wi = water (in litres) that is currently in tanker i

C: Ci = Max capacity (in litres) of tanker i

Water from one tanker can be transferred to another tanker.

Determine the min no of tankers that can transport the same volume of water as currently being transported by N tankers.

Sample input

3 -> N

2 2 2 -> W

4 4 4 -> C

Sample output

2

(Sum total of W = 6L. 6L can be transported using 2 tankers of max capacity = 4L)

2. N*M matrix given initialized with values between 1 and 20. From every cell (i,j), you are only allowed to jump either on cell (i+mat[i][j], j) or (i, mat[i][j]+j), with the condition that the jump should be within the matrix (valid). Determine the min no of steps in which one can reach from (1,1) (first cell) to (N,M) (last cell). Matrix is 1 indexed.

Constraints:

1<=N<=1000

1<=M<=1000

Twitter  

 Please update++

Important Points

• Discipline: ALL        
• Platform:                
• Duration:
• Question Type:         aayi nhi agr kisi ke college aye to batana

Udaan

 Important Points

• Discipline: All
• Platform:        HackerEarth
• Duration: [2 hrs 1 question]
• Question Type:         Machine Coding (Please send question if anyone knows)+++++

f

               IITB : Calendar Reservation Application (Hackerearth , 2hrs)

PhonePe

 Important Points

• Discipline:         CS,IT,ECE,EE,CHE,CE,ME
• Platform:                DoSelect
• Duration: [90 mins 4 question]
• Question Type        

1. 1870. Minimum Speed to Arrive on Time
2. https://leetcode.com/problems/swim-in-rising-water/
3. https://leetcode.com/discuss/interview-question/1397739/Amazon-OA-2022-New-Grad (Post says Amazon but this was the exact question that came) (Found the exact question:hef.c https://www.codecom/problems/ENCODING) hard af
4. https://leetcode.com/discuss/interview-question/1397698/Amazon-OA-2022-New-grad

Note: Dont waste ur time ...questions don't repeat in phonepe..try to do 2 questions as questions will be tough. 1 question on discrete binary search is guaranteed

QUESTIONS ARE REPEATED IN MY COLLEGE              

NO Questions were repeated in my college and all questions were hard.

Visa

Important Points

CGPA CUTOFF ?

• Discipline:         CSE ECE EEE MAT
• Platform:                Hackerrank
• Duration:                90 mins
• Question Type:                 

Questions were different for everyone.

I was very lucky to get very easy : Two sum and find maximum in array.

Others got questions like coin change, bfs, longest subsequence which is also a substring, etc.

2 Questions only :

1st question : prefix, suffix of a string (medium).

2nd question: Two sum variations. (easy)

Is it for an intern position? c++

        BITS HYD-

1.https://stackoverflow.com/questions/65662082/cars-and-gaps-in-traffic-hacker-rank

2.https://leetcode.com/discuss/interview-question/850974/hackerrank-online-assessment-roblox-new-grad-how-to-solve-this

3.https://leetcode.com/discuss/interview-question/algorithms/202924/ascend-online-assessment-product-of-palindromes

4.Foorball scores https://github.com/GAGAN2608/HackerRank-Practice

Walmart

Atlassian  

Important Points

• Discipline:         
• Platform:                
• Duration:
• Question Type:         

Is this FTE??? How many questions were there? and how much time was given?+100! yes

4 coding questions in 90 mins        

Please add questions! +20+1+10 +1! 

Paths to a Goal : Hackerrank

 Labs

Important Points:

Which institute?FTE or intern?

• Discipline:         
• Platform:                
• Duration: 45 min - only two coding questions
• Question Type: only 2 coding questions. Everyone has different questions.

Important Points

(College: MNNIT)FTE or intern?

• Open for: Btech,Mtech,MCA        
• Platform:        shl
• Duration: 60 min - only two coding questions
• Question Type: only 2 coding questions.Everyone has different questions.

Please add questions here?? +20+90+++

please add questions ++++91

other colleges please add the questions fast+++++

Please add more questions please Add questions please  fast fast +INF

RAZORPAY

Platform??Hackerearth

    Add MCQ’s please

 ADD QUESTIONS PLSSSSS!! PRODUCT PROFILE

        Please tell me about the resume shortlisting criteria!! Is it strictly for >9.5?It’s 7.5 I think (not sure). Anyone above wrote that it is 9.5 so just confirming!! If u r from IITK, check SPO portal, some shortlist already declared before eligibility extension. Ohh!! Thanks. 

IIT Dhanbad

Important Points: Is the test proctored?  No ,same questions for all appearing.

     3 questions are there or 4?? here 4 are given, that’s why asking

1. Discipline:         IS IT OPEN FOR ALL branches?? YES(IIT Dhanbad )
2. Duration: 1 hr 30 mins
3. Question Type: 15 mcqs and 3 coding questions.

(MCQs were aptitude or CS topics??)

• https://www.hackerearth.com/practice/basvic-programming/implementation/basics-of-implementation/practice-problems/algorithm/milly-and-chocolates-ii-65198198/
• https://ideone.com/sYxln3 What is the exact question here?++10000000 Stated following is the question

•  There are Q queries and a binary tree with N nodes such that level-order traversal numbering will read 1,2,3,...N

• Query type 1: Request Query: need to push the color of the Vth node in the result,c,2*v,n);
•                 color(tree,c,2*v+1,n);t vector
• Query type 2: Update Query: need to update the subtree rooted at V to have Cth(Update Query number) color. Code??

• Given n numbers of students in a classroom each having a couple of pencils, you are to find out how many pencil mountains you can make by collecting all the pencils in the classroom.

• Assume One pencil is a singular unit and cannot be broken into multiple pieces.
• (n<=30)  (eg. n=3, output=5). What is a pencil mountain?(Same as that of a valid bracket sequence, replacing each ‘(‘ with a / and ‘)’ with a \ and after that stacking each consecutive /’s like a big slash line, same for backslash) haan to catalan number hi hua na???

In which college were these 3 questions asked?? IIT Dhanbad

diff questions for diff people?? NO

Please add soln++++++++++

1.  VVEasy don’t remember right now, if someone could add who remembers, that’d be great

     Profile: Software Development Engineer

• Eligibility: BTech (All), MTech (All), MSc (All), MS (All)
• CPI Criteria: greater than or equal to 6.5 
• after shortlist and then test
• chutiya banaya , jisne apply kiya un sabhi ko kar liya shortlist

        IITG Questions?? PLEASE ADD+++++

IITG

1. Find two numbers from their sum and XOR.
2. Given  two arrays of integer select values from A and B of same size.Array A values can be 1 or 2. Array B can take any value. Also given an integer m. We have tom array B such that the sum of selected values must be greater than or equal to m. Let t denote the corresponding values of the array selected in A. we have to minimize the value of t. (Question language was different but we have to do this only)

https://codeforces.com/problemset/problem/1475/D

example:

n = 5,m = 7

A: 2 1 1 2 1

B:5 3 2 1 4

Ans : 2

We can select at index 1 and 4 resulting in 7 which is >= m. Therefore the corresponding sum of values of array A is 1+1 = 2.

3. https://leetcode.com/discuss/interview-question/906248/Interview-Question/768089

IITD Questions??++hua nhi abhi paper IITD me, abhi date bhi nhi ayi h

PLEASE ADD QUESTIONS PLease please koi kardo nit kurukshetra and others please

please add questions

        Bhai kardo koi yar agar kahi aayi ho please +++++++++++++inf

Meesho

Important Points

• Discipline: Open for all         

• Platform:                
• Duration:
• Question Type: Only coding questions , 4 codes                 

 meesho ke coding questions daal do jisne bhi hataye hain ya agar kisi ke pass hain to wo daal do please!

Meesho Test questions 2021 : FTE or intern? Which institute?FTE,IIIT-A

(Please add solution)

Meesho Business Analyst profile questions/pattern/platform anyone?

Google form m hua tha

duration one hour

Important Points

• Discipline:                  

• Platform:                
• Duration:
• Question Type: NIT Jamshedpur guys please add questions                 

MasterCard

Important Points

Discipline:         

• Platform:                
• Duration:
• Question Type:

Please add the questions here??

Adobe(urgent)

Important Points

Discipline:         

• Platform:        HackerRank
• Duration: 2 hrs

Please add the questions here??+inf

Interview Experience:

Round 1:  Heavily based on OOPS and OS (With proper syntax.).

                        What is Object Pool (Similar to the thread pool). Design an interface for it. (It was very subjective, there’s not one correct answer for this. They                         just wanted to see the approach).

                        2 basic coding questions. First, Depth of a tree. Second, Check if 2 strings are anagrams.

Round 2: Two coding questions, two puzzles.

1. Coding Q1. Largest square in a binary n x n matrix (s.t. all 4 corners are 1)
2. Puzzle Q1: A farmer has 3000 bananas and 1 camel and the camel at a time can carry at most 1000 bananas at a time. The Farmer has to take these 3000 bananas 1000 km away. The problem is that the camel eats 1 banana per km and doesn't move without eating bananas. What is the maximum number of bananas he can take to the destination?
3. Coding Q2: https://www.interviewbit.com/problems/word-ladder-i/
4. Puzzle Q2: There's a boy whose school gets overs at 3 PM and his father picks him up at exactly 3 PM daily. They reach home daily at the same time. One day school gets overs at 2 PM and the boy starts walking towards home and father picks him somewhere in the middle and they reached home 18 minutes earlier than usual time. How much time did the boy walked?

Questions in adobe emerge -> this is Q2 -> https://discuss.codechef.com/t/adobe-emerge-test-2021/93858

Q1 was very easy. Don’t remember though

Mathworks

Important Points

• Discipline:                  

• Platform:        Hackerrank
• Duration:1 hour 30 minutes                

CITRIX (fulltime)

Please add questions here please

union find based question or can be done via finding total in each connected component in a graph

dp based questions ---- https://leetcode.com/problems/minimum-sideway-jumps/ (same question but language was different)

Add the clg name where citrix has visited???NIT W

CISCO

Please add kardo 🙏

Which colleges has Cisco visited till now?  is c++ allowed in coding round? No only c/ java/ python

yes c++ is allowed Ek baat batao, Yes or No?

ARISTA NETWORKSa

Please someone add

Makemytrip

 MNNIT, Nit kurushetra guys please add ques

Standard Chartered (BC Behaviour Round mein bahar karte hain logon ko)

Important Points

• Discipline:         All branches allowed

• Platform:                Hackerrank
• Duration:
• Question Type:2 coding questions18085
• // KUCH NAA HONE WALA KISI SE motivate kyu kr rhe ho bhai lol

     Questions kha gye? kon chutiya h ye Aise hi Shortlist ho sakt

e h yeh badwe+1

// Mein add krta hu abhi

• Discipline:         All branches allowed

• Platform:                Hackerrank
• Duration:
• Question Type:2 coding questions18085

1 https://leetcode.com/discuss/interview-question/388512/Hackerrank-Medium-Question-or-Can-you-help-me-solve-this/349708

IITKGP:

Q-1) SOL - https://www.careercup.com/question?id=5647083983863808

Q-2)

SOL -

long biohazard(int n,vector<int> allergic, vector<int> poisonous){

    int dp[n+1];

    vector<int> adj[n+1];

    for(int i=0;i<allergic.size();i++){

        adj[poisonous[i]].push_back(allergic[i]);

        adj[allergic[i]].push_back(poisonous[i]);

    }

    dp[0] =0;

    int max_high =0;

    for(int i=1;i<=n;i++){

        dp[i] = dp[i-1];

        int high =0;

        for(intj=0;j<adj[i].size();j++){

            if(adj[i][j]<i){

                high = max(high ,adj[i][j]);

            }

        }

        max_high = max(max_high.high);

        dp[i]+= (i-max_high);

    }

    return dp[n];

}

IIT (ISM) Dhanbad

1. https://leetcode.com/discuss/interview-question/666317/deshaw-online-assessment-question-bob-navigates-a-maze
2. https://github.com/fadelgaber/mercury-levels

IITG:

Webcam + full screen + microphone on

1. 90 min test 1 ML question -> 30 Min  What was the ML ques like?+++++++
2. 1 Easy Coding Question -> 60 minWas the ques same for everyone?
3. Coding question constarints is too high and give TLECan you give an efficient method then? Anyone who solved this without getting TLE ?++++++

Question:

Which institute? FTE or intern?+1+1++++;

IITG  

• Profile:  TDR Analyst   is this about  standard chartered??yes
• Eligibility Criteria:  All BTech, CPI>=7.0
• Selection Process:

• Psychometric Test (30 mins)Please add ques + pattern++++
• Technical Test (90 mins)  platform: techgig
• Virtual Interviews

                Psychometric Test (30 mins) -> given a situation and options we have to select more or less likely what we do for every option.How many questions in 30 min?? 14; test is not timed it is just behavioral

                Technical Test  -> Coding(60 mins) questions kya the??+++++

ML: https://github.com/abhinav23dixit/Mobile-Price-Classification, https://github.com/Nithya-Vasudevan/Techgig-Hackathon-Clickstream_Analysis

Coding: 

Array Streak:

Ray has bought alexa and is testing the functionality of it. While testing, he came up with an idea to ask alexa N random integers and find the streak array for the same. He has randomly chosen a number K and want to find the streak the elements are increasing by atleast k then the streak will keep on increasing else the streak starts with 1 again.Ray is working fine with the small N values but as the N gets large, he is unable to keep the count. He needs help to maintain the streak aray. Can you help him?

Input Format

The first line of input consists of two space-separated integers N and K.          The second line of input consists of N space-separated integers denoting the array elements.

Output Format:

Print the array which represents the streak array holding above condition

IITR

2 ques (ML + coding); Platform: Hackerrank How can yours be on hacker rank?Patani bhai but hua tha based on shortlist from psychometric test

Questions:

ML: Same as the one asked in Millennium Management

Coding: https://www.geeksforgeeks.org/maximum-size-square-sub-matrix-with-sum-less-than-or-equals-to-k/

PayU Money

Please add questions if payu money visited any campus ? ++

Please upload……? (Jis bande ne ye likha hai wo he daal de ques agr unke campus me aaye ho toh)++

IITK Daaldo ques +1+1

DALLO +1+1+1+1+!+!++!+!!+

Indus Insight(TOUGH HAI KYA QUANT SECTION)??

please add question +1+1

IITD

1 Guesstimate WAS IT SAME FOR EVERYONE??

10 Critical Thinking Questions

10 Numerical Ability and Data interpretation

1hr 30 Mins T

Test. With Camera and mic on.

NVIPANI TECHNOLOGY SOLUTIONS PRIVATE LIMITED

IIT H

Eligibility CGPA???

7.00

There where some aptitude  and technical question each for 20 mins

There were 3 coding questions.

50 mins for coding question

• Print all triplets in sorted array that form AP - GeeksforGeeks 
• https://www.geeksforgeeks.org/print-a-given-matrix-in-spiral-form/ 
• https://www.geeksforgeeks.org/number-subarrays-product-less-k/ 

20 min for aptitude

20 min for technical

CTC :- 11 lakh

DHANI

What is the profile for Dhani ? SDE or ML/AI oriented? SDE

          IIT Kanpur

               1 Question in 50 minutes.

               : Please tell me the modification you did in this solution, they both are very similar in words but asking different things, I don’t think so it’s helpful.

        Did this get accepted?

Approach:

-> make graphs (graph_w(i)) corresponding to every unique weight.

-> find max nodes and corresponding max product for each graph.

(Note: graph_w(i) can be disconnected)

Please tell how you made the PDF, any chrome extension you used, to take the screenshots?

                can someone help me how to take screenshot without getting screen/tab change violation? Anybody knows about this that will it lead to violation??

IIT DELHI

One question in one hour. Simple DP. (Can also be done with greed)  - DOES EVERYBODY HAD SAME QUESTIONS ? YES

       College: IITM

Platform: Hackerrank

Duration: 50 min

Questions: 1 Coding Question

Question: (EXACT SAME QUESTION WAS ASKED IN CITRIX OA) [Please Don’t delete questions!] Yes please

Minimum Sideway Jumps 

You are given an array of size n, and num k, and a team size s, you are to pick s numbers from the array following certain constraints and return their sum,

1. To pick a number from the array, you have to consider the first k  and last k elements from the array, and pick the largest one among them, remove it from the array and continue the process until you pick the team size elements, if you have the same number from first k and last k, pick the one with least index. Finally return the sum of s elements picked.

arr = {18, 5, 11, 9, 7, 12} , s=3, k=2

        5, 11, 9, 7, 12 -> 18

        5, 11, 9, 7 -> 12

        5, 9, 7 -> 11

        return 18+12+11 = 41.        Which institute? IITD: Then what about the question just above this, because someone mentioned there everybody had the same question?(someone clarify)?+1+1

        same code-        https://ideone.com/4uX0kB 

c++ code https://ideone.com/kz9j7x

https://ideone.com/tr9KV1

priority_queue + 2 pointer approach -> https://ideone.com/1pX0C 

 Accepted code ?? how to do it in an optimized way ?? (could someone upload solution using priority queue)

How I’m approaching (Not solved though): I am thinking of creating a list of tuples (element, index). Create a max heap. In it, push k first and k last elements once. Now, a loop of s operations, in which store and delete the head element. Now either we will push the right element(if it's from first k elements) of the deleted element in the heap, or left element (if it's from the last k elements) in the deleted element in heap. But , I’m stuck on how to check which one we will push. Because the index of other elements doesn’t change after deletions. Can someone tell how to go further? :  Instead of storing indexes in tuples, just store if the element is from front or back.

Can we solve this question in O(N*S) Time Complexity? [S can be till N so better to use NlogN approach] store the element in the priority queue with their index. and tak two pointer left and right if the top element is from left then left++ else right --;

was the test proctored?

IITR please add the question or it is same? (yes please)not same Please Add the Questions.+1+1+1+1

IIT R, IIT K, IIT G ,IIT BHU SAME

Hackerrank, 50 mins, 1 question

Webcam: No
Full Screen: No

Microphone: No

Question: Given arrays friends_from, friends_to, friends_weights with friends_weights symbolising the company shared between two workers (workers may work for more than one company). Find the biggest connected group of people in a company and return the product of the biggest two nodes in the group.

Someone please post solution of this  https://www.geeksforgeeks.org/maximum-product-of-a-pair-of-nodes-from-largest-connected-component-in-a-graph/?ref=rp 

(is this pass all test case ?)gfg code sample hi galat output kr raha  Yes this is passing all test cases

• I solved it with DSU. Didn’t get all the test cases right in the test, but it worked later - I guess(I don’t have any way to know.). (Python sol) - https://pastebin.com/x1VxG7Fv (It still won’t work fully.)

 IIT DHANBAD

Hackerrank, 45 mins, 1 question

Webcam: No
Full Screen: No

Microphone: No

Input style: vector<int> cost, vector<int>  u, vector<int> v, int edges_nodes, int k 

2 test dene ke baad hua yeh ……...

EDGE FOCUS:

Which institute? IITD

Each section had a timer.

There were :

1.probability Qs(Expectation and poisson distribution)(medium-hard level)

(MCQs and Subjective(only final numerical value needs to be written in the blank) )

2.Theory MCQs(one section was single correct answer type and the other had multiple-correct answers) on ML(bias-variance tradeoff, Decision tree learning,cross validation)

(Concept lvl-> easy-medium(Not very deep but you need to know a wide range of concepts to answer multi-correct ones).

There was a Coding section where we are supposed to build the model there itself(common syntax for reference was provided but still need to have recent practice to solve them- 2 Qs(60 mins ig) ) [Build the model using Python APIs right? Or we had to write algorithm from scratch? ] - Yeah, we were given libraries, we just had to analyze features/variables

At last there was Devops a single Devops question-something to do with ubuntu commands(I didn’t even understand the Question,lol)

Overall medium-hard lvl.

Tip: practice basic algos like logistic regression and SVMs.

Poisson Qn : lambda for the given distribution of a random variable X=2., there’s another random variable Y=X+1, find E[Y^2] and E[1/Y].

PS:This was for the Quantitative researcher role, I heard that even SDE profile had no DSA coding questions(not sure), SDE guys plz upload Qs/topics covered here.

Chargebee:

Platform : Hackerearth

Some Debugging Questions

2 Programming Questions

IIT BHU:   (open to all , CPI>=6.5)

time:1hr 15min

7 mcq’s(1 aptitude,6 based on output type questions(tough),among them 2 are on pointers)

2 programming questions(logic less,nearly brute force type)(chutiya question a++++++++++++++)

q1)given an array on N numbers,and need to give output how many consecutive sequences are there,these sequences length should be more than 1.and these output sequences should be in the order as they appeared in the array

example:

Input:[1,3,4,5,10,11,1,18,19,5,11,12,13,18,19,3,4,5]

output:

SEQ:3,4,5 OCCURRENCES:2

SEQ:10,11 OCCURRENCES:1

SEQ:11,12,13 OCCURRENCES:1

SEQ:18,19 OCCURRENCES:2

The output should be exactly as shown above

Q2)similarly as above ques with slight modification in output,this time with the same difference(in above ques this difference in +1) between two consecutive elements.  Anyone with an approach??

ex:

Same questions in IIT Madras

Chargebee: 7 MCQs and 2 coding Qs,

1.MCQs were on C pointers , find the error in given code , one aptitude Qn(lvl medium-hard)

2. Coding section was shit ,2 long ass questions with no thinking/logic (Even the constraints were not given. If we think of some approach couldn’t even have an idea if this would give a TLE)

You might need to use data structures like map< vector<int> ,int> or Equivalent DS(for Q1).

the questions were about

(1) finding sequences in a given array of numbers

(2) find all groups of sequences with duplicates and sub-sequences and print them ordered by the size of the sequence.

PS: Total time 75 mins, 6 MCqs- less than 10 points(Total)(Each MCQ would take at least 3-4mins),

      Coding section- first Q-30 points(long ass) ,secondQ-50 pointf

Tips: Don’t waste time on MCQs, try to create classes for the 50 point question(Apparently they suggested this, I didn’t notice).

 Amagi Media Pvt. Ltd.

    (IIT Madras + IITG)

Eligibility : All B.Tech, Dual, M.Tech & M.S.(is webcam there )Yes

(STL Allowed?)

(Upload MCQs also)

2 Coding Questions + 50 MCQ (Aptitude + Verbal Ability + Logical Reasoning + Technical) Apti ques same or different for everyone?Same but order differeent.

IITM

             Amagi IITG - (CPI >= 7)
           Section 1: Aptitude 20Q (30 min)

Section 2: Verbal Ability 10Q (10 min)

Section 3: Technical 20Q (30 min)

Section 4: Coding Round 2Q (50 min)

Questions of coding round
        1. https://leetcode.com/problems/single-number/

        2. https://www.geeksforgeeks.org/lexicographic-permutations-of-string/

IITR: Same pattern as IITG and IITM

MCQs were easy and doable in the time allotted

Coding Questions :(please explain these questions)

MATHWORKS    

QUES PLEASE ADD 

PLEASE ADD ENGINEERING TRACK (CIRCUIT BRANCHES) QUESTIONS

these question are for Intern or placement?

WHICH COLLEGE?

2 coding Question + 41 MCQ

Cherry Pickup

Simple Queries : https://www.geeksforgeeks.org/element-1st-array-count-elements-less-equal-2nd-array/ 

(Is your interview done????)YES // I have my interview next week. Can you please give some tips? Anyhelp is appreciated. Thanks

1st round is group discussion round - some of the topics were (Work from home/ office) (open source vs licenced software)..Try to participate in the gd round as much as possible.. because this is the round where they reject 50% as was the condition in my college.

Attend the ppt and take notes..They will ask you about that.

All other rounds are shit they are just having hr round , managerial round and some OS DBMS OOPS related question.You may or may not expect a DSA question...See gfg it’s the same

Maximum Difference in an array

What was asked in MCQs??? Mostly C/ c++/ Java input output based

From what’s written, I guess above one is for mathworks internships

CITRIX:                

First question was the same as asked in Dhani IITD Which institute? How many questions? Type of questions, time etc ?2 coding and 40 mcqs based mainly on input output and aptitudes and os, dbms, cn time - 2hrs hackerrank

what was second question ?? It was DSU based question

eightfold.ai

IIT KANPUR:

90 min 3 questions

hilabeightfold.pdf     Which platform?? Hackerearth

Q1 ->  (80 marks) https://www.geeksforgeeks.org/minimize-steps-required-to-make-two-values-equal-by-repeated-division-by-any-of-their-prime-factor-which-is-less-than-m/

IIT Bombay:

90 mins 3 questions, no cpi cutoff, same questions for both profiles, platform-Hackerearth, camera was on all the time but no warnings given if you switch tabs.

Q1) In an array need to find 2 numbers whose diff is nearest to a given number. If more than one such pair exists, return the pair whose sum is minimum   Approach -

Q3 -> graph + bfs with last node as source. Isn’t this question asking for the shortest path in a directed graph ?  Yes Exactly https://www.geeksforgeeks.org/shortest-path-for-directed-acyclic-graphs/ I think this is the solution with all the weights equal to 1

Q2 -> min subarray with sum at least K is O(n2) sol accepted?

https://www.geeksforgeeks.org/minimum-length-subarray-sum-greater-given-valueSmallest subarray with sum greater than a given value/ 

worldwas there partial marking? What can be the cutoff(solving all 3?)         

Are these questions same for both the profiles MTS and MTS for Machine Learning Team? Yes Two pointers Is O(NlogN) complexity accepted?

Q2) A knight needs to fight with a queue of people with energy levels H_i and he fights with two people simultaneously. If the length of the array is greater than 2, he spends an energy equal to the max of two elements he fights and if he fights with a single person then corresponding energy is spent. While selecting he selects out of the first two three people in the queue. Find the best way to fight with people such that energy is spent min and worst way such that energy is spent max. Same as du IIT Dhanbad Q.1 If anyone found solution to this problem please share

Q3) In an infinite grid there is a house which is connected to adjacent houses which can be reached by cost 1 and there are N secret connections between houses which cost k.  Given a source and destination find min cost to reach destination. Please make the question clearer or add screenshot++

Please add solutions/approaches, if anyone has.

                IIT BHU:

• //Idea is that find the next permutation for "k" times and then after that swap the
•         //characters untill the original string and permutation
•         //become equal and everytime u swap increment the count and once the strings become
•         //equal return count.
•         '''
•         
•     string res=num;
•     for(int i=0;i<k;i++) next_permutation(num.begin(),num.end());
•     int swap_count=0;
•     for(int i=0;i<res.length();i++){
•         if(res[i]!=num[i]){
•             int start=i+1;   // search from i+1 index
•             while(res[i]!=num[start]) start++;    //find the index to swap
•             while(i!=start){
•                 swap(num[start],num[start-1]);    // swap untill the characters are at same index
•                 start--;
•                 swap_count++;
•             }
•         }
•     }
•     return swap_count;
• }
• };
• 2.Given a grid whose bottom most left coordinate is (x1,y1) and topmost right coordinate as (x2,y2). you are given a circle on this 2d plane of radius “r” and centre (xc,yc). The centre may or may not be inside the grid. Find the total number of points of the grid that lie inside the circle. O(n) was expected). 50 marks
• 3. Given an undirected graph, you are given some nodes who are named master. Initially each node can reach only one special node or none(each connected component has at max one special node). Find the maximum no. of connections that can be made without violating the property(each connected node should have only one special) and the minimum cost of making these connections. Here the cost of making a connection is zero if the connection is between two nodes of the same connected component, else it is equal to the product of the size of the two connected components(obviously after the connection they will become connected). 80 marks

 IITM(Re-test due to Technical issues in the first test):

1. Largest Prime Number possible from a subsequence of a Binary String.
2. 2.Given n strings (only with lowercase alphabet),there are q queries of the form “l r k”, for each query, return the kth character in the string formed by merging strings from l to r and then sorting(in alphabetical order).
3. 3. There are n vertices and n-1 edges(tree-like structure), each have a cost[i], determine the edge for which the difference in sum of costs of vertices present on  either side of the edge is the least.

explanation: If we remove the edge, the whole graph would be split into two connected components, let A be the sum of costs of vertices present in the first component and B for second.Now find the edge for which abs(A-B) is least.

 Millennium Management :

IITK

Role: Quantitative Researcher

Platform: Hackerrank

CPI Based Shortlisting (8+) Open to all ?? or only circuitalOpen to all

Not Proctored, was tab switching allowed????????yes

the questions were easy . the only tough part was I didn't know python.

2 hours, 4 Questions.

1.Stock Maximize (to be done only in Python)

        2.Global_Maximum.cpp:

Question & Solution GFG (https://www.geeksforgeeks.org/maximum-of-minimum-difference-of-all-pairs-from-subsequences-of-given-size/)

3. Multi-label image classification prediction:

Processed images were represented as a vector of 300 attributes, with 294 values between (0,1)  and other values as 0/1 value for each feature. (294 features are input and the rest 6 are output, i.e the values to be predicted)

Testing and training csv files (with each row as vector as described above) were given, we need to submit the csv file of prediction (i.e. whether a certain feature is present or not).

Accuracy metric was used to judge the problem.(what accuracies were you getting?)(one vs all?) .

only test input was given can’t check test accuracy

Was sklearn/any other ML library allowed? sklearn was allowed

Was tensorflow allowed? Nop

4.Missing Stock Prices

No aptitude test?Nope

IITD

Which date did it happen? Don’t remember the exact date. But sometime in September end.

Role: Quantitative Researcher

Platform: Hackerrank

CPI Based Shortlisting (8+)

Not Proctored was tab switching allowed????????Yes

2 hours, 4 Questions

1. Intelligent String

2. P For a given number find the number of permutations divisible by 8:r of permutations which are divisible by 8.(Is it asked Count or just YES/NO) Please clarify Count

3. 6-Class classifier: Data format: [300 attribute, 6 one hot encoded labels], Sample size = 294.

4. Stock Price predictor: Fill the missing values by Time series interpolation.  

IITM

Date: 08/10

Platform: Hackerrank

CGPA Based Shortlisting (8+)

Was tab switching allowed????????

Same Questions as IITK

IITR

Date: 18/10/2021

Platform: Hackerrank

CGPA Based Shortlisting (8+)

Tab switching was allowed

4 Questions 2 hours

1. Stock Maximize (to be done only in Python)
2. Global Maximum (Only CPP and Python)
3. Multi-label image classification prediction
4. Find whether a given number is divisible by 8 or not

GAMESKRAFT

IITR (Same questions are repeated everywhere)

platform: hackerrank

role: Software Engineer

proctored (webcam)

90mins

3 questions

Eligibility for which branches ??

JEE all

1. Unique path in grid ((0,0)->(m-1,n-1)) easy dp

-> Paths to a warehouse (given a matrix of values 1’s and 0’s, find total number of paths from top left to bottom right, 1 being an open gate and 0 being a closed gate. )

2. shared interest (Graph)link :  https://leetcode.com/discuss/interview-question/725801/amazon-shared-interest-problem 

https://codeforces.com/blog/entry/85203 

3. largest sub-grid (Maximum size square Sub-Matrix with sum less than or equals to K) solution on gfg : https://www.geeksforgeeks.org/maximum-size-of-square-such-that-all-submatrices-of-that-size-have-sum-less-than-k/ 

ESTEE

IITD

1 hour time, hackerrank

Can anyone provide a solution, please????) Segment tree ka ques hai

 UIDAI

        IIT BHU

CGPA:0.00 , Open for all branches (btech only), 10th: 75% , 12th: 75%

Uidai has 3 hour long question paper having quantitative    apti, basic data interpretation, logical reasoning, spatial reasoning, 2 debugging section and one coding section

Each section had separate fixed timing

Questions for the coding section were different for different candidates. Barring the coding section, other sections were pretty easy.

My coding questions: uidai questions.pdf

Please give Solution of 1st question in O(q) TC done: https://drive.google.com/file/d/1C2kv-tEYLVpuDXUcU0-CU2yS6zcia0hy/view?usp=sharing

IITG:

Uidai has 3 hour long question paper having quantitative apti, basic data interpretation, logical reasoning, spatial reasoning, 2 debugging section and one coding section

Each section had separate fixed timing

Questions for the coding section were different for different candidates.

One Set:

1. Return all the prime numbers between 2 to N, N<10^9; I tried the sieve method and all test cases ran.
2. Second question was relatively good for everyone. One of them was : Given an array initially , try to make the array palindrome by merging(adding) some consecutive elements inside the array. In this way find a palindromic array of maximum size.

Eg: arr = {15,10,15,37,25,15} -> {15,25,37,25,15}. Size of array <=10^3.

Slice

my c++ code was not working in the actual test just now (which I am sure were correct because i have done those questions before) and there were wrong options in mcqs as well. something is wrong on their end acc. to me.

yes many MCQs had no right options

Their platform tested everything was shit++. Threw me out of test due protocol violations even when I did nothing. C++ code (even cout <<"helloworld";) was not getting compiled. And finally many MCQ didn't have right ans in option

Yeah, the options in MCQs were wrong.

In coding questions the input format was also not specified, it asked to complete the function but code-editor had no function pre-written++

Had the same problems in IITG…..

IITK

Platform: https://quicktest.calyxpod.com  (Shitty platform as mentioned by others)

Questions: 15 Aptitude (MCQ) + 2 Coding question

MCQs :- Even options in some MCQs were wrong.

Coding question:-

1. Super Egg Drop - LeetCode (60 points)

2. https://www.codechef.com/problems/FLIPCOIN/ (30 points WTF)   APPLY MATKARNA BC ISME. CHUTIYA TEST HAI. 

Experience :-

• I was not able to run my code in mock tests as I mentioned above. I mailed the helpline as well. They told me to troubleshoot the network by setting this up :- https://developers.cloudflare.com/1.1.1.1/setting-up-1.1.1.1/windows/. Luckily I was able to run the code in the original test.
• I was trying the second question with segment tree, but my test case was not passing. So I settled with the Bitset method.
• Bad environment, wrong questions, no custom tests, trivial test cases
• A google form has been rolled out (deadline to fill - 10th October 11:59p.m.) for a RETEST for students who faced issue with the test platform

IITK

15 Aptitude (mcq) + 2 coding questions.

Coding questions were:

1. Super Egg Drop - LeetCode

2. Candy - LeetCode

IITB (16/10) APPLY MATKARNA BC ISME. CHUTIYA TEST HAI.

15 Aptitude (mcq) + 2 coding questions.

Coding questions were:

1. Ques. related to priority queue, don’t remember exact ques

2. Candy - LeetCode

IIT BHU

CGPA :7.50 , Opened for MTECH , Department(s) : cse eee ece phy mat(mnc) {resume shortlisting as well(for other departments only)}

17 questions:

15 mcqs: aptitude

2 coding question:

1. A company hierarchy is given with one root (n-ary tree). root knows information. information is needed to be known to all the employees. Time needed to pass the information from parent to its child is 1 hr. Find minimum time so that all the employees(nodes) know the info.

test case:

ip: (all the edges) : https://www.geeksforgeeks.org/minimum-iterations-pass-information-nodes-tree/

SEE THIS SOLUTION - VERY EASY - https://.com/dXhfHu

plz someone give approach to this +1 https://ideoideonene.com/DzbLc7 

            https://onlinegdb.com/Ek9260_rL  // can anyone confirm that this sol is  running?

A,B

A,C

op: 2

SOLUTION - https://ideone.com/dXhfHu(Tested on same input given below)

2. An array with skills is given. make a largest group with a max skill difference of 5.

Input 1:

8

4 6 8 9 10 12 17 24 (not in the sorted order)

Output 1:

4

Input 2:

6

1 2 10 12 15 17 (not in the sorted order)

Output 2:

3

IIT Guwahati

CGPA: 7.00, Open for All B.Tech { Resume Shortlisting }

All coding questions and pattern is same as IIT BHU

15 MCQs: Aptitude, 2 Coding Questions

Q1: Same as IIT BHU

Q2: Same as IIT BHU [Exact same: https://codeforces.com/problemset/problem/1133/C ]

(Q2. Sol, sort the array and find the upper_bound to a_i+5 in the array and maintain max over (upper_bound_index-i))++

IITR

Were the questions in IITR also the same? same

IITB

1.https://leetcode.com/problems/koko-eating-bananas/ (Only wording is different exactly same question)

2.https://leetcode.com/problems/candy/

Anyone know ADLOID questions anyone????how to solve above question? //BURST Ballons Leetcode

ADLOID questions anyone????

Indeed

IITR, IITk Please add questions ++++

Was  the test proctored?Also what was the platform for the test?Not proctored

 Eligibility: CSE or MNC

IITH:

Minimum number of given operations required to convert a permutation into an identity permutation

Count the number of ways to divide N in k groups incrementally

College: IITM

Duration: 1 Hr

Questions: 2 Coding questions

Platform: HackerrankNo proctoring

1. Given a square matrix of size ‘n’,find the max sub matrix size ‘k’ such that the sum of the elements in all subarrays of size

‘k’ is less than a given ‘maxSum’.

https://www.geeksforgeeks.org/maximum-size-square-sub-matrix-with-sum-less-than-or-equals-to-k/

2. Given n students, and you are given two types ond ‘Total’ query, if two mciare given , you should return the sum of the sizes of networks (friends) of the two students.f queries, ‘Friend’ query which requires making two students as friends a

InMobi

IIT DHANBAD ADD QUESTIONS PLZ

IITG

Platform: DoSelect

webcam: No

Time: 1hr 35 min

3 coding questions only

Eligibility: All Btech, CGPA >= 8.0

Coding Questions

1. https://www.geeksforgeeks.org/connect-n-ropes-minimum-cost/ [Input given as string comma separated]

Input 1:

4

8, 2, 4, 3

Output 1:

31

2. https://www.techiedelight.com/find-employees-who-reports-to-manager/
3. https://leetcode.com/problems/cheapest-flights-within-k-stops/
   

IIT R

All coding questions are Same as IITG

IIT BHU Same  

IIT K Same

IITM

CGPA: >= 8

Eligibility: Open to All

Platform: DoSelect

Time: 1.5 hrs

Format: 3 Coding questions only

1. given string with s[i] = ‘F’ indicating “fresh” mango and s[i] = ‘R’ indicating “rotten” mango. In one day, a rotten mango causes any adjacent fresh mangoes to also become rotten. Return number of fresh mangoes remaining after k days
2. There are N employees numbered 1 to N. Given array A of length N. Let A[i] = X (1 - indexed). If X = -1, then i-th employee has no manager. Else employee X is the manager of employee i. An employee A is “senior“ to employee B if:

1. A is the manager of B
2. C is manager of B and A is senior to C

                An employee can have at max one manager. Also, an employee cannot be the manager of themself.

                We need to create a grouping of employees, such that every employee belongs to one group exactly and no member in a group is senior to any other member in the same group. Return the minimum number of groups that satisfy these conditions.

3. Given two strings S and T, with len(S) <= len(T), return minimum substring of S that contains all characters of T. If T contains duplicate characters, all occurences of the duplicate characters should be present in the substring

IIT DHANBAD:Same as IITM 

Achnet

IIT BHU

ii

All MCQ : 3 Sections : OOPS - 7 DSA - 15 Analytics/English/Quant - 28;  Total Time - 60 min.

All questions are of basic level.

If anyone from IIT-BHU knows any other information, please add.  

(bht hi chutiya company hai shortlist sirf circuital ko karegi bhale woh aada test krke aayein)

 Codility