Imputtingmydetailedinterviewexperienceshereandalsoafewtipstohelppreparefor

interviews.
1.Amazonround1:
1.DesignthemostoptimaldatastructuresforanLRUcache.
2.Convertasortedarraytobalancedbinarysearchtree.
3.Reverseasinglylinkedlistingroupsofkinplace.
4.Designthemostoptimaldatastructureforstoringawordanditsmeaning.Notethataword
couldhavemultiplemeanings.
2.Amazonround2:
1.Writearecursiveroutinetocalculatea^n.
2.Designthemostoptimaldatastructureforaneverendingstreamofnumbers.Itshouldbe
optimizedforinsertion,deletion,searching,findingkthlargestandkthsmallest.
3.Akamairound1:
1.Programtoswapkthandkthtolastelementofasinglylinkedlistinonepass.Youarenot
giventhelengthofthelinkedlistbeforehand.
2.Programtoreversetheorderingofwordsinasentence.
3.ProgramtofindtheintersectionpointoftwosinglylinkedlistsinO(n).
4.Programtoreverseasinglylinkedlistbothrecursivelyanditeratively.
5.Thereare12ballswhichareidenticalinsizeandappearancebutoneisanoddweight(could
belightorheavy).Finditinminimumnumberofweighingsusingabalance.
4.Akamairound2:
1.Programtoreverseasinglylinkedlistingroupsofkrecursively.
2.Programtofindthelengthofthelongestsubstringwithoutrepeatingcharactersinastring.
3.Youaregiventwocubes.Representthedateofamonth(0131)usingboththecubesby
placingnumbersonthegivencubes.
4.Givenanarraycontainingrepeatedcharacters,findthecharacterrepeatedmostnumberof
times.
5.Akamairound3
1.TracetheoutputofaC/C++codesnippetcontainingextensivepointersandreferences.
2.Explainsegmentationfault.
3.ExplainBFSandDFS.
4.WhichtraversalwouldIpreferforfindingacycleinagraph?
5.Explaintimeandspacecomplexitiesofhashmap.
6.Designtheunderlyingdatastructurebehindaloginpage.
6.D.EShawround1
1.GivethefullformofBIOS.
2.MentionanyfiveoperatingsystemswhichhavebeenderivedfromUNIX.
3.DifferentiatebetweenHTTPandHTTPS.
4.Mentionanyfivefilecompressionextensions.
5.ExplainindexingmechanisminDBMS.
6.Givearealworldapplicationoflinkedlists.
7.Whatisatorrent?Whatareseedersandleechers?
8.WhatisP2Pnetwork?
9.HowwouldIdefendmyselfifIweretogetcaughtforhavingdownloadedtorrents?
10.ThrowsomelightonwhatishappeninginsideLargeHadronColliderinCERN.
11.WhatdoIknowaboutHiggsboson?
12.DifferentiatebetweenLED,LCD,andPlasmaTV.
7.Microsoftround1
1.Giventwosortedarrays,sayAandB,findAB.Here,ABmeansallthoseelements
presentinAbutnotinB.TheexpectedtimecomplexitywasO(m+n),ifAisofsizemandBis
ofsizen.
8.Microsoftround2
1.Writearoutinetooutputtheelementsoftheinordertraversalofabinarytreeonebyoneinits
eachcall.
eg:Assumingtheinordertraversalis1,2,3,4,5,theroutineshouldreturn1initsfirstcall,2in
itssecondcallandsoon.
2.Givenasetofcoursesalongwiththeprerequisitecoursesforthesecourses,writeaprogram
tofindtheminimumnumberofsemestersrequiredtowrapupallthecourses.
9.Ciscoround1
1.HowmanyinterviewshaveIattendedbefore?
2.WhatvaluewouldIaddtoCisco?
3.WhatdoIknowaboutCisco?
4.AmIreadytoworkasanITmanager?
5.MentionthelayersinOSIstack.
6.WhenwouldIgoforaroutertomaketwocomputerscommunicate?
7.MentionthenumberofbitsinIPv4andIPv6addresses.
8.WhatistheneedforIPv6?
9.Howmanyclientsarepossiblefora/24address?.Whatisthenetworkaddressand
broadcastaddresshere?
10.Whatisthedifferencebetweenanycast,unicast,andmulticast?
12.Whatisvirtualmemory?Whatisitssizeinrelationtomainmemory?
11.HowdoIratemyselfinC,webtechnologiesonascaleof10?
12.Whataremystrengths?
13.Theclassical3l,5lpuzzle.
10.Netappround1
1.GiveafewtechnicaldifferencesbetweenWindowsandUNIX.
2.GiveafewdifferencesbetweenNTFSandFAT.
3.MentionthelayersinOSIstack.
4.ExplainindetailtheconceptofNATandDHCP.
5.Whatisthedifferencebetweenhub,switch,androuter?
6.Whatiscollisiondomain?Howdoesbridgesegregatecollisiondomains?
7.Givenaroutinewhichsortsonlypositivenumbers,writeawrapperaroundittosortboth
positiveandnegativenumbers.
8.Suggestasuitablecombinationofarrayandhashmaptodesigntheunderlyingdatastructures
behindaneducationalinstitutionswebsite.Thewebsitesupportsselectionofaparticular
department,aparticularcourseinthedepartment,aparticularstudentinthecourse.
9.Givethedesignconsiderationsforaclientserversystemwhereintheclientgetsavirtual
operatingsystemontheflythroughthenetworkfromaserverconsistingofseveralsuch
operatingsystems.
10.Whatarethedifferenttypesofvirtualization?.Iwasaskedtodifferentiatebetweensystem
andprocessvirtualization.
12.ExplainVMwaresvirtualizationonamulticoremachine.
13.Pack51applesinminimumnumberofpacketssuchthatwiththepacketsIhavemade,I
shouldbeabletogiveanynumberofapplesbetween1and51.
11.Netappround2
1.Writeaprogramtoimplementstrstr.
2.Fromanincomingstreamofnumbers,constructabinarytreesuchthatitisalmostbalanced.
3.HowwouldIimplementtheautocompletefeatureforsearchqueries?
12.Netappround3
1.Whatisasemaphore?
2.CodethePandVoperationsofasemaphore.
3.ExplainRESTwebservice
4.IsHTTPastatelessorstatefulprotocol?
5.Whatissharedmemory?
6.Whatmotivatesmeinlife?
13.Netappround4
1.Explainthealignmentissuesinstructures.
2.Iamgiventwofilesviz.f1.c,f2.c,bothhavingacalltomalloc().Cantheaddressofthe
locationsreturnedbythesetwobesame?
3.Explainmemorymanagementunit.
4.Whatisasocket?
5.IwasaskedindetailtheconceptoftypecastinginC.
6.CanIdeclareastructurecalledawhichcontainsastructurecalledbandbinturncontains
a?
7.HowdoIfindtheoffsetofamemberofastructureobject?HowwouldIdothesameifIam
notallowedtocreatetheobjectatall?
14.Netappround5
1.Iwasaskedtotellsomethingaboutmethatwasnotinmyresume?
2.Whataremystrengths?
3.WhatdoIknowaboutNetapp?
4.WhatdoIthinkabouthigherstudies?
5.Whatismyfamilybackground?DoIhaveanysiblings?
6.Mypreferencesregardingthevariousjobprofilestheyhadtooffer?
15.Ittiamround1
1.Designadatastructurefordictionary.
2.Timecomplexityofvariousoperationsonhashmap.
3.ImplementmemcopyinC.
4.CanIincrementavoidpointer?
5.Iwasalsoaskedacoupleofsimplepuzzles.
Practocodingtest
1.Programtofindthenumberoftrailingzerosinafactorial.
2.Programtoinvertallbitsfromtheleftmostsetbitinaninteger.
3.Programtoinvertthecaseofthelastletterineachwordofasentence.
4.Givennumbersinrange1to1000000006,findtheminimumnumbersuchthattheproductof
itsdigitsmodulo1000000007isequaltoitself.
16.Practoround1
1.Iwasaskedtooptimizethelastprogrammentionedabove.
2.Iwasaskedindetailaboutmyinternshipexperienceandprojects.
3.IwasaskedwhyIdidnotcontributetoanyopensourceprojects.
17.Practoround2
1.Iwasaskedtoexplainthecodeofmyandroidappfrommydropboxaccount.
2.TheusualHRquestionsfollowedafterthat.
18.Paypalround1
1.Whichismydreamcompany?
2.Whatismybiggestachievementtilldate?
3.HowwouldIhandleconflictswithmyteammembers?
4.Ihavesavedmoneyfromayearandboughtmydreambike.ItisthelastroundofPaypal
interviewtoday.Iamonmywayonthebikeanditbreaksdowninanoparkingzone.Suggesta
winwinsituationsothatIdontlosebothinterviewandbike.
5.Whatissuccessaccordingtome?
19Paypalround2
1.Iwasaskedtowriteacodesnippetfrommyproject.
2.ProgramtoimplementDijkstrasalgorithm.
3.Programtoreverseasinglylinkedlist.
4.WhichalgorithmwouldIusetosortalinkedlistandwhy?Subsequently,Iwasaskedto
explainthelogicofmergesort.
5.Suggestasmanymethodsaspossibleforfindingthenthlargestelementinanunsorted
linkedlist.
20Paypalround3
1.HowwouldIexplaintheconceptofprimenumbertoanilliterate?
2.Giveafewtestcasesforabanktransaction.
3.Designclassesforeducationalinstitutionsinacity.
21Infibeamround1
1.Iwasaskedtoderivethetimecomplexityofmycodefromthewrittentest.Itwastoprintthe
elementsofabinarytreeinspiralorder.
2.Programtoswaptwopointers.
2.Programtodeterminewhetheragivenbinarytreeisbinarysearchtree.Iwasaskedtosolve
thisintwodifferentways.
3.TwoDBMSqueriesinvolvingaggregatefunctions.
22Infibeamround2
1.ProgramtoimplementDijkstrasalgorithm.
2.ProgramtoimplementFloydWarshallsagorithm.
3.Programtoprinttheelementsofamatrixinspiralorderrecursively.
4.Givenanunsortedarrayofnumbers,findtwonumberswhichadduptothegivensuminO(n).
5.ExplainindexinginDBMS.
6.ExplainBandB+trees.
23Infibeamround3
1.Givenabinarytree,writeaprogramtodeterminewhetherthereexistsaroottoleafpath
havingthegivensum.
2.Programtofindthelowestcommonancestoroftwonodesinbinarysearchtreeaswellas
binarytree.Iwasalsoaskedtogivethebruteforceapproachforthesame.
3.Programtoprintallancestorsofanodeinabinarytree.
4.Givenanarrayarr[]ofnintegers,constructaproductarrayprod[]suchthatprod[i]isequal
toproductofalltheelementsofarr[]exceptarr[i].Iwasaskedtosolvethiswithoutusing
divisionoperatorandinO(n).
24Ciscoround1
1.Programtoprinttheelementsofabinarytreeinspiralorder.
2.ExplainwhathappensunderneathwhenyouenteraURLinthebrowser.
3.ExplainwhyMACaddressesarerequireddespitehavingIPaddresses.
4.Solvetheclassicalbridgeandtorchpuzzle.
5.Explainmyinternshipproject.
25.Ciscoround2
1.WhatisanarraylistinJava?
2.WhatisthedifferencebetweenanarraylistandalinkedlistinJava?
3.JavaisnotapureOOlanguage.Justify(theanswerexpectedwasthattheprimitivetypes
arenotobjectsinJava!)
4.Whatisthedifferencebetweenanobjectorientedandobjectbasedlanguage?
5.Explaininheritanceandabstractionwithaconcreteexample.
26.Ciscoround3
1.WhywouldIwanttoworkforCisco?
2.WhywouldIwanttotransitionfromwebdevelopmenttosystemlevelcoding?(myinternship
wasonRubyonRails)
3.Whatsmytakeonhigherstudies?
4.WhatisthedifferencebetweenC,C++,andJava?
5.DoIlikeRubyorJavamore?
6.Thiswasfollowedbyabriefscanofmyresume.
Intuitwrittentest
1.Givenawordanddictionary,writeaprogramtocalculatethetotalnumberofvalidwords
possiblefromthegivenword.
2.Explainthesolutiontotheclassical25horsesand5lanespuzzle.
3.WriteaprogramtofindtheGCDofasetofnumbers.(Euclidsalgorithm)
4.DesignthemostoptimaldatastructuresforanLRUcache.
27.Intuitround1
1.Programtoinsertanelementintoasortedlinkedlist.
2.Programtodeleteanodeinasinglylinkedlistgivenonlyapointertothenodetobedeleted.
3.Givenanarrayofnelementswhichcontainselementsfrom0ton1,withanyofthese
numbersappearinganynumberoftimes.FindtheserepeatingnumbersinO(n)andusingonly
constantmemoryspace.
4.ForwhatallpurposesisthevirtualkeywordusedinC++?
5.Explainaprojectlistedonmyresume.
28,29.Intuitround2and3
1.Athoroughscanofmyresumeandindepthcoverageofalltheprojectsandtechnologies
listedonit.
2.DifferencebetweenC,C++,andJava
3.WhichdomainwouldIbeinterestedtoworkin?(desktopappsorwebapps)
4.DifferencebetweenWeb2.0andWeb1.0.
5.DifferencebetweenIAAS,PAAS,SAAS.(cloudcomputingwaslistedonmyresume)
Tipstohelpprepare:
AptitudeRound:
1.QuantitativeQuantitativeAptitude(RSAggarwal),QuantumCAT(SKVerma)
2.VerbalandNonVerbalAModernApproachtoVerbalandNonVerbalReasoning(RS
Aggarwal)
3.LogicalTheGreatBookofPuzzlesandTeasers(GeorgeSummers)
4.TechnicalMCQsinComputerScience(TimothyJWilliams)
TechnicalInterviewRound:
1.BooksCrackingtheCodingInterview(GayleLaakmann),ProgrammingInterviewsExposed
(JohnMonganetal.),ProgrammingPearls(JonBentley)
2.WebsitesGeeksforGeeksAcomputerscienceportalforgeeks,ProgrammingInterview
Questions|CareerCup,LeetCode,
3.Puzzlestechinterview
ResumeandHR:
1.BooksGoogleResume(GayleLaakmann)
Thisisanextremelyexhaustivelist.Itwillstandyouinaverygoodsteadforanytoptier
company(technicalornontechnical)thatmayvisitthecampus.It'snodifferentfromasemester
fullsyllabus.Justthinkthatwayandaceit.Allthebest!