'Coding has over 700 languages', '67% of programming jobs aren’t in the technology industry', 'Coding is behind almost everything that is powered by electricity'
JP Morgan interview experience Real time questions & tips from candidates to crack your interview
Machine learning engineer
JP Morgan
upvote
share-icon
5 rounds | 8 Coding problems
Interview preparation journey
expand-icon
Preparation
Duration: 2 Months
Topics: Probability and Statistics, Dynamic programming, Greedy Algorithm, Arrays, Strings, Trees, Heap
Tip
Tip

Tip 1 : Do Solve Probability questions on Expectancy, Conditional Probability, Bayes theorem and basic 12th level.
Tip 2 : Prepare your Introduction and Be very concise as interviews are of maximum 30 mins each
Tip 3 : Be very communicative and keep trying each question given till end. Never give up!

Application process
Where: Campus
Eligibility: Above 7 CGPA, No criteria, Need two development projects on Resume
Resume Tip
Resume tip

Tip 1 : Do include Projects with Live link in resume
Tip 2 : Do Choose simple Format of Word, Don't include to much designing

Interview rounds
01
Round
Hard
Online Coding Interview
Duration60 Minutes
Interview date12 Aug 2021
Coding problem2

Timings: Early morning 7am (60 mins )
Subsection 1 (30 mins): MCQ round having 30 questions of 11th and 12th Math (complex numbers, trigonometry, calculas), Probability (Expectancy, bayes theorem, other probability question), Coding (Input/Output Question, Time complexity, Stack Push and Pop, Prefix, Postfix).
Subsection 2 (30 mins): 2 Coding Question 1 easy level (Find max in array), other was medium level (Find all the elements in tree which are at same level, where level is depth of smallest path from root to leaf)

Questions were different for each candidate

1. Given an array find the maximum element in array.
Easy
15m average time
85% success
0/40
Asked in companies
JP MorganWalmartFacebook

You are given an array of N elements. This array represents the digits of a number. In an operation, you can swap the value at any two indices. Your task is to find the maximum nu...

View more
Try solving now
2. Finding Paths
Moderate
25m average time
75% success
0/80
Asked in companies
JP MorganMedia.netSamsung R&D Institute

Kevin ...

View more
Try solving now
02
Round
Medium
Video Call
Duration30 minutes
Interview date12 Aug 2021
Coding problem2

Interviewer greeted me and told this round is only on Probability.(This was scheduled same day at 3pm)
He asked Following Probability questions:
Q1: What is Random variable?
Q2: What is Sample space?
Q3: What is Conditional Probability? followed by a Numerical on it.
Q4: What is a Normal Distribution?
Q5: What is Bayes theorem? followed by a numerical on it.
Q6: probability of car accident in one hour is 1/4. What is the probability of accident in half hour?
Q7: Two die are thrown, what is the probability of getting multiple of 3. 
Q8: There is 10 Black socks in drawer, 10 white socks. What is the minimum number of socks we need to pick out such that we get a pair?

1. Aptitude Question

probability of car accident in one hour is 1/4. What is the probability of accident in half hour?

2. Aptitude Question

There is 10 Black socks in drawer, 10 white socks. What is the minimum number of socks we need to pick out such that we get a pair?

Problem approach

Tip 1:
Tip 2:
Tip 3:

03
Round
Medium
Video Call
Duration30 minutes
Interview date12 Aug 2021
Coding problem1

Interviewer greeted me and told this round is only on Basic DSA.(This was scheduled same day at 3:30pm)
He asked Following questions:
Q1: Introduction and Explain your resume?
Q2: What if we have one class (which has array functionality) and other class (stack) which we will inherit from array class what could possibly go wrong here?
Q3: What is Static data member in Classes?
Q4: What is Static member function in Classes? Can static member functions call normal data member of classes?
Q5: you are given a 2D grid, each index has some value associated with it. From Bottom right cornor you need to find a path till Top left cornor where you can get maximum sum of values from index occuring on the path, You can go in Up direction, Left direction or diagonal up-left direction? 

I was asked for approach (No coding was done on compiler)

Moderate
20m average time
80% success
0/80
Asked in companies
Deutsche BankMicrosoftMeesho

You are given an ‘M*N’ Matrix, You need to print all possible paths from its top left corner to the bottom right corner if given that you can either move right i.e from (i,j) to (i,...

View more
Try solving now
04
Round
Easy
Video Call
Duration15 minutes
Interview date12 Aug 2021
Coding problem2

This round happened around 5pm in evening, i got the call from the interviewer to join Zoom call immediately. In this round (it was kind of rapid fire round on DSA,)
Following questions were asked:
Q1: Introduce yourself and explain your resume.
Q2: What is your favorite data structure and why? I said it is Deque, as it is can be helpful in many questions
Q3: Explain what are segment trees. Also give a question were we can use them.
Q4: What are tries, and give one application of tries.
Q5: Given one array you need to give approach to find out all the permutation of the elements in it. (I gave recursive approach)
Q6: Given the same array and value k, you need to tell if sum of subset can be equal to k. (This question is modification of 0/1 Knapsack. I explained the recursive approach)

Interviewer told me to wait for last HR round (I was on cloud 9 after listening to this as it was elimination round)

1. Find Permutation
Moderate
25m average time
65% success
0/80
Asked in companies
Goldman SachsGoogleJP Morgan

You are given an integer ‘N’. You need to find an array of size 2*N that satisfies the following two conditions.

1. All numbers from 1 to N should appear exactly twice in the array.

View more
Try solving now
2. Subset Sum Equal To K
Moderate
30m average time
65% success
0/80
Asked in companies
JP MorganSiemensAmazon

You are given an array/list ‘ARR’ of ‘N’ positive integers and an integer ‘K’. Your task is to check if there exists a subset in ‘ARR’ with a sum equal to ‘K’.

View more
Try solving now
05
Round
Easy
Video Call
Duration20 Minutes
Interview date12 Aug 2021
Coding problem1

This round happened around 6:30pm in evening, i got the call from the interviewer to join Zoom call immediately. It was HR+(Probability mix round).
He asked me following questions:
Q1: Introduce and explain your resume.
As i was unable to solve 2 probability question in Round 2. The interviewer immediately asked me 2 probability questions back to back.
Q2: What is bayes theorem and a numerical on it.
Q3: If there is a frog which can go one step forward with probability 3/4. and one step backward with 1/4. What is expectancy to reach 7 steps forward.

I was unable to solve the last probability ques. Was on right track almost in end of interview.
2/18 students were selected for intern JPMC(Quant Research @ 1.5Lakhs stipend)

1. Aptitude Question

If there is a frog which can go one step forward with probability 3/4. and one step backward with 1/4. What is expectancy to reach 7 steps forward.

Start a Discussion
Similar interview experiences
company logo
SDE - Intern
3 rounds | 2 problems
Interviewed by JP Morgan
606 views
0 comments
0 upvotes
company logo
R&D Intern
4 rounds | 4 problems
Interviewed by JP Morgan
488 views
0 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by JP Morgan
1756 views
0 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 4 problems
Interviewed by JP Morgan
730 views
0 comments
0 upvotes