Was referred by a friend and got an email letting me know I would receive a phone call. A week later I got the phone call. First Interview I was asked "Tell me about yourself" to which I gave this spiel about how I was intrigued by the intersections of mathematics and technology. Next I was asked "why Morgan Stanley" to which I responded that I appreciated Morgan Stanley's heavy interest in the tech sector. This was followed by some technical questions such as "how do you tell if a number is the sum of two elements of a list? What if the list was sorted" and "What data structure would you use to calculate the standard deviation" and something along the lines of plotting various y-data values for single x-data values. A week later I get notified that I made it past the first round. The second round was two weeks later and had more simple questions on HashMaps, questions on BFS & DFS, Dynamic programming, checking if a string contains a substring, reversing a singly-linked list, some simple math problems etc. I answered all of them with one exception on HashMaps and their equals() and hashcode() contract. Know all about hashmaps before applying here.