JPMorgan Chase & Co. Sde1 Interview Questions and Answers

Interview preparation tips for other job seekers - Practice DSA, build your resume and profile with good projects and understand them deeply , practice good level DSA questions

Professional and academic backgroundI completed Information Technology from Bharati Vidyapeeth's College of Engineering. I applied for the job as SDE - 1 in GurgaonAmerican Express interview preparation:Topics to prepare for the interview - Data structures and algorithms, Object-Oriented Programming System concepts, Database Management System, Operating System, Networking.Time required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Do practice a lot of data structures questions as mostly questions in interviews are based on them. Also, do prepare for projects mentioned in your resume and skills which you have mentioned. Coding ninjas has a big hand in making my interview clear as I have taken a course from the coding Ninjas which helped me a lot to make my concepts clear.

Application resume tips for other job seekers

Keep it short and crisp. Go through it properly before the interview. Make sure that you haven't put anything in it that can cause you problems during the interview.

Final outcome of the interviewSelected

Interview preparation tips for other job seekers - Be confident and what what u speak because that is most important

Interview preparation tips for other job seekers - I went for Enterprise Testing Senior Associate. The person who interviewed me was very well known to me. He worked with me for more than a year at the same level. Asked illogical questions. All hypothetical questions he asked in which I was the one who was getting demoted or denied bonus or increment.
He should not have taken my interview as it was conflict of Interest. 99% of questions was asked by this guy and the other lady in VC only asked 1 general question.
I reported conflict of interest issue to the hiring HR but no action was taken not any reply toy email came.

Interview preparation tips for other job seekers - Freshen up the domain learnings
Be confident of the behaviour questions as per the past and practical experience

Round: Resume Shortlist
Experience: My resume had gotten shortlisted for the profile of an Analyst. This was the first stage.

Round: Group Discussion
Duration: 20 minutes

College Name: Lady Shri Ram College

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 ]