JP Morgan interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
JP Morgan
3 rounds | 5 Coding
problems
Rejected
Interview preparation journey
Journey
I started my coding journey on youtube, where I first learned the data structure and Algorithm. Then I started my preparation of Data Structure on the LinkedIn.
Application story
Company visited to your campus for the placement .
Why selected/rejected for the role?
I think i was rejected because i was not able to answer all the question correctly under the given time of the interview
Preparation
Duration: 4 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip 1 - Practice Atleast 250 Questions
Tip 2 - Ex- Do atleast 2 projects
Application process
Where: Campus
Eligibility: Above 7 CGPA
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
Interview rounds
01
Round
Easy
Video Call
Duration60 mins
Interview date15 Oct 2022
Coding problem1
1. Spiral Matrix
Easy
15m average time
80% success
0/40
Asked in companies
You are given a 2-D array 'MATRIX' of dimensions N x M, of integers. You need to return the spiral path of the matrix.
Example Of Spiral Path:
Problem approach
You are given a 2-D array 'MATRIX' of dimensions N x M, of integers. You need to return the spiral path of the matrix.
02
Round
Easy
Video Call
Duration60 mins
Interview date15 Oct 2022
Coding problem2
1. Design Question
Design KYC System where in you will accept all the important documents and register that across all paytm platforms.
Problem approach
Tip 1: Keep in mind the flexibility that we need so that new additions can be done in the future wrt any info.
Tip 2: Design should be loosely coupled.
Tip 3: Get the requirements beforehand.
2. Design Question
Design elevator
Problem approach
Tip 1: understand the requirements and ask questions to check what exactly one is looking out for.
Tip 2: Follow the design patterns as much as you can.
Tip 3: Follow the oops concepts
03
Round
Easy
Video Call
Duration60 mins
Interview date15 Oct 2022
Coding problem2
1. Cousins of Given Node in Binary Tree
Moderate
10m average time
90% success
0/80
Asked in companies
Given a binary tree of N nodes and a node of this tree, you need to return a list containing the values of the cousins of the given node in the given binary tree sorted by non-decreasing order of their values.
Note:
Two nodes of a binary tree are cousins if they have the same depth or level, but have different parents.
No two nodes in the given binary tree will have the same data values.
Example :
Problem approach
Given a binary tree of N nodes and a node of this tree, you need to return a list containing the values of the cousins of the given node in the given binary tree sorted by non-decreasing order of their values.
2. Design Question
Design API rate limiter
Problem approach
Tip 1: understand the requirements and ask questions to check what exactly one is looking out for.
Tip 2: Follow the design patterns as much as you can.
Tip 3: Follow the oops concepts
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
To make an AI less repetitive in a long paragraph, you should increase:
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 4 problems
Interviewed by JP Morgan
Selected 
0 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by JP Morgan
Rejected
1058 views
0 comments
0 upvotes
SDE - 1
4 rounds | 8 problems
Interviewed by JP Morgan
Rejected
3132 views
0 comments
0 upvotes
SDE - 1
1 rounds | 2 problems
Interviewed by JP Morgan
Rejected
3168 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 114453 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 57719 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 34914 views
7 comments
0 upvotes