10/22/2015

InterviewExperienceCampus2016

InterviewExperienceCampus2016

Edit

ByNamanJainonThursday,10September2015at15:04

HelloEveryone,pleaseappendyourInterviewExperiencein(Amazon,Kuliza,Grofers,or
anyothercompany)tothisdocfilesothatitcanbeofhelptoothersaswell.
Others,ifyouhaveanydoubtpleasecommentonthefileoraskthepersoninInbox.

NamanJainJIIT(62Sec)Amazon5rounds
OnlineRound:(90Minutes)
1.)20MCQs.
2.)2Codingquestions.PlatformHackerRank.
Maximumofallsubarraysofsizek
E.g.Input:a={1,2,3,1,4,5,2,3,6},k=3
Output3345556
Soln.http://www.geeksforgeeks.org/maximumofallsubarraysofsizek/
Mergetwosortedlinkedlists
E.g.InputL1:5>10>15,L2:2>3>20
OutputL:2>3>5>10>15>20
Soln.http://www.geeksforgeeks.org/mergetwosortedlinkedlists/
30Studentswereshortlistedafterthisround.
4F2FTechnicalInterviewswerescheduledafterthiswhereeachofthemwasan
eliminationround.
TechnicalRound1:(4550Minutes)
GivenanunsortedLinkedlist.ReturnthelinkedlistwherethevalueofKthnodein1st
halfisequaltothedifferenceofthatnodeandKthnodefromthelast.(Includingthe
middleelementifthereareoddnumberofnodes)
E.g.InputL:5>3>4>1>2
OutputL:3>2>0>1>2(52=3,31=2,44=0)
Soln.
Atfirst,IgaveasolutionusingStackwithTimecomplexity:O(N)andSpace
complexity:O(N).
ThenheaskedmetoreducetheSpacecomplexity.Afteraminuteortwo,Isuggested
that:firstwecanfindthemiddleelementinthelinkedlist,reversethe2ndhalf,then
traversebothlist(1sthalfand2ndhalf)subtractingthevalueofKthnodein2ndlinked
listfromthevalueofKthnodein1stlinkedlist(Ifthenumberofnodesisoddmake
themiddleone0)atlastwewillreversethe2ndlinkedlistagainandjoinbothofthem.
Hewassatisfiedwiththeapproachandaskedmetocodeit.Codeditandthenhe
askedmetobreiflyexplaineachpartofthecode.

Simplequestion,GivenaBinaryTree,printthenodeswithvaluegreaterthenallofits
ancestors.
Soln.
Arecursivesolutionwherewepassthemaximumelementtillnowasaparameter.If
thevalueofchildisgreaterthanpreviousmaximumthenprintthenodeandpassthe
newmaximumvalueagaintoitschildren.Askedmetocodeit,codeditandthenhe
checkedthesolutionhimself.

Amessagecontaininglettersfromazisbeingencodedtonumbersusingthe
followingmapping:
'a'>1,'b'>2......'z'>26
Givenanencodedmessagecontainingdigits,determineAllthepossiblestringthatcanbe
formedwhiledecodingit.
Forexample,Givenencodedmessage"12",itcouldbedecodedas"ab"(12)or"l"(12).
Soln.
Afterfewminuteofthinking,IsuggestedhimaDPsolution.Thenheaskedmeto
minimizethespacecomplexityofthesolution,Iproposedasolutionsusingmodified
trieforthat.Heaskedmetomakethattreeforthegiveninput.Afterfewglitchesand
fewmorechangeshewassatisfiedattheend.

https://www.facebook.com/notes/jiitprogramminghub/interviewexperiencecampus2016/982014071820049

1/11

10/22/2015

InterviewExperienceCampus2016

Givena2Dbinarymatrixfilledwith0'sand1's,findthelargestrectanglecontainingall
onesandreturnitsarea.
Soln.
IproposedaO(n^3)DPsolution.Heaskedmetoexplainthesolutionindetail.Then
hewantedmetothinkabetterO(n^2)solution.Itriedforawhilebutcouldntreach
theexactsolution.

TechnicalRound2:(40Minutes)
Thiswasprobablythebestinterviewamongall4.AlthoughiwasaskedjustonenormalDP
question,thebestthingwashowtheIproposed34differentwaystosolveitfrombrute
forcetooptimalsolutionandthewaytheinterviewerwasaskingmetoexploreeachand
everythingabouteachofthesesolutionswithnorushatall.
Question.Maximumsumsuchthatnotwoelementsareadjacent.
E.g.Input:a=[3,2,7,10],Output:13.
SolnandExperience.
AtfirstIproposedbruteforcesolutiontocheckall(2^n)subsets,considereach
subsetwithnoconsecutiveelementandpicktheonehavingmaximumsum.She
askedmetocodeitandaskedmehowitwillwork.Iwasgivenfewtestcasesand
wasaskedtodryrunthemonmycodetoseeifwearegettingrightanswerornot.
Theinterviewerwassatisfiedwiththecodeandaskedmetooptimizeit.ThenItold
herhowwecandividetheproblemintosubproblemswhichwiththehelpof
memoizationwillgiveaDPsolution.Againaftertestingitonfewtestcases,Sheasked
mewhathappensiftherearenegativenumbersaswellinthearray,Igaveher2
moredifferentsolutionsthatwecanhavebymakingsomechangesintheequation
andbasecases.Shesaidmypreviousalgorithmwasgoodenoughfornegative
numbersaswellbutItoldherotherwiseandgaveherthetestcasewherethe
previoussolutionfailed.Shewashappywiththeperformance.

TechnicalRound3:(4045Minutes)
IwasaskedaboutmyinternshipandwassupposetoexplainonemyprojectthatI
mentionedinmyresume.

Giventwostringss,tremovethecharactersfromsthatappearint.
E.g.Input:s=amazon,t=train
Output:s=mzo(aandnarepresentint)
Soln.
Afterexplainingthebruteforce,IproposedasolutionusingHashtable/
unordered_map.Intervieweraskedmetocodeitandexplain.

