Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
JP Morgan interview experience Real time questions & tips from candidates to crack your interview

SDE - Intern

JP Morgan
upvote
share-icon
4 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 12 Months
Topics: Data Structure, DBMS, OS, Dynamic Programming, OOPs, Algorithms
Tip
Tip

Tip 1 : Practice atleast 350 Questions.
Tip 2 : keep your DS & algo part very strong.
Tip 3 : work on your communication skills.

Application process
Where: Campus
Eligibility: No criteria
Resume Tip
Resume tip

Tip 1 : Keep it short and concise.
Tip 2 : have some good projects on resume.

Interview rounds

01
Round
Hard
Online Coding Interview
Duration45 Minutes
Interview date16 Sep 2020
Coding problem2

It was an online test on hackerrank. They asked us to turn on video and audio of laptop. It consisted of two programming questions. After Round 1 around 54 were shortlisted for the technical interview process.

1. Sort An Array of 0s, 1s and 2s

Easy
10m average time
90% success
0/40
Asked in companies
SamsungDirectiZS Associates

You have been given an array/list 'arr' consisting of 'n' elements.


Each element in the array is either 0, 1 or 2.


Sort this array/list in increasing order.


Do not make a new array/list. Make changes in the given array/list.


Example :
Input: 'arr' = [2, 2, 2, 2, 0, 0, 1, 0]

Output: Final 'arr' = [0, 0, 0, 1, 2, 2, 2, 2]

Explanation: The array is sorted in increasing order.
Try solving now

2. Shortest Path in a Binary Matrix

Moderate
37m average time
65% success
0/80
Asked in companies
SamsungGoogleOracle

You have been given a binary matrix of size 'N' * 'M' where each element is either 0 or 1. You are also given a source and a destination cell, both of them lie within the matrix.

Your task is to find the length of the shortest path from the source cell to the destination cell only consisting of 1s. If there is no path from source to destination cell, return -1.

Note:
1. Coordinates of the cells are given in 0-based indexing.
2. You can move in 4 directions (Up, Down, Left, Right) from a cell.
3. The length of the path is the number of 1s lying in the path.
4. The source cell is always filled with 1.
For example -
1 0 1
1 1 1
1 1 1
For the given binary matrix and source cell(0,0) and destination cell(0,2). Few valid paths consisting of only 1s are

X 0 X     X 0 X 
X X X     X 1 X 
1 1 1     X X X 
The length of the shortest path is 5.
Try solving now
02
Round
Easy
Video Call
Duration60 Minutes
Interview date18 Sep 2020
Coding problem2

It was a technical interview. It was on a Zoom call, and we have to write code on hackerrank. Then he asked the languages I code, I told him C++. Then he asked me two coding questions:

1. Given an array, print all the pairs which have a sum equal to the given number.
2. Given string print, a word with a maximum number of occurrences, and I have to think of all the worst cases. Then he asked me to solve the same question using another approach.
There was a discussion on time and space complexity in both the question.

Then he asked me why do you want to join JPMC and then asked me if I have any questions from him.

1. Pair Sum

Easy
15m average time
90% success
0/40
Asked in companies
AccentureGrofersOla

You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to return the list of all pairs of elements such that each sum of elements of each pair equals 'S'.

Note:

Each pair should be sorted i.e the first value should be less than or equals to the second value. 

Return the list of pairs sorted in non-decreasing order of their first value. In case if two pairs have the same first value, the pair with a smaller second value should come first.
Try solving now

2. Most Frequent Word

Easy
0/40
Asked in companies
JP MorganSalesforceIBM

You are given a paragraph that may have letters both in lowercase and uppercase, spaces, and punctuation. You have also given a list of banned words. Now your task is to find the most frequent word which is not in the list of banned words. There will always be a solution, and the solution will be unique.

While comparing words, you can ignore whether the letter is lowercase or uppercase. For example, ‘AsK’ and ‘aSK’ are the same. The words will always contain only alphabets or we can say words will be separated by spaces or punctuation. The answer will be in uppercase letters.

The words in the banned list will always be in upper letters and free from punctuation and spaces.

For example :

Paragraph = ‘It's a square SqUare. It's a FLAT flat.’ 
Banned =[FLAT, IT, S]. 
So we can see these words [IT, S, SQUARE, FLAT ]  are most frequent.
Now we will look at to banned list and we can see 3 of the words are banned.
So we have a unique answer SQUARE which has a frequency of 2 and not on the banned list.
Try solving now
03
Round
Medium
Video Call
Duration45 Minutes
Interview date16 Sep 2020
Coding problem0

It was Technical round two. There was a discussion on the resume. He asked me to explain to him my 1st project. As my projects were of ML, so he asked me some basic questions on ML, like how do you handle small datasets, how does Gradient boosting work, and some other fundamental ML questions. Then asked me about my family background and also asked me that you are from Chemical Engineering, so how you gain interest in coding, machine learning.

After this round, we were not told how many students were selected for the HR round, but I was one of them.

04
Round
Medium
Video Call
Duration45 Minutes
Interview date18 Nov 2020
Coding problem0

This was the HR round. The interviewer was very helpful and supporting. He asked me to introduce myself. He asked me a couple of things of resume. He then asked me why you want to join JPMC and then asked what you are planning to learn in the next 7-8 months. I cleared this round.

Do you know this?

TikTok uses _________ to recursively display trending videos ensuring your feed is filled with new content.

Start a Discussion
Similar interview experiences
company logo
SDE - Intern
3 rounds | 5 problems
Interviewed by JP Morgan
937 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 5 problems
Interviewed by JP Morgan
0 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 4 problems
Interviewed by JP Morgan
724 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 3 problems
Interviewed by JP Morgan
699 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
13394 views
4 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
12443 views
1 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
8937 views
2 comments
0 upvotes