Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

Goldman Sachs Interview Experience 2018

  • Last Updated : 05 Dec, 2018

Applied through LinkedIn.

Round 1:

Hey geek! It's time to become a success story instead of reading them. Check out our most renowned DSA Self Paced Course, now at a student-friendly price and become industry ready. And if you are looking for a more complete interview preparation resource, check out Complete Interview Preparation Course that will prepare you for the SDE role of your dreams!

Feeling prepared enough for your interview? Test your skills with our Test Series that will help you prepare for top companies like Amazon, Microsoft, TCS, Wipro, Google and many more!

HackerRank Test : Two Coding questions.(2Hours )



https://www.geeksforgeeks.org/goldman-sachs-interview-experience-for-experienced/

Easy Questions were asked.

Round 2 :

CoderPad Round:C++(1 Hour)

A person from Tech team will throw you the question on the screen which is shared to you. You have to code.

Two Coding questions.

1.An array of sentences containing an IP Address as a word in between. Print the most frequently occurring IP addresses(Duplicates also).

2. Median of two sorted arrays of different Lengths



Round 3:

Telephonic Round : C++(45 Mins)

1.Work Experience

2.Discussion on Virtual Functions, V-table, Polymorphism, Copy constructors, Destructors and questions based on given scenarios.

3.Map Internal implementation and its usage

4. Given an array of words. (N) and (Q ) queries – each query is again a word. You have to print the anagrams for the word from the array of words.

Constraints: N, Q<=10^6, |W|<=100
Use TRIE (or HashMap)
Round 4:

Telephonic Round : (1 Hour)

1.Work Experience

2.Search an element in a rotated sorted array

3. Max element from Stack in O(1) time

4. A stream of words will be given. I have to design a data structure which will give K Top frequent words at any point (Use TRIE and Heap)

5.Given an unsorted array. Find the smallest or largest contiguous Sub Array length whose sum equals to zero.

 

My Personal Notes arrow_drop_up
Recommended Articles
Page :