Jump to content

Morg@n st@nley interview intha tough aa


kiran karthik

Recommended Posts

  • Replies 92
  • Created
  • Last Reply

Top Posters In This Topic

  • Kontekurradu

    24

  • kiran karthik

    16

  • 4Vikram

    11

  • k2s

    5

Top Posters In This Topic

13 hours ago, 4Vikram said:

Dhammu undi tiskune Dhairyam undi kaani interview tiskune opike ee ledu @~`

lol ala em undadu bhaiyya, konni projects baaga demanding untaayi, alanti vaatiki intvw kuda scrutinize chestadu, migilina vaatiki lite %$#$

Link to comment
Share on other sites

22 hours ago, kiran karthik said:

Mumbai location java, 2nd round chukkalu choopincharu 2hrs, asked too difficult algorithms

asal ela crack sethunnaru saami

Ela crack chesthunnaru ani kadu! Crack cheyyoddu aney alaa, already vallu evarino select chesi vuntaru 

Link to comment
Share on other sites

3 minutes ago, TechAdvice said:

Ela crack chesthunnaru ani kadu! Crack cheyyoddu aney alaa, already vallu evarino select chesi vuntaru 

its pretty common every where no, okka india lone kaadu ga 

Link to comment
Share on other sites

22 hours ago, kiran karthik said:

Mumbai location java, 2nd round chukkalu choopincharu 2hrs, asked too difficult algorithms

asal ela crack sethunnaru saami

anni rounds same questions vuntaayi max....

Link to comment
Share on other sites

15 hours ago, k2s said:

USA lo new grad interview qs avi

india lo mana Btech syllabus lo Data structures ante linked list lo element insert chey delete chey anthe kadha....asala freshers ki DS ante ento kuda thelavadhu.....

Link to comment
Share on other sites

16 hours ago, k2s said:

USA lo new grad interview qs avi

flight search ante oka source, oka destination ki unna flights ni query chese program kadu adigindi

2 pages requirements icharu adi chadavatanike half n hr pattindi, gurthu thechukoni ikkada vesta

arrays.sort enduku quick sort use chesi rasaru ani adigaru, i told it has best time/space complexity o(nlogn) nt convinced

100 traders are trading at desk, write one algorithm any two traders will not book the same instrument, few pre conditions are given, which collection obj u vl use, should nt have performance issue

array deque implementation, inka chala unnay gurtu thechukoni chepta

BST in-order implementation

i guess grads can do it, uh  @3$%

oka array ichi sort cheyyamante arrays.sort use chesi sort cheyyatam kadu

Link to comment
Share on other sites

3 minutes ago, kiran karthik said:

flight search ante oka source, oka destination ki unna flights ni query chese program kadu adigindi

2 pages requirements icharu adi chadavatanike half n hr pattindi, gurthu thechukoni ikkada vesta

arrays.sort enduku quick sort use chesi rasaru ani adigaru, i told it has best time/space complexity o(nlogn) nt convinced

100 traders are trading at desk, write one algorithm any two traders will not book the same trade, few pre conditions are given, which collection obj u vl use

array deque implementation, inka chala unnay gurtu thechukoni chepta

i guess grads can do it, uh  @3$%

Search in glassdoor

Link to comment
Share on other sites

53 minutes ago, BaabuBangaram said:

india lo mana Btech syllabus lo Data structures ante linked list lo element insert chey delete chey anthe kadha....asala freshers ki DS ante ento kuda thelavadhu.....

Out of syllabus ana kudadu man when preparing for interviews...

Link to comment
Share on other sites

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.

Guest
Reply to this topic...

×   Pasted as rich text.   Paste as plain text instead

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.

×
×
  • Create New...