Goldman Sachs Interview Experience | (1yr+ experienced) 2019

Hackerrank
– input: digit, and arr of numbers
– output: count total of that digit in number else reurn -1;
2. share stock = a -s1+s2..
s1, s2 infi supply, minmium no. of stock

coderpad
1. a/b + c/d = simple form
2. grid [][] contain coins find optimal path to collect most coins (only allowed north and east)

Telephonic interview:
1. terra byte of data of emplyee name push it to server database (efficient way)
2. How to avoid hash collision
3. how arraylist implement interally (sizing?)
4. java collections for objects
5. Synchronisation usage
6. OOPs all imp. concept – with examples and benfits



F2F onsites
Round1 :
– Resume walkthough
-OOPs
-equals and == operator
– String internal implementation
– JVM internal process (.caa to bytecode, how byte code understand by diff OS)
– Count Character count (Optimized)
-Why Arg is paasing in main method
-Is it possible == opertaor is true but equal is false

Round 2
– Resume walkthrough
-What immuatable objects
-How to create immutbale classes with example
-String immutability, explain?
-Arraylist vs Linkedlist vs HashMap

Lunch
Round 3
-Java production related issues handling
-how jar is formed, how codes are deployed?
-Puzzle : You have got 27 coins, each of them is 10g, except for 1. The 1 different coin is 9g or 11g. You should use balance scale that compares what’s in the two pans. What is the minimum no of weighings that can determine the different coin.?
-How many types of Linked list?
– Reallife application, example of Linked list, DLL, CLL?
-Why GS technology division ?

Round 4
-A document (very big).. print only single occurenece inthe order of initial arrangments? example this book is very good book.
output: this is very good
– missing and repeating element in sequence of number 1 to n
-hashcode custom function? how Java make its own
– Hashcode and equal contract

Write your Interview Experience or mail it to contribute@geeksforgeeks.org



My Personal Notes arrow_drop_up

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 Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.