Interview Questions asked in Goldman sach interview



Tips :
  • Apart from DS, System design; Prepare the domain (language/skill set/frameworks/projects) in deep.
  • Be prepared for case studies or specific scenario kinda questions.
  • Do not exaggerate on CV if you can’t cover it up in Interview.
  • DS questions were of easy level. They ask design questions in same number as much as DS questions so be prepared for System design and distributed system related questions as well.
  • Communication is the key. Portraying your own thoughts/knowledge to someone is importan





    • https://www.geeksforgeeks.org/goldman-sachs-interview-experience-set-35-experienced/
































































    Comments

    Post a Comment

    Popular posts from this blog

    Very Basic Java Programs

    [1] Count ways to reach a score using 1 and 2 with no consecutive 2s A cricket player has to score N runs, with condition he can take either 1 or 2 runs only and consecutive runs should not be 2. Find all the possible combination he can take. Examples: Input : N = 4 Output : 4 1+1+1+1, 1+2+1, 2+1+1, 1+1+2 Input : N = 5 Output : 6 This problem is a variation of count number of ways to reach given score in a game and can be solved in O(n) time and O(n) auxiliary space. Below is the recursive solution of above problem. // A simple recursive implementation for // counting ways to reach a score using 1 and 2 with // consecutive 2 allowed   import java.io.*;   class GFG {    static  int CountWays(int n, boolean flag) {     if (n == 0) // base case         return 1;       int sum = 0;       // 2 is not scored last time so we can score either 2 or 1     if (flag == fals...
    Read more

    [08 Feb 2020] Minimum number of platforms required for a railway station

    Image
    Problem: You are given arrival and departure time of trains reaching to a particular station. You need to find minimum number of platforms required to accommodate the trains at any point of time. For example: arrival[] = {1:00, 1:40, 1:50, 2:00, 2:15, 4:00}  departure[] = {1:10, 3:00, 2:20, 2:30, 3:15, 6:00} No. of platforms required in above scenario = 4 Please note that arrival time is in chronological order. Solution : If you notice we need to find maximum number of trains that can be on the station with the help of arrival and departure time. Solution 1: You can iterate over all intervals and check how many other intervals are overlapping with it but that will require o(N^2) time complexity.  Solution 2: We will use logic very much similar to  merge sort . Sort both arrival(arr) and departure(dep) arrays. Compare current element in arrival and departure array and pick smaller one among both. If element is pick up from arrival array ...
    Read more