YouarehavingasetofstringsS1,S2....Sn.Nowyouaregettingastringfromuserat
eachstepletssayT,foreachstringyouhavetoprintallstringsthatarepresentinthe
setandareanagramofT.
E.g.Input:set=[hello,olleh,olle],T1:olleh,T2:elol
Output:T1=[hello,olleh],T2=[olle]
Soln:
Again,firstIsuggestedabruteforcesolution.ThenItoldhimthatwecanmaintaina
hashtable/unordered_maptonoteidsofstringscorrespondingtotheparticularsorted
representationofstring.Andwhenwegetanewstringwecanprintallstrings
correspondingtothesortedrepresentationofthatparticularstringusingHashtable
(Assortedformisenoughtoidentifyif2stringsareanagramornot).Ialsosuggested
himifthestringsaretoobigwecanalsomaintainthecountcorrespondingtoASCII
valuesratherthancomputingtheresortedformeachtime.

WhatisDeadlock?Andhowcanyoupreventit?
TechnicalRound4:(4050Minutes)
GivenaNxM2DarraywhichiscolumnwiseandrowwisesortedinIncreasingorder.
Printalltheelementsinasortedform.
E.g.Input:[{1,3,5}{2,5,6}{3,6,7}]
Output:1,2,3,3,5,5,6,6,7.
Soln.

https://www.facebook.com/notes/jiitprogramminghub/interviewexperiencecampus2016/982014071820049

2/11

10/22/2015

InterviewExperienceCampus2016

Itwasareallyinterestingproblemaftersuggestingbruteforcei.e.tocopyall
elementsinanarrayandsortthem,IsuggestedasolutionusingaMinHeapwitha
fixedsizeofroworcolumn.Iexplainedmyalgorithmafterfiguringoutproperlyhowit
wouldwork.Thenheaskedmetomakeadynamicheapratherthanstaticheapof
fixedsize.Iproposedthatwecanfirstaddasingleelementthatisourfirstelement
andthenwheneachtimegetMiniscalledwewillonlyaddnextprobablecandidateto
theheapwhichwillbetheadjacentelementtothepopedelement.Afterfewmore
discussionwecameupwithafinalsolutionandheaskedmetogivehimanerrorfree
codewithnobugswithallfunctionsincluded(heapify,insert,getMin,sortMatrix).
After1520minutesIgavehimthecode,hepointedouttwobugsbutwassatisfiedas
well.

OverallSuggestions:
BeVocalwiththeinterviewer.Hewantsyoutowalkhimthroughyourthought
process.Tellhimwhatareyouthinkingtooptimizethesolutionandhowyouare
tryingtosolvetheproblem.ForinterviewerJourneyisasimportantasthe
Destinationsometimesevenmore.Butrememberwhateveryouaresayingshould
makesenseforthesolution.
Nevergaveup.Forasecondinmy1strounds3rdsolutionIthoughtthatIscrewed
upbutthenagainIgotbackontothetrack.Onehastokeephiscalmduringinterview
andgetbackontothetrackwheneveryoufeelotherwise.
Keeptalkingtotheinterviewerhewillguideyoutotherightdirection.Ifyouarestuck
somewhereandarehavingproblemfiguringoutsomethingtellhimhemightaswell
tellyoutothinkforanewapproachifyouaregoinginawrongdirection.
PracticeasmuchasyoucandontjustreadCodeit.Forthosewhodonthavea
handonSTL(StandardTemplateLibrary),trytogethandonthemtheyarereally
usefulandimportant.
Dontmemorizesolutions,itwonthelp.Understandthem.Youwontgetexactlythe
samequestion,therewillalwaysbetricksaddedintoitandevenifyoudo,itwouldbe
anightmareforyouinthelongrun.
Forjuniorsifyouhaventstartedwithprogrammingpleasedo.Itsnotanovernight
thingitwilltaketimebutifyougiveitenoughtimeanddedicationendresultswouldbe
"Amazing".
NeithertrytobeoversmartinfrontofInterviewerandnortrytotrickthem,theywill
surelycatchyou.
Andintheend,nothingisimpossibleguyswithabunchofhardworkandabitofluckyou
candoanything.AimBigger.
Result:
SeletectionYes,PositionFTE.

AbhinavFaujdarJIIT(62Sec)Amazon5rounds
OnlineRound:
SameasAbove
Thiswasfollowedby4PersonalInterviewsofaround4045minuteseach.3ofthem
weremostlydatastructuresandalgorithmsbasedandintervieweraskedtowritecode
onpaperfor12problemsandonlyaskedapproachforanother12
problems.AnotherinterviewwasdesignbasedwhichwasmorerelatedtoOperating
Systems.Iwasaskedtowritetheclassdesignfortheproblem.

TechnicalInterview1

1. Givenasinglylinkedlistmodifythefirsthalfofthelinkedlistsuchthatfromthefirst
element,thelastshouldbesubtracted,fromthesecondthesecondlast,andsoon.
Foreg:4>3>2>1shouldbecome3>1>2>1.
Isuggestedthatwereversethelinkedlistfirstandstorethatinanewlinkedlist,then
modifythefirsthalfoftheinitiallist.Hewasnotsatisfiedbecauseoftheextraspace.SoI
suggestedthatwereversethesecondhalfofthegivenlinkedlistinplace.Thenkeeptwo
pointers,oneatbeginningandanotheratmiddle.Modifythefirsthalf,thenreverseback.
Hewasstillnotsatisfiedbecausetimecomplexitywasaround4*O(n),hesaiditwastoo
much.ThenIsuggestedrecursiveapproach.Wepassapointerandsize(2arguments)to
therecursivefunctionwhichsolvestheproblemrecursivelyfor(ptr>next,size2).Hewas
satisfiedandaskedtocode.

2.Findmaximumsizeofrectanglewithall1sinamatrixcontaining1sand0s.This
problemhasanO(n^2)solutionusingstackwhichisthereongeeksforgeeks.

https://www.facebook.com/notes/jiitprogramminghub/interviewexperiencecampus2016/982014071820049

3/11

10/22/2015

InterviewExperienceCampus2016

