JPMorgan Chase & Co. Software Development Engineer II Interview Questions and Answers

Round: Test
Experience: Study data interpretation (calculator allowed) and pattern puzzles

Round: Group Discussion
Experience: Two topics (have been same case studies for past 4 years now): - Mobile app improvement - Making a business decision

Round: HR Interview
Experience: Everything depends only on HR interview
Tips: Make a list of your strengths and an example for each!

Round: Technical Interview
Experience: Short, easy and basic questions asked about projects and DS. Pretty chilled

College Name: Sardar Patel Institute of Technology

Round: Test
Experience: General aptitude consisted of quantitative questions .There were 6 questions and suggested time as 10 minutes. Questions were of easy level. Questions based on numbers,distance,time etc..Answers of general aptitude were to be written in textbox. eg ans is 4,write 4. there were no options in quant. Answers were integers an easy.
Technical comprehension involved two paragraphs and questions based on sql.
Logical analysis contained questions of logical deduction mainly.
Program tracing involved finding output of programs(mainly while loop and if else)..
Programming : There was only one question of programming(to be solved in 30 minutes). Code was given and was to be modified.Modification involved like , find out the least salary of employees,... (they used file input output and structures).

Tips: Practice basic aptitude.Concepts should be clear.
Duration: 90 minutes
Total Questions: 18

Skills: Basic C/C++, Logical Thinking, Logical Reasoning, General Aptitude
College Name: NIT Raipur

Round: Test
Experience: Was nice experience,should have good aptitude.
Tips: Learn aptitude more and morr
Duration: 60 minutes

Round: Group Discussion
Experience: Just speak about the topic
Tips: Do not get silent

Round: Technical Interview
Experience: iOS,C/C++
Tips: Just be confident about your answwers ansd show that you are capable to do each and everything in this world and you have quick learning capacity to grasp anything.

General Tips: C/C++,
Skills:
College Name: CDAC PUNE
Motivation: Bank more than 325 years old.

Round: Test
Experience: The question were not that much difficult. Many apti questions are easy. Technical was very easy for me.
The questions were fully based on java, c and SQL. 7 to 8 questions are from SQL. But all are straight forward questions. Other 2 sections were easy and any student who had a good sort of thinking ability can able to solve those questions.
Tips: Just refer all the basic topics in java, c and sql.
Duration: 60 minutes
Total Questions: 50

Round: Technical Interview
Experience: It was fully based on the final sem project which i was doing.
Since my project is company's employee portal, i was asked about that. They will dig into deep with respect to that project.
Tips: U should be aware of each and everything in your project which you are going to explain them. The question which they use to ask is really unpredictable.

Round: Technical Interview
Experience: This is pure technical round where i was asked the questions which is easy but takes time to think. Anyhow, i answered all these questions and get into the next round.
Tips: Logical thinking matters. Though questions look easier, sometimes we co calculate with wrong manner.
So keep calm and think in a broader manner.

Round: Technical Interview
Experience: Technical round with pure database stuffs. I was asked only few question in this. Since it was straight forward, i answered all the questions.

Round: HR Interview
Experience: Confidence really matters. Though i was not that much good in conversing, i spoke with brave and confidently which makes me to became a part of the barclays team.

General Tips: Be confident enough and answer them what you know.
Talking too much as well as taking less is also a problematic.
Skills: Logical thinking, Technical skills ( Especially about database )
College Name: MANIPAL INSTITUTE OF TECHNOLOGY, MANIPAL
Motivation: Credits should goes to my bro who motivates me to apply to this comapny.

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 ]

Round: Written Test
Experience: I attended interview at hyderabad location for java Sr.Software Engineer.
1Q) Find out given string palindrome or not.
Ex: madam
2Q) Find first and last index searching number in a array.
Ex: [1,2,3,3,3,3,4,5]
Output : 2,5
3Q) Arrange Strings in alphabetical order.

Tips: Prepare numeric and string related algorithms