SDE - Intern

You are given a positive integer N and an equation 1/X + 1/Y = 1/N

You need to determine the count of all possible positive integral solutions (X, Y) for the above equation.

Note:

1. X and Y should be greater than 0.
2. (X, Y) and (Y, X) are considered different solutions if X is not equal to Y, i.e. (X, Y) and (Y, X) will not be distinct if X=Y.

You have been given a Binary Tree of integers. You are supposed to return the level order traversal of the given tree.

For example:

For the given binary tree

The level order traversal will be {1,2,3,4,5,6,7}.

You are given a 2 - D matrix, ‘MAT’, which consists of only 0s and 1s. Every row of the matrix is interpreted as a binary number, and the sum of all these “binary number interpreted rows” is defined as the score of the matrix, ‘MAT’.

You have to maximize the score by making any number of passes where a pass consists of choosing any row or column, and toggling each value in that row or column, i.e., changing all 0s to 1s, and all 1s to 0s. Your task is to return the highest possible score of the matrix, ‘MAT’.

So the first round started with a tell me about yourself question, all the interviewers were pretty comforting and cooperative.
She went ahead and asked more about my teaching assistant's experience, challenges faced and some behavioural question around it. After that I had to code a medium hashmap question and the round ended with an easy puzzle linked below. It went around 40 minutes long.

The second round again started with me introducing myself and I was asked out of all companies, Why Goldman Sachs? These are pretty standard question one must prepare. Further, he asked me if I had checked today's stocks prices of GS, which I had not and I stated it clearly. He then asked that as GS is a very diverse firm how would I tackle arguments or discrimination faced on the basis of gender/colour/race/culture. Then he shared with me the code pair link and asked two medium-hard level DP question linked below. I was able to solve one of them completely and the other one partially. This round went around 45 to 50 minutes long.

In the third round, I was asked to brief any of my three projects mentioned within 10 15 minutes. She put some general questions in between but didn't cross-question much on it. As I had a project related to sorting I was asked questions on merge sort, quick sort, radix sort, their use cases time complexities.As I had used both c++ and java she asked me about their differences and then drifted towards OOPs.I was asked to explain some concepts of oops and state real-life examples where OOPs was implemented, then she asked about polymorphism, run time polymorphism , virtual functions/classes etc.

She then asked a coding question based on anagrams, question similar to it have been linked below.

This round again ended with a puzzle where I had to find a minimum number of races to be conducted to find the top three fastest horses out of 36 horses where only 6 horses can run on a track at once.

The final was more of a behavioural round but with a really tricky question based on a matrix. He asked me to introduce myself , how I manage time being from electronics background, my incline towards computer science,Why Goldman Sachs and how does Goldman Sachs makes money. This was a pretty shorter round which ended with a logical question on matrix explained below.(I wasn't supposed to code it).

After each round they ask if you have a question for them so be prepared with that.

I wasn't asked a single question around core subjects like OS,DBMS,Computer networks but other candidates were asked about it.

Given a string ‘str’ and a string ‘pat’. The string s has some wildcard characters i.e ‘?’ and ‘*’.

If any character is a ‘?’ we can replace that character with any other character. 

If a character is a * we can replace * with any sequence of characters including the empty sequence.  

Your task is to determine if it is possible that we can make ‘str' = 'pat’ using appropriate conversions in ‘str’.

For example:

Let str = “abc?" and pat= “abcd”

We return true as ‘?’ can be replaced with ‘d’ and this makes ‘str’ and ‘pat’ same.

There are 2 trees in a garden (tree "A" and "B") and on both trees are some birds.
The birds of tree A say to the birds of tree B that if one of you comes to our tree, then our population will be the double of yours.
Then the birds of tree B tell to the birds of tree A that if one of you comes here, then our population will be equal to that of yours. How many birds in each tree?

There are ‘N’ horses running in ‘N’ different lanes numbered from 1 to ‘N’. You are given an array “FINISHTIME” containing ‘N’ integers where “FINISHTIME[i]” represents the time taken by the ith horse to complete the race.

You are now given ‘Q’ queries, each containing two integers each, ‘L’ and ‘R’. For each query, return the time taken by the fastest horse amongst the horses with numbers {L, L + 1, L + 2, …., R - 1, R} to complete the race.

Note:

The fastest horse is the one that takes the minimum time to finish the race. 

You have been given an array/list of strings 'STR_LIST'. You are supposed to return the strings as groups of anagrams such that strings belonging to a particular group are anagrams of one another.

Note :

An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase. We can generalize this in string processing by saying that an anagram of a string is another string with the same quantity of each character in it, in any order.

Example:

{ “abc”, “ged”, “dge”, “bac” } 
In the above example the array should be divided into 2 groups. The first group consists of { “abc”, “bac” } and the second group consists of { “ged”, “dge” }.