Opportunities to work across teams and learn about finance.
Technology-wise, GS is hampered by needing to run all their own stuff, and much of it is looking a little tired now.
2 Medium DSA Questions: 1. On Hashmap: Simple iteration over an array and searching the hashmap. 2. Shortest Path Algorithm: Finding the source to destination in minimum steps. Follow-up questions included time complexity and how the approach coul
Two coding questions of easy-medium level. The interviewer was very friendly and made me comfortable. One question was based on hash maps, and the other was a math-based problem involving rotation in a cycle.
The process was quite long, approximately five months from application to offer. However, it was not difficult, and the questions were easy. The extended timeline was likely due to submitting my HireVue around the holidays.
2 Medium DSA Questions: 1. On Hashmap: Simple iteration over an array and searching the hashmap. 2. Shortest Path Algorithm: Finding the source to destination in minimum steps. Follow-up questions included time complexity and how the approach coul
Two coding questions of easy-medium level. The interviewer was very friendly and made me comfortable. One question was based on hash maps, and the other was a math-based problem involving rotation in a cycle.
The process was quite long, approximately five months from application to offer. However, it was not difficult, and the questions were easy. The extended timeline was likely due to submitting my HireVue around the holidays.