However,IgaveadifferentsolutionwithtimeO(n^3)whichtomysurprisehewas
satisfiedwithandaskedtocode.
IfirstfixatopandbottomrowandthenforawindowIfindthelargesthorizontalwindow
suchthateachcolumninthewindowhascomplete1swithinthetopandbottomrowthatI
havefixed.ThispartcanbedoneinO(n)with2pointerapproachandsomepre
processing(formaDPsuchthatDP[i][j]denotesthehighestrowuptilwhichthereare1sin
columnibeginningfromrowjandgoingabove.
3.Givenanencodingofnumbers(1>A,2>B.26>Z)andgivenanumber,printallthe
possibleencodings.Isuggestedbacktracking.Heaskedwhatwouldbetheargumentsin
thefunction.Thenheaskedabouttimecomplexity.
IsaidfirstthatitwillbeO(26^n)wherenisthelengthofthenumber.Itisaverylooseupper
boundbutitistechnicallycorrectbythedefinitionofbigO.Buthegaveanexampleto
showthat26^nismuchlargerthantheactualno.ofpossibleencodingsforthatcase.SoI
tooksometimetothinkhowtoanalysecomplexityforrecursion(Icouldntfigureoutfor
sometime).TherecursionwasoftheformT(n)=T(n1)+T(n2)(notexactlybutIconsidered
itanyways).SoIbuildtherecursiontreeandformedaGPsothetotalcomplexitycameof
orderO(n*2^n).Hewassatisfied.

TechnicalInterview2

Thisroundbeganwithanintroduction.HementionedabouthislineofworkatAmazon.I
wasaskedaboutoneofmyprojectsrelatedtovideostreaming.Heaskedonequestionthat
howwouldIhandleasituationwheretheclienthascrashedbutserverisstillworking.
1.GiventwonodesAandBinabinarytree,printallthenodesinthepathfromAtoB.
HeshowedanexamplewhichmisledmeandIendedupgivingawrongsolutionthatfirst
printallnodesfromAtorootthenfromroottoB.
Heshowedanewexamplewherethisfailed.Iquicklyrealisedmymistakeandmodifiedthe
samesolutionwhichItoldbeforewiththechangethatinsteadofgoinguptotherootwe
needtogototheLCAofAandB.
HeaskedfirsttocodeLCAandaskedabouttimecomplexity.Thenheaskedtocodefull
solution.ItwasimportantheretohandlethecasewhereLCAiseitherAorB.Inthatcase
weonlyneedtogofromthebottomnodetothetopnodeonce.Iusedrecursionalongwith
stackstoprintthecompletepath.
2.Givenadictionaryofwords,wheresomewordsmightberepeated.Printallthedistinct
wordsintheorderoftheiroccurrence.Isuggestedhashmapandaqueue.TheHashmap
wouldcontainthecountofalldistinctstrings,andqueuewillmaintaintheorder.Weneedto
pushanewstringtoqueueonlywhenitoccursfirst.Heaskedtooptimizespace.I
suggestedtrieinsteadofhashmap.
FinallyheaskedifIhadanyquestions.Iaskedhimthathowexactlydatastructuresand
algorithmsplayaroleintheworkoftheemployee.Hegaveadetailedanswerabouthow
crucialitistoknowaboutdatastructureswhentheyaredealingwithdataofmillionsof
usersindistributedsystemsasthechoiceofdatastructureimpactseverything.

TechnicalInterview3

IwasgivenoneproblemanddependinguponmyanswersIwasaskedfollowupquestions.
Itwasanopendiscussionsortofroundwherenocodewasasked,onlytheclassdesign.
1.YouhavetodefineaMemoryManagerwhosefunctionistoallocate/deallocate
memorytouser.Suggestthemethods/datastructuresrequiredforthis.
Isuggestedsomedatafieldsforstoringtotalavailablebytes,allocatedbytes,listof
allocatedbytesandonefunctionwhichallocatesanddeallocatesmemorytouser.
2.Discussabouttheimplementationofallocatefunctionanddeallocatefunction.
Isuggestedthatallocatefunctionshouldreturntheaddressoffirstallocatedbyteandwe
shouldmarkalltheallocatedbytes.Freefunctionshouldunmarkallthebytesofthatuser.
3.Ifauserhasapointertohisfirstallocatedbyteptr,thenhowwouldptr++worksincein
mysolutiontheallocatedbyteswerenotnecessarilyadjacent.
Isuggestedthatthereshouldbeanarraynextptr[]whichgivestheaddressofthenextbyte
whichisallocatedtothesameuser.Forptr++towork,the++operatormustbeoverloaded
sothatptr++actuallyusesthenextptr[]arraytomovetothenextbyteofthatuser.
4.IftwouserssimultaneouslytrytoaccessMemoryManager,howwouldthisbe
handled.Itoldthatthereisneedofmutualexclusiontoavoidthistypeofcollisionwhichcan
behandledwithsemaphores.MorediscussiononReadLocks/WriteLocksandvirtual
memory.
TechnicalInterview4

1.Youaregivenadoublylinkedlistwhichisthespiralordertraversalofacomplete
binarytree.Recovertheoriginaltree.Youcanuseextraspacebutyoumustmodifythe

https://www.facebook.com/notes/jiitprogramminghub/interviewexperiencecampus2016/982014071820049

4/11

10/22/2015

InterviewExperienceCampus2016

givendoublylinkedlistintotherequiredtree(i.eusepreviouspointerforleftchildandnext
pointerforrightchild).
Isuggestedthatwestorethelevelordertraversalinavectorsothatallthenodesofthe
samelevelareinthesamerowofthevector.Sinceitsacompletebinarytreewecanstore
thiseasilybyputting1stnodein1stlevel,next2nodesinnextlevel,next4nodesinnext
levelandsoon.Sinceitsthespiralordertraversal,wewouldneedtoreverseevery
alternaterowinthisvector.Oncewehavethisitisveryeasytoupdateleftandrightchild
whiletraversingonelevelandusingthenextlevel.
Thenheaskedtodoitwithouttheextraspace.Itriedtodoititerativelyusingasimilar
approachasabovebuthepointedoutaflaw.IwasstrugglingsohegaveahintafterwhichI
figureditoutandIwasaskedtocode.
2.Givenamatrixsortedrowwiseandcolumnwise,printallthevaluesinsortedorder
withaslessspaceaspossible.IsuggestedtouseaminheapofsizeO(M)whereMisthe
numberofrowsandinsertallthevaluesofthefirstcolumninthisheap(alongwithrow
number).AlsomaintainanarrayofsizeO(M)tostoreuptillwhichindexvaluesfromthat
rowhavebeeninsertedintotheheap.Keeppoppingelementsfromheapandprinting
them.Therowwhichthepoppedelementbelongstoshouldmovetonextindexinthearray
andthatnewelementneedstobepushedtotheheap.
Heaskedtooptimizespacefurther.AfterlotofthinkingItoldthatImnotabletothinkbetter
thanO(M)spacebutabetterapproachwouldbetoonlyputthefirstelementintheheap
initially.Thenforthepoppedelement,pushitsrightandbottomcellintheheap.Worstcase
theheapcanstillgrowtoO(M)size.

SomeTips:
1.Donotrushtogiveanswer.Itsactuallybetterifyouneedtothinkforabitand
formalizesolutioninyourmind.
2.Ifstuck,trytoasksmartquestionssothatinterviewerendsupgivingsomehintinstead
ofsayingthatyoudontknowtheanswer.
3.ForpreparationIsolvedproblemsoninterviewbit.com.Itisanewwebsitejust
launchedfewmonthsbackespeciallyfortechnicalinterviewpreparation.AlsoIwent
throughnumerousproblemsfrominterviewsectionofgeeksforgeeks.Myprevious
Competitivecodingexperiencemadethisprocessveryeasy.

AyushJaggi(JIIT128)Amazon5rounds
OnlineRound:Sameasabove.
TechnicalRound1:(4045minutes)
ThiswasoneofthebestinterviewexperiencesIveeverhad.Iwasthefirstpersontobe
interviewedbyherandItoldherduringtheintroductionthatIamslightlynervousbecauseI
amamongstthefirstlottobeinterviewed.ShewasveryniceandcomfortedmesothatI
couldrelaxandshetoldmethatwearejustgoingtohaveabrainstormingsession.
Crackthegivenpattern:
1
11
21
1211
111221
312211
Soln:Trytothinkityourselffirst.Iwascluelessevenafter57minutes,meanwhileshewas
goingthroughmyresume.IfeltthatImgoingtoscrewthisup.Thensheaskedmetotell
herwhatImthinkingandItoldherthatImtryingtoseeifthereareanymirrorimagesof
anynoornot,andalsothatthelengthsarechangingabruptlyandarenotfollowingany
order.Shegavemeahintandsaidtellmewhatdoyouseeinthisno,justspeakitand
thentrytofollowwhatisthereinthepreviousnoandwhetherIcanseeanyconnectionor
not.Iimmediatelygotthepatternandtoldherthesame.Sheaskedmetocodeitfora
givenn,whereIhavetoprintthefirstnnos.Icodeditandsheaskedmetoexplainitand
thenshefurtheraskedmewhatifItoldyoutouserecursion.ItoldherthatIwillremovethe
stackoftheintegerpairwhichIhaveusedbecauserecursionitselfusesastack.Shethen
askedwhatwillbethebasecasefortherecursiontoendandItoldheruntiltheno
becomes0andshewassatisfied.
Whatislevelordertraversalofatree?Whichdatastructureisused?
http://www.geeksforgeeks.org/levelordertreetraversal/

https://www.facebook.com/notes/jiitprogramminghub/interviewexperiencecampus2016/982014071820049

5/11

10/22/2015

InterviewExperienceCampus2016

Thensheaskedmetoprintanewlineaftereverylevel.Igavehermanysolutionsandshe
wasveryhappywithmyresponses,sheeventoldmethatIhaveexplainedsome
approacheswhichshehasntheardof.StillIwasntquitetheretotheanswerwhichshehad
inmindandtoldmetolookforitaftertheinterview.Instantlyatthatpointtheapproach
clickedtomeandItoldherthesameandshewassatisfied.ThesolutionmustusesO(h)
spacewherehisthenooflevelsinthetree,thoughIhadalreadygivenherasolutionusing
O(1)constantspace.
Projectdiscussionformerely5minutes.
TechnicalRound2:(4045minutes)
Discussionof2projects:Itoldhimeverythingwithalotofenthusiasm,astowhyIdid
thisprojectandhowitwascarriedout.Hethenaskedmeifitwasagroupproject
thenwhatwasyourroleinit.Ihadexplainedhimoneoftheprojectsonpaperandhe
finallyaskedmethenooflinesinthefinalcode.

GiventwostringsAandB,removeallcharactersinAwhicharepresentinB.For
example,A=amazonandB=bangalore,outputshouldbeA=mz.Hesaidtodoallthe
shiftsinplace(inAonly)andnotuseanyextraspace.
Soln:ItoldhimthatwecancreateahashtableofstringBandthenshiftallthecharacters
accordinglyinA.Heaskedhowwillyouperformshiftingandwhatwillbethecomplexity.I
firsttoldhimwecanmarkthecharacterinAwhichisthereinBwithaspecificcharacterof
ourchoiceandthenperformalltheshiftsinO(n).Hesaidwhatifboththestringsconsistof
anyofthe256characters,Itoldhimthenmyapproachwillfail.ThenIgavehimanO(n^2)
solutionforshiftingusingacountervariablewhichcountsthenoofshiftswhichhave
occurreduptotoaspecificcharacterinstringAandheaskedmetocodeit.Whilecodingit
IrealizedthatshiftscanbedoneinO(1)withtheuseofthecounterandweactuallydont
needtodotheshiftingonebyonewhichfinallyreducedthecomplexitytoO(n).Hesaid
goodandwassatisfiedthen.
GivenastringSandalistofstringsL,findalltheanagramsofSinL.
http://www.geeksforgeeks.org/givenasequenceofwordsprintallanagramstogether/
http://www.geeksforgeeks.org/givenasequenceofwordsprintallanagramstogetherset
2/
Soln:ItoldhimtofirstcreateahashtableofallthestringsinLandthenmatchallhash
valuesofallthestringswiththegivenstring.Thenheaskedmewhatpreprocessingcan
youdotofurtheroptimizeit.Hesaidthinkofsortingthestrings.ThenIgavehimthetrie
solutionandtoldhimwhatifIcreateatrieofthehashtableofallthestrings.Hesaidto
drawthestructureofsuchatrieonpaper.Igotstuckbecausethetrieofeachsortedstring
canbecreatedbutnotofthehashtable,becausethenwecanneverbesureofthesizeof
thetrie.SoItoldhimthesamethatnowIveunderstoodaftersortingallthestringswecan
createatriewhichstoresthefrequencyofallanagramsinsteadofmakingthetrieofthe
hashtable.Heagainaskedmetodrawthestructureofthetrieonthepaperandtriedto
confusemebysayingthatwhyareyoudeclaringafixedsizememoryof256ateachlevel,
whynotdeclarememoryasperneedwheneveranewcharacterisrequiredininsertedat
anylevel.Itoldhimthatthentherewillbenopointofusingatriebecausealthoughour
memoryconsumptionwillbedecreasedbyagreatmagnitude,wewillnowhavetorelyon
searchingthecharacterateachlevelandhencethecomplexityforsearchingwontbeO(n)
anymore.Hewassatisfied.
Whatisadeadlockandifdetectedthenhowcanitbebroken?Whatisstackand
heapmemory?IgavehimbasicanswersofwhateverIcouldrecallatthatpointof
time.
IntheendheaskedmeifIhaveanyquestionsandIaskedhimwhetherifthereisabetter
approachthantriesforthe2ndquestion.Hesaidnoyouhavegivengoodapproachesfor
boththeproblemsandthatthereisalwayssometradeoffbetweenmemoryandtime.
TechnicalRound3:(3040minutes)
Theinterviewerwasveryimpressedwithmyresumeandtoldmethatyouhavedonealot
ofcodingonalmostalltheonlinejudges.Hethensaidyouhavealsocodedintheprevious
2roundssoIwontaskyoutowritealotofcodebutjustonequestion.Irequestedhimto
nottoraisehisexpectationsbecauseofmypreviousexposuretoprogrammingtowhichhe
saidnoIwillhavemoreexpectationsfromyou.
FindthelongestpalindromicsubstringinastringS.
http://www.geeksforgeeks.org/longestpalindromesubstringset1/
http://www.geeksforgeeks.org/longestpalindromesubstringset2/

https://www.facebook.com/notes/jiitprogramminghub/interviewexperiencecampus2016/982014071820049

6/11

10/22/2015

InterviewExperienceCampus2016

Soln:IwasawareoftheDPapproachwhichIgavehim.Heaskedabouttimeandspace
complexitiesandaskedcanyoudoanybetter.ItoldhimIcanreducethespacecomplexity
ofthisDPsolutiontoO(n).HesaidcanyoudoitinO(1)space?ItoldhimIcantrytodoit
withhashing.HeaskedmetoexplainmoreandItoldhimthatIcancalculatethehashof
thestringfromlefttorightandrighttoleftaswellinaprefixsummannerandhesaidthis
willalsorequireO(n)spacenomatterhowyoucomparethehashesafterthispoint.ThenI
askedhimtogiveme2minutesIllthinkofsomethingandthenfinallycameupwiththe
approachinthe2ndlinkofconsideringeachelementasthemiddleelementofthe
palindromeandthenexpandingit.MyconfidenceimprovedbecauseIwasntawareofthis
approachbefore.Heaskedmetocodeitandhewentthroughitandwassatisfied.
SomequestionsonOS:Whatisadeadlock?Howtopreventit?(Itoldhimthishas
beenaskedinthepreviousinterview).Howdoesdiskwritingtakeplace?Whatare
schedulingalgorithmsandwhydoweevenneedtheminthefirstplace?Itoldhim
thatIhadstudiedOSalongtimebacksoIlltrytotellwhateverIcanfromwhatIcan
recall.HeseemedtobesatisfiedwithmyanswersbecausethoughIwasnotawareof
theexacttermslikeagingandstarvation,Ihadexplainedthesetermswithoutactually
referringtothem.

LastlyhesaidIllgiveyouaproblemwhichyoudonthavetosolverightnow,justthink
aboutitlaterbecauseitisaverycoolapplicationofcomputerscience.Itwasbasically
thewatertrappingproblem:http://www.geeksforgeeks.org/trappingrainwater/
ItoldhimthatIamawareofthisproblemandhesaidthatthisproblemhasbeentherein
placeswheretherearealotofmountainssince2530yearswheretheamountoffresh
mountainwatercollectedbetweenadjacentmountainrangesisrequiredtobecalculated.
Hesaidthatthisisdiscussedverypopularlythesedayssinceitcanbeeasilyconvertedtoa
computerscienceproblemandhowitcanbeusedtosolveddailylifeproblems.
Overallmyexperiencewasgoodbecausetheinterviewerwasprettycoolaboutvarious
thingsandthewayhewascrossquestioningwasreallyinteresting.Intheendheasked
meifIhaveanyquestionsandIaskedhimabouthisworkatAmazonandwhetherdowe
getanyopportunitiestowriteourownalgorithmsornottowhichhesaidyes.
TechnicalRound4:(60+minutes)
Theexperiencewasamazing,quiteliterally.IfeltthatIhavescrewedthisuptotally,butit
wasntreallyso.ThingsgotalotbettertowardstheendbecauseIhadfinallydeliveredwhat
theinterviewerwasasking.
Somebriefdiscussionof2ofmyprojects.
Thiswastheonlyquestionaskedtomeduringthewholeinterviewbecauseittookme
allthetimetosolveit.Itisntreallyatoughproblem.GivenastringSwhichhasno
spaces,tellwhetheritisavalidsentenceornot.Asentenceisvalidifitismadeupof
validwords,andwhetheraspecificsubstringoftheSisavalidwordornotcanbe
checkedusingafunctionisValidWord(string)whichhasbeenalreadygiventous.
Soln:ItoldhimthatthiscanbesolvedusingDPbecauseIhadsolvedasimilarproblemon
TopCoderonce:http://community.topcoder.com/stat?c=problem_statement&pm=12155
TheproblemisnotsamebuttheDPapproachesaresimilar.
Thisisalsocalledthewordbreakproblem:
http://www.geeksforgeeks.org/dynamicprogrammingset32wordbreakproblem/
http://www.programcreek.com/2012/12/leetcodesolutionwordbreak/
Nowcomesthetwist:hedidnotactuallywanttheDPsolution,andwhenIgavehimthe
JIITProgrammingHub
Mayank
Home 20+
Searchforpeople,placesandthings
approachhesaidwhyareyoucomplicatingit.Iwasalittleshockedastowhyhesaidthat,
hesaiddontthinkofDPandheretooyouaremakingalotcomparisonsbutIneedabasic
YOURGAMES
MORE
solution.Ididnotreallyunderstandwhathemeantbybasic,thenhesaiditinvolvesno
specialdatastructureornospecificknowledge.Heaskedmetodrawarecurrencerelation
DocsinJIITProgrammingHub
andwebrainstormedalot.WebothevenstartedlaughingwhenItoldhimhandsdownthat
IamunabletowritethesimplerapproachtothisproblembutIcanwritethebetterDP
RECOMMENDEDGAMES
MORE
RECENTCHANGES
solution.Weactuallydidhaveagoodlaughatthisforsometimewherehesaidthateven
havingpriorexperiencemightgoagainstyouifyouaredirectlyreachingtheoptimal
RajatGupta
Updatedaboutamonthago
approach.Hethenfinallygavemeahintthatitisveryinefficientandthatthecomplexityis
NamanJain
exponentialandrecursionisrequired.IfirsthadthoughtofthisbutIdontknowwhyI
Updatedaboutamonthago
discardedtheideabecauseIfeltthatthisisnotwhatheisasking.Ithenagainstarted
NamanJain
laughingandtoldhimItotallygotitnowandthencodedit.FirstIcodeditinanotsogood
Updatedaboutamonthago
waybecauseIhadeveneliminatedtheforloopinrecursionforwhichIwaspassingan
AmolSaxena
extraargumentwhichhepointedout,butthenIrectifieditlaterandwroteafreshcode.He
Updatedaboutamonthago
wassatisfiedbuthesaidittookyousolongtogettothebruteforcesolutionwhichIhave
AmolSaxena
beenaskingallthistime.
Updatedaboutamonthago
InbetweenwhenIwassolvingtheabovequestion,hehadalotoftimewhileIwasthinking
sohewentthroughmycompleteresumeproperly.Lastly,heaskedmeifyouhaveany

AmolSaxena
Updatedaboutamonthago

https://www.facebook.com/notes/jiitprogramminghub/interviewexperiencecampus2016/982014071820049

7/11

10/22/2015

InterviewExperienceCampus2016

questionsthenaskthem.Iaskedbasicquestionsaboutvarioustechnicaldepartmentsat
DujenderYadavlikes
Amazon.IdidtellhimthatthiswasagreatinterviewexperienceformeandthatIamnever
KapilSharmaJOKES's
post.
goingtoforgetthefinalroundandagainwelaughedoffforaminuteandthatwasit.
Suggestions:

RaghavAgarwallikes
ParasChugh'sphoto.

PEOPLEYOUMAYKNOW

SeeAll

VivekYadav
1mutualfriend
AddFriend

1. ThisisusuallyamisconceptionthatyoucancrackAmazonbyjustpreparingfrom
NishantBatralikes
RajnikantV/sCIDJokes's
GFGinthelastweekorso.Trustme,themoreexperienceofprogrammingyouhave,
photo.
thebetteritis.ThekindofonthespotinstinctsIgotinmyaboveinterview
experiencesisonlybecauseofmypreviousexposuretocompetitiveprogramming.It
PriBhrtlikes
isthenonlywhenyoucancomeupwithalotofapproachesandgetwellversedwith
ManishJakhar
thetimecomplexities.IstartedreadingGFG12daysbeforethetestandbeforethatI
hadpracticedforsometimeonInterviewbitsothatIcouldgetacquaintedwiththeuse
MohitSharma
ofpointersagain.
2. Ifyouareveryconfidentaboutyourapproach,juststicktoitbecausetheinterviewer
AdityaYadav
maytrytoconfuseyou.
3. Takeyourtimetothinkaboutthevariousapproaches.Themoreclearyouare,the
TussharSingh
betteritwouldbeduringthediscussionandcodingphase.
KamalYadav
4. Bugfreecodeswithgoodvariablenamesareexpectedinalltherounds.
5. Practicepracticeandpractice.Therearenoshortcutstosuccess.Themore
RahulGandhi
experienceofparticipatinginprogrammingcontestsyouhave,themoreeasierit
wouldbeforyoutowritecleancodes(andthattoofast)duringtheinterview.Thatwill
ManishMalik
6h
beallfrommyside.Goodluck:)
MOREFRIENDS(19)

