JPMorgan Chase & Co. Interview Questions, Process, and Tips for Freshers

Round duration - 30 minutes
Round difficulty - Medium

Q1. Populating Next Right Pointers In Each Node
You have been given a complete binary tree of ‘N’ nodes. The nodes are numbered 1 to ‘N’.
You need to find the ‘next’ node that is immediately right in the lev...read more
Ans. BFS approach
The idea here is to Perform BFS while maintaining all nodes of the same level together, which can be done by storing nodes of the same level in a queue data structure, then for a particular level, we start popping nodes one by one and set the ‘next’ pointer of the previously popped node to the current node.
 
Example :
 
• Perform BFS  and maintain a queue for all nodes at the current level.
• Now, mo...read more
Answered Anonymously
Add your answer

Round duration - 10 Minutes
Round difficulty - Easy

Round duration - 70 minutes
Round difficulty - Medium

It had two parts. First part had MCQ questions and the second part had two coding questions.

Q1. Minimum Depth Of Binary Tree
You have been given a Binary Tree of integers, find the minimum depth of this Binary Tree. The minimum depth of a Binary Tree is the number of nodes along the shortest path fro...read more
Ans. Depth-First-Search
We can write a recursive solution for finding the minimum depth in a Binary Tree. The idea here is to first find the minimum depths of left and right subtrees and then the minimum depth of the current node will be 1 + min(minDepthLeftSubtree, minDepthRightSubtree).
 
Here is the complete algorithm:
 
• Traverse in given Binary Tree.
• If currentNode is NULL, terminate recursion (return 0)
• If currentNo...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Questions about data structures and Machine learning were asked.

Q1. Pascal's Triangle
You are given an integer N. Your task is to return a 2-D ArrayList containing the pascal’s triangle till the row N.
A Pascal's triangle is a triangular array constructed by summing ...read more
Ans. Recursive Solution
The idea is to use recursion to get the value of the coefficients we will create a helper function CALPASCAL which will take row and entry as its input parameters and we call this function in the main function of PRINTPASCAL.
• Inside the function CALPASCAL if the row is 0 or the entry is equal to row then we will just return 1.
• Else we will return the sum of adjacent previous row value that is CALPASCAL(...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Hard

Questions related to data structures were asked

Q1. Sort Elements By Frequency
You are given a list of a repeated set of integers. Your task for the problem is to return a list of the given elements in decreasing sorted order of their frequency of repetitio...read more
Ans. Sorting With Comparator
The idea here is to keep a maintained list of the counts of the various elements given in the list and sort it in descending order based on their frequency counts and now keep the index values of the items and order them in ascending order. 
The algorithm will be-
1. The idea is to write a custom comparison method to solve this problem. Let the two elements to be compared are ‘x’ and ‘y’. Then.
   1. If...read more
Answered Anonymously
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

Questions about my projects and behavioural questions were asked

Round duration - 90 Minutes
Round difficulty - Easy

the test started at 4 in the evening. the test was conducted in the college only and all the questions were very basic .

Q1. Fastest Horse
There are ‘N’ horses running in ‘N’ different lanes numbered from 1 to ‘N’. You are given an array “FINISHTIME” containing ‘N’ integers where “FINISHTIME[i]” represents the time taken by the ...read more
Ans. Brute Force
For each query, we can simply loop between ‘L’ and ‘R’ and store the minimum time taken by a horse to complete the race in a variable, and return the value stored in that variable.
 
Algorithm for Each Query:
 
• Store the minimum time to complete the race in a variable ‘MINIMUMTIME’ and initialize it with a large enough number, in this case, 10^ 9 is sufficient.
• Iterate from ‘L’ to ‘R’ and if the time ta...read more
Answered Anonymously
Add your answer
Q2. Intersection of Linked List
You are given two Singly Linked List of integers, which are merging at some node of a third linked list.
Your task is to find the data of the node at which merging starts. If ...read more
Ans. Brute Force
• For each node in the first list, traverse the entire second list
• Check if any node in the second list coincides with the first list
  • If it does, return that node’s data
  • If it doesn’t, return -1
Space Complexity: O(1)Explanation:
O(1)
 
Since we only use constant space.
Time Complexity: O(m*n) - For 2d arraysExplanation:
O(N * M), where N and M are the lengths of the first and second linked lists respectively.&n...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This was an MCQ + Coding round

18 questions of Logical Reasoning
5 questions of Mathematics
7 questions of Subjects
2 coding questions

Q1. Minimum travel Cost
Ninjaland is a country having 'N' states numbered from 1 to 'N'. These 'N' states are connected by 'M' bidirectional roads. Each road connects to differe...read more
Ans. 
Used prims minimum spanning tree algorithm.
Answered Anonymously
Add your answer
Q2. Shortest path in an unweighted graph
The city of Ninjaland is analogous to the unweighted graph. The city has ‘N’ houses numbered from 1 to ‘N’ respectively and are connected by M bidirectional roads. If a...read more
Ans. BFS
• Store all the edges in the form of an adjacency list ADJ. if ADJ[X][j] = Y which means there is an edge from X to Y.
• Declare a queue Q and push S in it and also declare two vectors VISITED and DISTANCE which will store whether a house is visited or not and what is a distance of the house from house S respectively.
• We will also store the PARENT, that store the node from which we will reach the current node. It will hel...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

The interviewer was kind, chill, and helping. The interview was on Zoom.

Q1. Optimal Strategy for a Game
You and your friend Ninjax are playing a game of coins. Ninjax place the 'N' number of coins in a straight line.
The rule of the game is as follows:
1. Each coin has ...read more
Ans. Recursive Brute Force
• Suppose it's your turn and you are left with coins in the index range ['I', ‘J’] (other coins have already been picked up in previous turns). You have the option to pick either ith or jth coin. Of these two options, you would select the one which maximizes your winning amount.
  • If you pick the ith coin. The other player will have the option to pick ('I'+1)th or ‘J’th coin.
    → If the other player picks ...read more
Answered Anonymously
Add your answer
Q2. Chocolate Bar
You are given a chocolate bar in the form of a grid consisting of N x M pieces of chocolate. Your task is to take out exactly ‘K’ pieces of chocolate by cutting the chocolate bar either horiz...read more
Ans. 
It depends if the value of n and m is odd or even.
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

The interviewer was kind, chill, and helpful. The interview was on Zoom.

Q1. Counting Pairs
You are given a positive integer N and an equation 1/X + 1/Y = 1/N
You need to determine the count of all possible positive integral solutions (X, Y) for the above equation.
Note:
1. X ...read more
Ans. Naive Solution (Time limit Exceed)
• Given equation can be simplified as follows:
  • 1/X + 1/Y = 1/N
  • 1/X = 1/N - 1/Y
  • 1/X = (Y - N)/(N*Y)
  • X = (N*Y)/(Y - N)
  • X = (N*Y - N*N + N*N)/(Y-N)
  • X = (N(Y-N) + N*N)/(Y-N)
  • X = N + (N*N)/(Y-N)
• To identify the total number of pairs satisfying the given equation, iterate over all the possible values of X and Y and increment a counter, where current X and Y values satisfy the above equation.
• This will ...read more
Answered Anonymously
Add your answer

There were 2 coding questions and 10 MCQs.

There was a real life problem which we have to solve