Tip 1 : Be thorough with data structures and algorithms. Avoid just switching between different coding platforms according to people's suggestion instead pick one and stick to it(Leetcode worked for me!).
Tip 2 : Do not miss out on core subjects (for GS ,OOPs and Operating systems especially).
Tip 3 : Keep giving mock interviews (take at least 2 -3 prior to real one) ,it helps a lot to prevent last-minute interview anxieties and makes you feel prepared and confident.
Tip 1 : Choose the right format, it should reflect professionalism.Goldman Sachs blog suggests to arrange your resume with your educational information at the top,followed by your grade-point average,professional experience, projects and any special interests and activities or achievements.
Tip 2 : If you do not have any prior experience, solidify your projects section(3-4 is a good number).Articulate your project description in a precise and crisp format.
Tip 3 : Come up with three reasons why you should be picked for the job in accordance with job's description —these will be some of the top traits you’ll want to emphasize in your resume.
Tip 4 : Go through company's career blogs ,might give you relevant insights on what it expects then align your presentation in accordance with in.(Link to GS blog on resume tips:https://www.goldmansachs.com/careers/blog/posts/resume-tips-from-goldman-sachs.html)



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.
It was tricky bit manipulation problem. Think using left shift algo



For the given binary tree

The level order traversal will be {1,2,3,4,5,6,7}.
Use recursion to solve this problem
First Round
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.



1. If 'X' is not found in the array, return 0.
2. The given array is sorted in non-decreasing order.


1. The sizes will range from 1 to ‘N’ and will be integers.
2. The sum of the pieces cut should be equal to ‘N’.
3. Consider 1-based indexing.
Tip 1 : Go through puzzle section of gfg
Tip 2 : Think twice thrice then jump to answer
Tip 3 : Be patient
HR round mainly consists of question related to our personal life. They see our thinking skill, how we are tackling any problem in our life
Why Uber?
Have you checked today's stock prices of GS?
How would you tackle arguments or discrimination faced on the basis of gender/color/race/culture?
Tip 1 : Be prepare with famous standard question
Tip 2 : Dry run your code first before showing it to HR
Tip 3 : Don't hesitate to ask your doubt

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you remove whitespace from the start of a string?