Result
Selected:Yes
Position:FTE

AkashGupta

Search

PranikaJainAmazon3rounds
OnlineRound:Sameasabove.
TechnicalRound1:(4045minutes)

Theinterviewstartedwithdescriptionofoneofmyfavouriteprojects.Idiscussedaboutall
thefeaturesofmyproject.Andtheheaskedmeaboutoneofthechallengingtaskwhichi
facedduringtheproject.\Thenheaskedmetwocodingproblemsasfollows:1.Giventwo
strings,string1andstring2,eliminateoccurrencesofcharactersofstring2instring1.The
countofcharactersshouldbetakenintoconsideration.Also,theorderofthecharactersof
outputstringshouldbsameasinputstring.ForExample,string1="amazon"and
strinng2="bangalore"Thenexpectedoutputis:string1="mz"ForExample,string1="hello",
string2="life"Theexpectedoutputis:string1="hlo"2.Givenalargefilecontainingmillionsof
strings.Givenanotherseriesofstringsonebyone,saystring1,findallanagramsofstring1
inthedocument.example:document="abcd,abdc,efgh,abd,ghfe,acdb"string1="abcd"
output="abcd,abdc,acdb"string1="adb"output="abd"Thenheaskedmequestionsfrom
OperatingSystems:3.WhatisDeadlock?DeadlockDetectionDeadlockPreventionTechnical
Round2:(4045minutes)Hedirectlyjumpedtoquestions:1.Givenanarrayarray1ofsize
M+NinwhichfirstMindexesareoccupiedwithsortedintegersandanotherarrayarray2of
sizeN,alsocontaingintegersinsortedorder,thetaskwastomergethetwoarrays.Iwas
supposedtowriteerrorfreecode.ForExample,array1={1,3,5,6,15,_,_,_}andarray2=
{2,8,10}ExpectedOutputisarray1={1,2,3,5,6,8,10,15}2.GivenaBinaryTree,find
MaximumSumSubtree.Iwassupposedtowriteerrorfreecode.Thenheaskedmeabout
thecomplexityoftheproposedalgorithm.
Result
Selected:Yes
Position:Intern

