Goldman Sachs interview experience Real time questions & tips from candidates to crack your interview

SDE - Intern

Goldman Sachs

1 rounds | 1 Coding problems

Yatendra Kumawat

Fresher | Sep 2020

Rejected

Interview preparation journey

Preparation

Duration: 7 months

Topics: Pointers, OOPS, System Design, Algorithms, Dynamic Programming, graphs, trees

Tip

Tip 1 : Practice on leetcode and coding ninjas
Tip 2 : Compete on codechef and codeforces in live contests
Tip 3 : Learn DSA and practice regularly for at least 2 hours daily

Application process

Where: Campus

Eligibility: Above 7 CGPA and all branches allowed

Resume tip

Tip 1 : Keep it short and sweet.
Tip 2 : Try to be more descriptive with your past experiences.

Interview rounds

Round

Hard

Online Coding Interview

Duration90 minutes

Interview date17 Sep 2020

Coding problem1

Timings of the round were early evening around 7 o'clock.
It was help on hackerearth.

1. Check if two trees are Mirror

Easy

15m average time

85% success

0/40

Asked in companies

You are given two arbitrary binary trees consisting of N and M number of nodes respectively, your task is to check whether the two trees are mirror of each other or not.

Two trees are said to be mirror of each other, if

1. Roots of both the given trees are same.
2. Left subtree of the root of the first tree is the mirror of the right subtree of the root of the second tree.
3. Right subtree of the root of the first tree is the mirror of the left subtree of the root of the second tree.

For example,both the given trees are mirror image of each other: