JPMorgan Chase & Co. Engineering Intern Interview Questions and Answers

Q1. SQl server- DB design
Add your answer

Q1. Data structure questions
Add your answer

Q1. React machine coding question
Add your answer
Q2. JavaScript based question
Add your answer

Q1. What is your role in team
Add your answer
Q2. Formative assessment of complex problems and your contribution to drive the solution
Add your answer

Q1. DSA algorithm question
Add your answer

Q1. Docker and kubernetes
Add your answer

Q1. Deployment strategies
Add your answer

Q1. Application architecture
Add your answer

Q1. Java streams...................
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

It consist three question - first que is of related to tree and i gave difficulty level of this question as hard. second que is of based on logical and reasoning , it is medium level question and third que can be done by map and it is also medium level que.
In codility platform we are not able to see hidden test cases whether it is satisfied or not . we just have to submit after passing sample testcases.

Q1. Minimum number of swaps required to sort an array
You have been given an array 'ARR' of 'N' distinct elements.
Your task is to find the minimum no. of swaps required to sort the array.
F...read more
Ans. Naive Approach
While iterating over the array, check the current element, and if not in the correct place, replace that element with the index of the element which should have come in this place.
 
Below is the algorithm:
1. Create a copy of the given input array and store it in temp.
2. Sort the temp array.
3. Iterate over the input array, and check whether the current element is at the right place or not by comparing it with t...read more
Answered Anonymously
Add your answer
Q2. Maximum sum of non-adjacent elements
You are given an array/list of ‘N’ integers. You are supposed to return the maximum sum of the subsequence with the constraint that no two elements are adjacent in the ...read more
Ans. Recursive Approach (top down)
We are going to explore all the possibilities of subsequences in which there will be no two elements that are adjacent to one another in the given array/list. So if we take the current element, let’s say ‘CURR’ then we are not allowed to take the element adjacent to ‘CURR’. So for that, we will call a recursive function one step forward to the ‘CURR’. 
 
The Steps are as follows:
&nb...read more
Answered Anonymously
Add your answer
Q3. Left View Of Binary Tree
Given a binary tree. Print the Left View of the Tree.
Example :
If the input tree is as depicted in the picture: 
The Left View of the tree will be:  2 35 2 
Input format :
...read more
Ans. Recursive Approach
This problem can be solved through recursion.We will maintain max_level variable which will keep track of maxLevel and will pass current level in recursion as argument. Whenever we see a node whose current level is more than maxLevel then we will print that node as that will be first node for that current level. Also update maxLevel with current level.
Space Complexity: O(n)Explanation:
O(N), where ‘N’...read more
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

basically this round is just same as HR round . they asked me behavioural questions and about my projects , hackathon. the timing is mid noon and interviewer is supportive , it makes first comfortable then start questioning . for this round i suggest be honest , don't just express your qualities but trying to show them by your skills and work.

Q1. SQL queries and few functional questions
Add your answer

Q1. General questions by hiring manager. Why leaving current org, current project related questions
Add your answer

Q1. Define your project structure
Add your answer