Goldman Sachs Front end Developer Interview Questions and Answers

Interview preparation tips for other job seekers - Please go through Js basics and be in react expert

Topics to prepare for JPMorgan Chase & Co. Front end Developer interview:

• Javascript

Round: Other Interview
Experience: One year since I took the interview, so no idea exactly what questions they asked. But I was asked to write the code on paper in front of him and was asked to debug it. Some puzzles and aptitude questions along with other basic coding questions. It was great that the guy was interactive and started asking about my projects and college life.
Btw the answer to the logical question is: I should say " you will shoot me". Paradoxical.
Tips: Feel free to ask anything that you would like to know from them. Also frankly say that you don't know a certain topic if you have no clue what it is about. They don't like people wasting their time.

Round: HR Interview
Experience: This was not exactly a technical interview. He asked me to write a code to find the day of week when a certain date in any year of the calendar is given. I answered it and then he starting asking general questions as to why do u want to join the company, etc.
I gave answers to most of them convincingly. But I kept him engaged by explaining my life at college, the extra curriculars I did at college. Also I asked him about his experience as a software engineer. I asked him to reflect upon his career and how I should approach about my career.
Tips: The best part about HR interviews is they expect you to ask them lots and lots of questions. The more they are engaged, the more are your chances of impressing and getting selected. And more importantly, ask the interviewer about his experience with the present firm. This also works with my manager when ever he has a one on one with me :P
Cheers and all the best.

Skills: Soft Skills, General Aptitude, LOGICAL THINKING ABILITIES, Coding Skills And Knowledge On Data Structures
College Name: IIT Hyderabad

Round: Test
Experience: Programming section had basic questions on C++ & data structures.
Tips: Try to score maximum in aptitude test, they consider your score while placement.
Duration: 2 hours
Total Questions: 35

Round: Technical Interview 1
Experience: Questions asked during this round:
Introduce yourself.
Questions on projects & internships.
Questions on Final year project in detail (max part of interview was on final year project).
Basic concepts of C++.
Few programs on C++.
Puzzles.


Round: Technical Interview 2
Experience: ? 2 interviewers were there.
? Stressed interview.
? They grilled me a lot on C++ & data structures.
One interviewer started asking questions, and before I could complete my answer, another used to cut me in
middle & start asking another question. I realized it

Round: Test
Experience: It was an easy test overall, basic programming things were asked in technical part of test whereas aptitude questions were also relatively easy.
Tips: You just need to know things which were there in CS101 for technical part of test .Nothing else is required.
Duration: 30 minutes
Total Questions: 1

Skills: Problem
College Name: Indian Institute of Technology, Bombay

Round: Technical Interview
Experience: Technical on paper test questions:(dis was only for 12 among d 26 shortlisted ppl after apti...others directly had interviews)
5 wer selected in this test who wer nw sent for interviews
TECHNICAL INTERVIEW: (pls list the questions asked in all the rounds)
26 shortlisted after apti (14 directly for interviews & 12 had one more technical on paper test...mentioned above)
der wer min 2 technical rounds for each of them...max were 5

- You are given course dependencies
A->B,C
B->D
C->A
D->nothing
The above dependencies mean...if you want to take course A...you should take courses B and C first....To take B,Course D must be taken first....D is an independent course and can be taken without any prior requirements.
Now you are told these dependencies.Come up with an appropriate data structure to represent these dependencies.Then write a code that finds out all the courses that the student can take up...in this case the student can first take course D because its independent.Now that course D has been taken he can next take up B as it depends on B alone...But the courses A and C can never be taken because they depend on each other...So here all the courses that can be taken are B and D.
After i wrote the code....he asked for all possible test cases
-Given an array of length N....It can be filled with nos. only from 1 to N....find which nos are repeated in the array
-Given pointers to two nodes in a binary tree....find their least common ancestor...each node has pointer to only the parent node...not the left and right child..
-In a binary tree(Not necessarily a BST)...suppose the weight of any node is defined as the product of the key value of the node and the level of the node(Root at level 1)...find the node with maximum weight in the binary tree
-A sorted array of size n is right circularly rotated k times and this rotated array is given to you as input...Find out the value of k in log n time .
-There are some processes running at time T....and there are processes running at time T+30.
You have to find out
1)Which processes died at time T+30,which were alive at time T
2)Which are the new processes at time T+30,which were not there at time T
3)Which are the processes that were there at time T and are still running at time T+30
What data structure will you use to represent the process lists and write code to find out the answers to the 3 questions above
-Given a binary search tree...and a target sum...starting at the root...which all paths add up to the target sum?...if there are multiple paths....return the path with least no. of nodes.


College Name: Veermata Jijabai Technological Institute, Mumbai [ VJTI ]