RajatGuptaAmazon3Rounds
OnlineRoundSameasabove
Theinterviewwasfollowedby2technicalrounds,theinterviewerexpectsyoutowriteerror
freecodeofeachquestiongiventoyou.
TechnicalRound1:(7080minutes)
AtfirstheaskedbrieflyabouttheworkIhaddoneinmyinternship,thenhedirectly

https://www.facebook.com/notes/jiitprogramminghub/interviewexperiencecampus2016/982014071820049

8/11

10/22/2015

InterviewExperienceCampus2016

jumpedtothefollowingquestions.
1)1stQuestion:
Writeafunctiontoprintspiralordertraversalofatree.
solution:Atfirstigavehimabruteforcesolutioni.eo(n^2)forskewedtrees,hetoldmeto
optimizethesolutiontoo(n).ifinallygavehimao(n)solutionusing2stacks,thenhetold
metowritetheerrorfreecodeonapaper.http://www.geeksforgeeks.org/levelorder
traversalinspiralform/
2)2ndQuestion:
Printallelementsinsortedorderfromrowandcolumnwisesortedmatrix.
solution.Thisquesitontookmostofthetimeinthisround.Atfirstigavehimao(n^3)
solution,hetoldmethatthesolutionigavehimwouldnotworkforduplicateelements,
thenhegavemealotoftimetothink,around1520minutes,andtheniapproachedthe
solution.usingminheap,hetoldmetoexplaintheapproachbytakinganexample,hewas
satisfiedwithmylogicandtoldmetowritetheerrorfreecode.
http://www.geeksforgeeks.org/printelementssortedorderrowcolumnwisesortedmatrix/
TechnicalRound2(50minutes60minutes)

Thisroundconsistedof3technicalquestionsbasedondatastructureand
algorithms
1)1stQuestion:Givenanarray,printtheNextGreaterElement(NGE)forevery
element.TheNextgreaterElementforanelementxisthefirstgreaterelementonthe
rightsideofxinarray.Elementsforwhichnogreaterelementexist,considernext
greaterelementas1.

Fortheinputarray[13,7,6,12},thenextgreaterelementsforeachelementareasfollows.
ElementNGE13>17>126>1212>1
http://www.geeksforgeeks.org/nextgreaterelement/

Atfirstigavehimao(n)soluionwhichworkedonfirstinputhegavetome,buthecaught
thefaultinmylogicandchangedtheinputarray,andtoldmetothinkagain,andthen
finallyitoldhimthecorrectsolutionusingstacks.hetoldmetocodethequestionerrorfree.

2)2ndQuestion:givenabinarytreeprintthetreeinananticlockwiseordersuch
that,firstalltheleftnodesareprinted(topdown)thenleftleaves,thenrightleaves
andthenalltherightnodes(bottomup).
solution:Atfirstigavehimao(3n)solutioni.eIwastraversingthetree3timesinorderto
printthenodesingivenorder.hetoldmetominimizethesolutionto0(n)i.eusingsingle
traversal.Afterthinkingaboutit,ifinallyarrivedtothesolution.atfirsthewasnotconvinced
tothesolutionigave.heranmylogiconthegiveninput.itworkedfine.andthentook
anotherexampleheagainranmylogic.itworkedfine:)andfinallyhewasconvincedand
happytothesolutioniprovided.thenhetoldmetowritethecode.
http://www.geeksforgeeks.org/boundarytraversalofbinarytree/
3)Givenanencodingofnumbers(1>A,2>B.26>Z)andgivenanumber,printall
thepossibleencodings.Isuggestedbacktracking.Heaskedwhatwouldbethe
argumentsinthefunction.Thenheaskedabouttimecomplexity.
solution.AtfirstigavehimaDPsolutiontocountthenumberofdecodings,thenhetold
metoprintallthedecodings.afterthinkingsomuch,hegavemeahinttouseoneofthe
datastructures.atfirstigavehimasolutionusingstack,butitwasnottheoptimized
solutionheexpected,hetoldmetodrawatreeoftheinputgiven.again,ifailedtoanswer
thisquestion,atendhetoldmethatitwasagoodtryasthequestionwasnoteasy.
http://www.geeksforgeeks.org/findallpossibleinterpretations/.

