Goldman Sachs Interview Experience | Set 34 (Off-Campus)

I got a call from a consulting firm regarding this opening. 

Round 1: Hackerank Online test:(1.5 hours) It had two questions. you have to pass all the test cases.

1. Given an array of numbers, print only those numbers which have 1, 2 and 3 as digits. the numbers should be sorted and comma separated.
2. given a sequence of M and N with M representing increasing and N representing decreasing. output the smallest number that follows this pattern.

Round 2: Coderpad round :(1 hour) Usually has two questions. but depending on the time they may or may not ask the second one. you should complete atleast one with an optimal solution.

1. Given an array of non-negative numbers & a target value, return the length of smallest subarray whose sum is greater than the target value.

I could give only brute force solution of this question and the interview process ended here. Wishing others all the best for their experience here.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

My Personal Notes arrow_drop_up

Save