JP Morgan interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
JP Morgan
4 rounds | 8 Coding
problems
Rejected
Interview preparation journey
Journey
Hello all, I am Rahul Patel, I'm from Vadodara, Gujarat. I would like to share my journey. So i was looking for change the jobs from TCS, I've applied threw LinkedIn, Naukri and other many site. But i didn't get any interview call, later I found some mutual friend who is working in Jp Morgan so i applied threw him and i got interview call by them, there were 4 round of interview.
This round is coding round, and it was all about 25 minutes, they have given me 3 coding problem where i need to solve any 2 coding problem with successful testcases in 25 minutes. I solved that
Application story
So I was looking for change the jobs, I've applied threw LinkedIn, Naukri and other many site. But i didn't get selected, later I found my mutual friend who is working in JP Morgan so I applied through him and I got interview call by them,
Why selected/rejected for the role?
Rejected, I am disappointed to learn that I was not selected for the role, because somehow i missed some preparation for system design though i did good according to my potentials
Preparation
Duration: 2 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip 1 : Prepare resume short and do not put false things
Tip 2 : Do atleast 2 projects
Application process
Where: Referral
Eligibility: No criteria
Tip 1 : Do not put wrong things on resume.
Tip 2 : Keep it as short as possible
Interview rounds
01
Round
Easy
Online Coding Test
Duration30 minutes
Interview date24 Dec 2022
Coding problem3
It was mcq test and 1st round, this question paper consists of data structure, algorithms, system design and dbms questions
1. DSA
1. Which of the following sorting algorithms has the worst time complexity?
2. Which data structure is used for implementing a stack?
3. Which of the following data structures is not a linear data structure?
2. DBMS
1. Database operation that combines two or more tables to create a new table with data from both tables?
2. Database operation that allows you to retrieve data from one or more tables based on specific conditions?
3. System Design
1. Which of the following is not an essential aspect of designing a scalable system?
2. Which of the following is a common technique for achieving fault tolerance in a distributed system?
3. Which of the following is a database architecture that allows for horizontal scaling by dividing the database into multiple shards, each of which can be hosted on a separate server?
02
Round
Easy
Online Coding Test
Duration30 minutes
Interview date28 Dec 2021
Coding problem1
It was medium DSA coding questions and round was about 30 minutes.
1. Factorial of a Number
Moderate
25m average time
70% success
0/80
Asked in companies
You are given an integer ‘N’. You have to print the value of Factorial of ‘N’. The Factorial of a number ‘N’ is defined as the product of all numbers from 1 to ‘N’.
For Example:
Consider if ‘N’ = 4, the Factorial of 4 will be the product of all numbers from 1 to 4, which is 1 * 2 * 3 * 4 = 24. Hence, the answer is 24.
Problem approach
Step 1 : Define the base case. If the number is 0 or 1, the factorial is 1.
Step 2 : Define the recursive case. The factorial of a number n is n multiplied by the factorial of (n-1).
Step 3 : Write the code for the function.
03
Round
Easy
Online Coding Test
Duration40 minutes
Interview date29 Dec 2022
Coding problem3
It was Hard questions of DSA and few system design questions, I'm mentioning questions below
1. Valid Parentheses
Easy
10m average time
80% success
0/40
Asked in companies
You're given a string 'S' consisting of "{", "}", "(", ")", "[" and "]" .
Return true if the given string 'S' is balanced, else return false.
For example:
'S' = "{}()".
There is always an opening brace before a closing brace i.e. '{' before '}', '(' before ').
So the 'S' is Balanced.
Problem approach
Create an empty stack.
Loop through each character in the input string.
If the current character is an opening bracket (i.e., '(', '[', or '{'), push it onto the stack.
If the current character is a closing bracket (i.e., ')', ']', or '}'), pop the top element from the stack and compare it to the current character. If they do not match, return false.
After iterating through all characters, if the stack is empty, return true. Otherwise, return false.
2. Reverse Linked List
Moderate
15m average time
85% success
0/80
Asked in companies
Given a singly linked list of integers. Your task is to return the head of the reversed linked list.
For example:
The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.
Follow Up :
Can you solve this problem in O(N) time and O(1) space complexity?
Problem approach
Initialize three pointers: prev, curr, and next. Set prev to None and curr to the head of the linked list.
Traverse the linked list, updating pointers as follows:
a. Set next to the next node after curr.
b. Set curr's next pointer to prev.
c. Set prev to curr.
d. Set curr to next.
When the end of the linked list is reached, set the head of the linked list to prev
3. System Design
Design a simple URL shortener service that takes a long URL as input and generates a short URL that redirects to the original long URL.
Problem approach
Choose a unique short URL format. One approach is to use a base-62 encoding scheme that converts a unique ID to a string consisting of digits and lowercase/uppercase letters.
Use a key-value store (such as Redis) to store the mappings between the short URLs and their corresponding long URLs.
Set up a web server (such as Nginx) to handle incoming requests to the short URLs.
When a new long URL is submitted to the service, generate a unique ID (e.g., using a counter in Redis).
Encode the ID into a short URL using the chosen format (e.g., base-62).
Store the mapping between the short URL and the long URL in the key-value store.
When a user requests a short URL, look up the corresponding long URL in the key-value store and redirect the user to that URL.
04
Round
Easy
HR Round
Duration20 minutes
Interview date30 Dec 2022
Coding problem1
1. Basic HR Questions
What are your greatest strengths and weaknesses?
Why do you want to work for our company?
What are your long-term career goals?
Why did you leave your previous job?
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
4 rounds | 13 problems
Interviewed by JP Morgan
Selected 
1865 views
0 comments
0 upvotes
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
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