Sometips:
1)ifuhaveseentheproblempreviouslydonotdirectlyrushtotheoptimizedsolution,at
firstalwaysgivethebruteforcesolutionandthenmovetowardstheoptimizedsolution.
2)interviewersarereallyhelpfultheywillalwayshelpyouwiththehints.youhavetocatch
thehintfortheoptimizedsolution.
3)foronlineroundeachsectioncodingaswellasMcqsbothareequallyimportant,i.e
equalweightage.

https://www.facebook.com/notes/jiitprogramminghub/interviewexperiencecampus2016/982014071820049

9/11

10/22/2015

InterviewExperienceCampus2016

4)Foronlinecodingroundwww.leetcode.comorwww.interviewbit.combothareequally
goodasboththeseresourcescontainsamesetofquestionbanks,ipracticedon
www.leetcode.com
.ForMcqspracticefromgeeksforgeeeks,geeksquizsection.itwasreallyhelpfultome:)

Result:
Selectedyes
positionintern

AmolSaxenaJIIT(62Sec)
Amazon4rounds
Resultselectedasanintern.
1stround:onlineround(90minutes)
Detailsgivenabove
Tips
1)Beinregulartouchwithcoding.Thecodingquestionswereeasybutwithlimitedtime.So
dopracticeshortcontestsandparticipateinexecutes(collegeevent).
2)codedatastructuresquestionsfromgeeksforgeeks.
3)Don'tneglectMcq'sorcodingquestionscompletely.Bothsectionsareequallyimportant
andneededtobeattemptedequally.
4)Aperfectstrategywouldbetoattemptfirsttheeasiercodingquestionandthenattempt
10mcq's.Thenmovetothe2ndcodingquestionandthenattempttherestmcq's.

