Skip to content
Related Articles

Related Articles

Improve Article

Goldman Sachs Interview Experience | Set 35 (For Experienced)

  • Difficulty Level : Medium
  • Last Updated : 27 Nov, 2017

Goldman Sachs conducted a Code Sprint where 6 challenges were given. I solved 4 of them and was ranked below 1600 out of 10120 candidates. After this I got a call from the HR to appear for the next rounds.

 

1st Round: HackerRank Test (1 hr 30 min)

1. Given n and an array of strings, print the string that contains the digits (1, 2, 3), if there are multiple strings that satisfies the conditions, print them in ascending order.

Input  : 5
         1395
         1721298
         102030
         3215
         123
 
Output : 123
         3215
         102030

2. Given a sequence of M and N with M representing increasing and N representing decreasing, output the smallest number that follows this pattern.



Input    : MMMM
Output   : 12345

Input    : NNNN
Output   : 54321

Input    : MMNM
Output   : 2314

You need to solve atleast one question in order to progress to further round.

 

2nd Round: CoderPad Interview (1 hr)

This is a screen sharing round where the interviewer will be on call with you.

The interviewer asked about my experience, I answered 1 year. Probably the problem difficulty is based on the candidate’s experience.

1. Given a string, the task is to find maximum consecutive repeating character in string
https://www.geeksforgeeks.org/maximum-consecutive-repeating-character-string/

2. Given a string, print the reverse order of the string.
https://www.geeksforgeeks.org/write-a-program-to-reverse-an-array-or-string/

You need to solve atleast one question in order to progress to further round.



 

3rd Round : Face to Face Technical Interview (45 min)

This was a 2 on 1 face to face technical round in Goldman Sachs office campus.

1. Write a query to get the below output.

Table
--------------------------------
| Name    | Key    | Value     |
--------------------------------
| Ram     | City   | Bangalore |
| Ram     | Age    | 27        |
| Ram     | Title  | Analyst   |
| Ashok   | City   | Delhi     |
| Ashok   | Age    | 35        |
| Krishna | City   | Mumbai    |
| Krishna | Age    | 22        |
| Ashok   | Title  | Engineer  |
--------------------------------
 
Output
----------------------------------------
| Name    | Age | City      | Title    |
----------------------------------
| Ram     | 27  | Bangalore | Analyst  |
| Ashok   | 35  | Delhi     | Engineer |
| Krishna | 22  | Mumbai    |     -    |
----------------------------------------

2. Given an array of numbers where each number is in continuous series and would not be repeated once the series is over, print the count of each number.

Input : 1 1 1 1 6 6 4 4 4 9

Output: 1 - 4 times
        6 - 2 times
        4 - 3 times
        9 - 1 time

3. Write a program to count frequency of each number in an array of elements without using a hash table.

I gave O(n) complexity solution, but the interviewer was not satisfied with it and asked me to implement a balanced binary search tree which I couldn’t.

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course. In case you are prepared, test your skills using TCS, Wipro, Amazon and Microsoft Test Serieses.

My Personal Notes arrow_drop_up
Recommended Articles
Page :