i
JPMorgan Chase &
Co.
Proud winner of ABECA 2025 - AmbitionBox Employee Choice Awards
Filter interviews by
Design a parking system with different types of parking spots
Create classes for different types of parking spots (e.g. compact, regular, handicap)
Implement methods for checking availability, reserving, and releasing spots
Consider implementing a parking lot class to manage all parking spots
Count substrings with unique characters in a given string
Use a sliding window approach to keep track of unique characters in a substring
Use a set to store characters in the current window and update the window accordingly
Increment the count of valid substrings whenever a new character is added to the set
Debugging a Java code involves identifying and fixing errors in the code to ensure it runs correctly.
Start by understanding the error message or symptoms of the issue.
Use debugging tools like breakpoints, watches, and logging to track the flow of the code.
Review the code logic and check for common mistakes like typos, incorrect variable assignments, or logic errors.
Test different scenarios to reproduce the issue a...
Given a pattern as a string and a set of words, determine if the pattern and the words list align in the same sequence.
T (number of test cases)
For each test cas...
The problem involves determining if a given pattern aligns with a list of words in the same sequence.
Iterate through the pattern and words list simultaneously to check for matching sequences.
Use a hashmap to store the mapping between characters in the pattern and words in the list.
Compare the mappings to determine if the pattern and words align in the same sequence.
What people are saying about JPMorgan Chase & Co.
Given an integer array ARR
of size N
, perform the following operations:
- update(l, r, val):
Add (val + i)
to arr[l + i]
for all 0 ≤ i ≤ r - l
.
- rangeSum...
Implement update and rangeSum operations on an integer array based on given queries.
Implement update(l, r, val) by adding (val + i) to arr[l + i] for all i in range (0, r - l).
Implement rangeSum(l, r) to return the sum of elements in the array from index l to r.
Handle queries using 1-based indexing.
Ensure constraints are met for input values.
Output the sum of arr[l..r] for each rangeSum operation.
Given a 2-D matrix mat
with 'N' rows and 'M' columns, where each element at position (i, j) is mat[i][j]
, determine the length of the longest increasing ...
The problem involves finding the length of the longest increasing path in a 2-D matrix starting from a given cell.
Use dynamic programming to keep track of the longest increasing path starting from each cell.
Implement a recursive function to explore all possible paths from a cell.
Update the length of the longest path for each cell based on the maximum path length from its neighbors.
Consider edge cases such as bound...
I applied via Approached by Company and was interviewed in Jul 2024. There were 3 interview rounds.
DSA, Leetcode medium -2 problems
Count substrings with unique characters in a given string
Use a sliding window approach to keep track of unique characters in a substring
Use a set to store characters in the current window and update the window accordingly
Increment the count of valid substrings whenever a new character is added to the set
Debugging a Java code involves identifying and fixing errors in the code to ensure it runs correctly.
Start by understanding the error message or symptoms of the issue.
Use debugging tools like breakpoints, watches, and logging to track the flow of the code.
Review the code logic and check for common mistakes like typos, incorrect variable assignments, or logic errors.
Test different scenarios to reproduce the issue and na...
Design a parking system with different types of parking spots
Create classes for different types of parking spots (e.g. compact, regular, handicap)
Implement methods for checking availability, reserving, and releasing spots
Consider implementing a parking lot class to manage all parking spots
I appeared for an interview in Mar 2021.
Round duration - 80 minutes
Round difficulty - Medium
Given a 2-D matrix mat
with 'N' rows and 'M' columns, where each element at position (i, j) is mat[i][j]
, determine the length of the longest increasing...
The problem involves finding the length of the longest increasing path in a 2-D matrix starting from a given cell.
Use dynamic programming to keep track of the longest increasing path starting from each cell.
Implement a recursive function to explore all possible paths from a cell.
Update the length of the longest path for each cell based on the maximum path length from its neighbors.
Consider edge cases such as boundary c...
Round duration - 50 minutes
Round difficulty - Hard
It was purely Data Structures and Maths.
Given an integer array ARR
of size N
, perform the following operations:
- update(l, r, val):
Add (val + i)
to arr[l + i]
for all 0 ≤ i ≤ r - l
.
- rangeSu...
Implement update and rangeSum operations on an integer array based on given queries.
Implement update(l, r, val) by adding (val + i) to arr[l + i] for all i in range (0, r - l).
Implement rangeSum(l, r) to return the sum of elements in the array from index l to r.
Handle queries using 1-based indexing.
Ensure constraints are met for input values.
Output the sum of arr[l..r] for each rangeSum operation.
Round duration - 70 Minutes
Round difficulty - Easy
Round duration - 30 Minutes
Round difficulty - Easy
Given a pattern as a string and a set of words, determine if the pattern and the words list align in the same sequence.
T (number of test cases)
For each test ca...
The problem involves determining if a given pattern aligns with a list of words in the same sequence.
Iterate through the pattern and words list simultaneously to check for matching sequences.
Use a hashmap to store the mapping between characters in the pattern and words in the list.
Compare the mappings to determine if the pattern and words align in the same sequence.
Tip 1 : I solved Interviewbit mostly
Tip 2 : Revised my Coding Ninjas Course
Tip 3 : Created One Project (Helped me a lot during Design Interview )
Tip 1 : I have done some internship as a Software Developer.
Tip 2 : Have some good project on my resume.
I appeared for an interview in Jan 2022.
Round duration - 60 minutes
Round difficulty - Easy
It was a L1 technical round where questions from DS algo were asked, along with my work exp and projects. It was a face to face video round with 2 panel members
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
Count the number of islands in a 2D matrix of 1s and 0s.
Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.
Maintain a visited array to keep track of visited cells to avoid revisiting them.
Increment the island count each time a new island is encountered.
Consider all eight possible directions for connectivity between cells.
Handle edge cases like out of bo...
Prevent breaking singleton pattern using reflections by throwing an exception in the private constructor.
Throw an exception in the private constructor if an instance already exists.
Use a flag to track if an instance has been created and throw an exception if an attempt is made to create another instance.
Use enums to create a singleton to prevent reflection attacks.
Round duration - 30 minutes
Round difficulty - Medium
It was a System design round and the interviewer was very friendly, he gave ample hints and it was a productive interaction.
Design an LRU cache to store and retrieve data based on least recently used policy.
Use a doubly linked list to keep track of the order of usage of the cache entries.
Maintain a hash map to quickly access the cache entries based on their keys.
When a new entry is accessed, move it to the front of the linked list to mark it as the most recently used.
If the cache is full, remove the least recently used entry from the end of...
Round duration - 45 minutes
Round difficulty - Easy
It was a standard manager where I was asked many questions related to my work exp and behavioural questions
Tip 1 : Focus on Core Java and development
Tip 2 : Practise easy -medium questions
Tip 1 : Projects should be well defined use bullet points
Tip 2 : Describe your work ex/ intern exp well
I appeared for an interview in May 2022.
Round duration - 60 minutes
Round difficulty - Medium
Round started with an intro about the project. In my project i have mentioned that i had use Cassandra. The interviewer asked why use Cassandra , why not other No Sql database.
After that the interviewer started asking about the java concepts. How exception propagate takes in case of polymorphism.
There a question about multilevel inheritance. There were three classes parent, child , grandchild in a multlevel inheritance.
All three classes have a function with same name.
Question was about if we call a method something like this
Parent p = new Grandchild();
p.method1();
which class method would be called
You are provided with an integer array ARR
of length 'N'. Your objective is to determine the first missing positive integer using linear time and constant space. T...
Find the smallest missing positive integer in an array efficiently.
Iterate through the array and mark positive integers as visited using index as value
Iterate through the marked array to find the first missing positive integer
Handle negative numbers by ignoring them during marking process
Round duration - 60 minutes
Round difficulty - Medium
Interviewer started with some questions about Database locks .
I had to prepare a low level design of the library management system.
Then there were follow up questions regarding how many database table you will use, normalizing those databse table, writing the service logic for one of the functionality
A Library Management System to manage books, users, and transactions.
Create a database to store information about books, users, and transactions.
Implement functions to add, update, and delete books and users.
Allow users to check out and return books, with due date tracking.
Generate reports on book availability, user activity, and overdue books.
Round duration - 30 Minutes
Round difficulty - Easy
It was managerial round. They asked few questions about the project and why you use this particular technology.
Tip 1 : Be very clear with java basics, polymorphism in multilevel inheritance. Future, callable, completable furture in concurrency, stream api.Concurrent hash map, Database locks , how Database indexes are fast.
Tip 2 : In 2 round they are going to make you do a low level design for an application. In my case it was library management system, Be ready for the follow up questions like how many tables are you going to use this low level design, normalizing the tables you have used. Write logic for one of the service in the low level design.
Tip 3 : For the managerial round, you should know why you used this partcular tech stack.
Tip 1 : Only mention those things in projects which you have really done in your organization. Morgan stanley is particular rigorous about the projects.
Tip 2 : Be sure to highlight what business values your project brought to the organization
What people are saying about JPMorgan Chase & Co.
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
It was a cumulative test
You are given an array ARR
of long type, which represents an elevation map where ARR[i]
denotes the elevation of the ith
bar. Calculate the total amount of rainwater t...
Calculate the total amount of rainwater that can be trapped within given elevation map.
Iterate through the array to find the maximum height on the left and right of each bar.
Calculate the amount of water that can be trapped above each bar by taking the minimum of the maximum heights on the left and right.
Sum up the trapped water above each bar to get the total trapped water for the elevation map.
Round duration - 90 minutes
Round difficulty - Medium
It was sophisticated in nature and a good brain buster.
Prateek is a kindergarten teacher with a mission to distribute candies to students based on their performance. Each student must get at least one candy, and if two s...
Determine the minimum number of candies needed to distribute to students based on their performance and ratings.
Iterate through the array of student ratings and assign 1 candy to each student initially.
Then iterate from left to right and check if the current student's rating is higher than the previous student, if so, assign candies accordingly.
Similarly, iterate from right to left to handle cases where the current stu...
Round duration - 1 hour
Round difficulty - Medium
It revolved around basic concepts
DBMS is a software system that manages databases and allows users to interact with data stored in them.
DBMS stands for Database Management System
It helps in creating, updating, and managing databases
Examples of DBMS include MySQL, Oracle, SQL Server
It ensures data integrity, security, and efficient retrieval
Round duration - 70 minutes
Round difficulty - Hard
It was a great experience
Tip 1 : Stay consistent with your efforts
Tip 2 : Work hard with honesty
Tip 3 : Try to set goal of +1 level from the goal you want to achieve
Tip 1 : Present yourself with honesty
Tip 2 : Mention about the Workshops, hackathons, achievements, and the projects.
I appeared for an interview before Sep 2020.
Round duration - 30 minutes
Round difficulty - Easy
It was in the day time. I was asked the programming language of my choice. It was mostly focused on programming fundamentals. I was asked 2 questions based on Data Structures and Algorithms.
A loop in a linked list can be detected using Floyd's Cycle Detection Algorithm.
Use two pointers - slow and fast, where slow moves one step at a time and fast moves two steps at a time.
If there is a loop, the two pointers will eventually meet at some point within the loop.
To detect the start of the loop, reset one pointer to the head and move both pointers one step at a time until they meet again.
Round duration - 30 minutes
Round difficulty - Easy
This round was mostly focused on my resume and projects.
Round duration - 30 minutes
Round difficulty - Easy
It was in the evening. I went to their office in Gurgaon. It was taken by one of the technology director who had a lot of experience.
Do practice a lot of data structures questions as mostly questions in interviews are based on them. Also, do prepare for projects mentioned in your resume and skills which you have mentioned. Coding ninjas has a big hand in making my interview clear as I have taken a course from the coding Ninjas which helped me a lot to make my concepts clear.
Application resume tips for other job seekersKeep it short and crisp. Go through it properly before the interview. Make sure that you haven't put anything in it that can cause you problems during the interview.
Final outcome of the interviewSelectedI applied via Campus Placement and was interviewed before Nov 2021. There were 3 interview rounds.
Moderate level aptitude with basics
Moderate level data structure questions
I applied via Company Website and was interviewed in Oct 2019. There were 3 interview rounds.
I applied via Recruitment Consultant and was interviewed before Jun 2020. There were 3 interview rounds.
based on 1 interview experience
Difficulty level
Duration
Associate
11.2k
salaries
| ₹10 L/yr - ₹36.5 L/yr |
Team Lead
5.8k
salaries
| ₹4.5 L/yr - ₹17 L/yr |
Vice President
4.3k
salaries
| ₹27 L/yr - ₹70 L/yr |
Senior Associate
2.8k
salaries
| ₹14 L/yr - ₹53 L/yr |
Analyst
2.8k
salaries
| ₹6.5 L/yr - ₹26.2 L/yr |
Morgan Stanley
Goldman Sachs
TCS
Bank of America