2ndround:TechnicalInterview(4045minutes)
Oksotheinterviewstartedwithdiscussionandfeedbackof"onlineround".Itoldhimthat
itwaseasycomparedtootheramazon'sonlinerounds,buttheoverallpaperwasgoodand
timetaking.Thenheaskedme"tellmeaboutyourself".Itoldhimthewellprepared
answer,thenheaskedmeaboutmyprojects.Itoldhimaboutmyminorprojectandmyrole
init.Ialsotoldhimaboutmyfirstyearprojectthathowamusingiusetofinditinfirstyear,
butnowiknowitwasaveryeasyproject.Hesaidthatitalwaysstartsthiswayonly.Then
hecametothetechnicalquestion.
Q1)Youareanappdeveloperandyouhavetodesignanappwhichdownloads
videosfromyoutube,buttheinternetconnectionforwhichyouaredevelopingthe
app,keepsondisconnecting.Soyouhavedifferentchunksofdownloadedvideo
andyouneedtotellwhetheryouhavedowloadedthevideofullyifnotthenreturn
thelargestchunk.
WhentheinterviewerstartedthequestionIwaslikeseriouslyareyougoingtoaskmeto
designanapp.Butgraduallywhenhecompletedthequestion,itgotsimpler.(Sonever
panichearingthefirstlineofquestion:P)Sobasicallysomeintervalsweregiven(start
timeandendtime)andIhadtotellthatwhetherthevideowascompleteandifnotthen
returnthelargestinterval(someintervalswereoverlapping).Itoldhimmyalgorithmand
thenwediscusseditfor5mins,afterthathesaidthatIhavenowenoughideaaboutalgoso
heaskedmetocode.
Hegavemeaprecodewithastructurelike
structvideo
{
intstartTime
intendTime}
Ihadtowriteafunctionwhereastructurearrayispassed.Hesaidthatthecodeshouldbe
bugfree.Iwrotemycodeandthenhereviewedit,hewassatisfied.
3rdround:TechnicalInterview(4045minutes)
Thisinterviewwastakenbyama'am.Sofirstshemademefeelcomfortableand
straightawaymovedtothefirstquestion.
Q1)Designcodeforstrstr()function.
Asihadnoideaaboutthefunction,soiaskedherthedetailsoffunction.Ifounditvery
simpletocodesoicodedeasily.Thenshestartedanalysingthecodeforvariouskindof
casesandconstantlyaskedhowiwouldhandlethosecases,imade12minutechangesin
mycode.Iwasliterallyamazedbytheattentiongivenbyhertoevensmalldetailsofcode
andthisdiscussiontookabout20min.thensheaskedmetotellallthetestcasesiwould
usetotestsuchcode,ItoldheralltypesofcornercasesIcouldthinkoff(thanksto
Codechefpractice).
Q2)Designacodetofindsqrt(n),withoutanymathematicalfunction.
Iaskedwhatifnisnotaperfectsquare,shesaidtoreturn1inthatcase.Sheaskedme
whatiwasthinking,soIstraightawaygaveherthesimplestapproachIcouldthinkoff.She
askedforitscomplexity,Itwasroot(n).Shewasnotsatisfiedsoaskedtooptimiseit.While
thinking,IwroteLogn,onpaper,butthinkingitsamathfunction,imovedon.Butonseeing
Logn,sheaskedmetofocusonthat,thenafterthinkingfor1minute,solutionstrikedandi
gaveherthealgo,shewassatisfied.
4thround:TechnicalInterview(3540minutes)

https://www.facebook.com/notes/jiitprogramminghub/interviewexperiencecampus2016/982014071820049

10/11

10/22/2015

InterviewExperienceCampus2016

theinterviewerwascoolandandaskedmetotakethisinterviewasdiscussion.The
discussionstartedaboutthepresentationgivenbyamazonduringmorningsession.Itold
himthatitwasdullandnotinterestingcomparedtoothercompaniesthathavevisitedthe
campus.HewasimpressedbymyfeedbackandaskedmetotellthistoHRmanager.he
alsosaidthatinterviewisatwowayprocessandevenacandidatecanjudgecompanyand
givefeedback.Discussionwentaroundfor510min.
Q1)Givenanarrayofintegers,whereinitiallytheintegersareincreasingandthen
fromapointstarteddecreasing.Findthepeak.
Igavethealgowithin2minutes.Hewassatisfiedandaskedmetocodeit.Igavehimthe
codehewassatisfied.
Q2)Howwouldyouimplementautocompletelikeingoogle.
Igavehimanapproachusingtries.Ididnothavecompleteideaabouttriesanditoldhim
that,yetheinsistedtothinkaboutD.Sandalgotoimplementit.Itoldhimmysolution,AsI
wasnotconfidentaboutmysolution,Iexpectedsomehintormodificationfromhissidebut
tomysurprisehejustmovedonandtoldmethatthiswasaprojectwhichhegavetohis
internandtook2monthstocomplete.hesaidthathewantedtogivemeanideathatwhat
kindofprojectstheydo.atlast,hewasdone.soIaskedhimsomequestionsaboutwhat
kindofworkinternsdoandwhatdocompanyexpectfromthem.Inbetweenbymistakehe
saidtomethatyouwillrealise,whenyouwillbeatamazon,SoIexpectedselection.
Interviewtips:
1)Alwaysbeconfident,cheerfulandhavepositivebodylanguage.
2)Showinterstincompanyandjobbyaskingquestions
3)Ifnervous,askforwaterandtakeadeepbreath.
4)Understandthequestionclearlyandifdoubtthenaskquestions.
5)practicewritingcodeonpaper,(butfirstcodeoncompiler).
6)Donothurryandalwaysfirstgivenaiveapproachandthentrytooptimisethesolution,so
evenifyoucantreachtheoptimalsolutionthentootheinterviewermightlikeyourapproach
towardsthequestion.
7)PrepareanhonestCV.Ifyouarenotconfidentaboutanythingdontincludeitbeityour
internshiporanyproject.
8)Justifyyoumistakes.
Preparationtips:
1)docompetitivecodingregularly.
2)Refergeeksforgeeksforquestionsanddon'tcramthesolution,itwon'thelp.
3)solvepuzzles.

Like

Comment

SahilDuaand146otherslikethis.
NamanJainAbhinavFauzdarAyushJaggiAyushJaggiShubhamGuptaRajatGupta
SonakshiMehraDhruvSinghPranikaJainSumitGulatiPranavAgarwalGautamAnghore
AmolSaxenaandeveryoneelsepleaseshareyourexperienceaswell!
LikeReply 1010Septemberat15:14
KartikSharmaThankyousomuchforsharing!Thishelpsmealotinplanningwhatishould
focuson!
LikeReply10Septemberat17:55
AyushJaggiaddedmyamazoninterviewexperience.kulizaandgrofersexperiencetobe
addedsoon.
LikeReply 810Septemberat19:52
View1morereply
AyushJaggihahaha.absolutelyitwas.
wohdinnahibhoolsaktamain.
LikeReply 110Septemberat20:45Edited
PandeyShivamthankuuusirrrr....
LikeReply10Septemberat20:46
PrakharBrijendraAyushjaggisiryoushouldhavecheckedoutoursdf1styeartutorialyour
firsttechnicalquestionwehavesolveditoutintheclass............
LikeReply13Septemberat02:15
Writeacomment...

About

CreateAdvert

CreatePage

Developers

Careers

Privacy

Cookies

AdChoices

Terms

Help

Facebook2015

English(UK)

https://www.facebook.com/notes/jiitprogramminghub/interviewexperiencecampus2016/982014071820049

11/11