AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
JPMorgan Chase & Co.
Compare
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
JPMorgan Chase & Co. SDE-2 Interview Questions and Answers for Experienced
JPMorgan Chase & Co. SDE-2 Interview Experiences for Experienced
1 interview found
Anonymous
I appeared for an interview in Mar 2021.
(1 Question)
Round duration - 80 minutes
Round difficulty - Medium
- Q1.
Longest Increasing Path in Matrix Problem Statement
Given a 2-D matrix
matwith 'N' rows and 'M' columns, where each element at position (i, j) ismat[i][j], determine the length of the longest increasing... - Ans.
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...
(1 Question)
Round duration - 50 minutes
Round difficulty - Hard
It was purely Data Structures and Maths.
- Q1.
Arithmetic Progression Queries Problem Statement
Given an integer array
ARRof sizeN, perform the following operations:-
update(l, r, val):Add(val + i)toarr[l + i]for all0 ≤ i ≤ r - l.-
rangeSu... - Ans.
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
(1 Question)
Round duration - 30 Minutes
Round difficulty - Easy
- Q1.
Pattern Matching Problem Statement
Given a pattern as a string and a set of words, determine if the pattern and the words list align in the same sequence.
Input:
T (number of test cases)
For each test ca... - Ans.
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.
Interview Preparation Tips
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.
Skills evaluated in this interview
Interview questions from similar companies
I appeared for an interview in May 2022.
(1 Question)
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
- Q1.
First Missing Positive Problem Statement
You are provided with an integer array
ARRof length 'N'. Your objective is to determine the first missing positive integer using linear time and constant space. T... - Ans.
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
(1 Question)
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
- Q1. Design a Library Management System.
- Ans.
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.
(1 Question)
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.
- Q1. Can you explain your project and the reasons for using this particular technology?
Interview Preparation Tips
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
Skills evaluated in this interview
I appeared for an interview in Jan 2022.
(2 Questions)
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
- Q1.
Number of Islands Problem Statement
You are provided with a 2-dimensional matrix having
Nrows andMcolumns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t... - Ans.
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
- Q2. How can you prevent the breaking of the singleton pattern using reflections?
- Ans.
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.
(1 Question)
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.
- Q1. Design an LRU (Least Recently Used) cache.
- Ans.
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
Interview Preparation Tips
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
Skills evaluated in this interview
I applied via Naukri.com and was interviewed before Apr 2020. There were 3 interview rounds.
Interview Questionnaire
1 Question
- Q1. 1. Explain SCD Type 2 Implementation in Informatica
- Ans.
SCD Type 2 is a technique used to track historical changes in data over time in a data warehouse.
SCD Type 2 maintains a separate row for each change in data, with a start and end date.
It requires a surrogate key to uniquely identify each row.
Informatica provides a built-in SCD Type 2 transformation to implement this technique.
Example: tracking changes in customer addresses over time.
Interview Preparation Tips
Skills evaluated in this interview
I applied via Referral and was interviewed before Sep 2020. There were 3 interview rounds.
Interview Questionnaire
1 Question
- Q1. Questions related to Python, my former organisation, why do you want to shift, questions related to different types of risk
Interview Preparation Tips
Communication must be good
Answer questions if you can, if you don’t know just accept you don’t know
I applied via Naukri.com and was interviewed before Apr 2020. There were 3 interview rounds.
Interview Questionnaire
1 Question
- Q1. Basic accounting questions, knowledge testing of Finance and Financial Statements.
Interview Preparation Tips
I appeared for an interview in Sep 2020.
Interview Questionnaire
1 Question
- Q1. Walk me through your CV
Interview Preparation Tips
Interview Experience was fine as they are particular about their timings and both rounds took 30 mins each.
Interview Preparation Tips
Experience: Technical on paper test questions:(dis was only for 12 among d 26 shortlisted ppl after apti...others directly had interviews)
5 wer selected in this test who wer nw sent for interviews
TECHNICAL INTERVIEW: (pls list the questions asked in all the rounds)
26 shortlisted after apti (14 directly for interviews & 12 had one more technical on paper test...mentioned above)
der wer min 2 technical rounds for each of them...max were 5
- You are given course dependencies
A->B,C
B->D
C->A
D->nothing
The above dependencies mean...if you want to take course A...you should take courses B and C first....To take B,Course D must be taken first....D is an independent course and can be taken without any prior requirements.
Now you are told these dependencies.Come up with an appropriate data structure to represent these dependencies.Then write a code that finds out all the courses that the student can take up...in this case the student can first take course D because its independent.Now that course D has been taken he can next take up B as it depends on B alone...But the courses A and C can never be taken because they depend on each other...So here all the courses that can be taken are B and D.
After i wrote the code....he asked for all possible test cases
-Given an array of length N....It can be filled with nos. only from 1 to N....find which nos are repeated in the array
-Given pointers to two nodes in a binary tree....find their least common ancestor...each node has pointer to only the parent node...not the left and right child..
-In a binary tree(Not necessarily a BST)...suppose the weight of any node is defined as the product of the key value of the node and the level of the node(Root at level 1)...find the node with maximum weight in the binary tree
-A sorted array of size n is right circularly rotated k times and this rotated array is given to you as input...Find out the value of k in log n time .
-There are some processes running at time T....and there are processes running at time T+30.
You have to find out
1)Which processes died at time T+30,which were alive at time T
2)Which are the new processes at time T+30,which were not there at time T
3)Which are the processes that were there at time T and are still running at time T+30
What data structure will you use to represent the process lists and write code to find out the answers to the 3 questions above
-Given a binary search tree...and a target sum...starting at the root...which all paths add up to the target sum?...if there are multiple paths....return the path with least no. of nodes.
College Name: Veermata Jijabai Technological Institute, Mumbai [ VJTI ]
I appeared for an interview before Jun 2016.
Interview Preparation Tips
Experience: 30 questions, 30
amandeep kaur
I appeared for an interview in Jul 2017.
Interview Preparation Tips
Experience: Tell about myself
Tips: Need to talk. So they can get to know about are communication
Round: Test
Experience: It's a aptitude test of English and finance related questions askef
Duration: 1 hour
Total Questions: 80
JPMorgan Chase & Co. Interview FAQs
Tell us how to improve this page.
JPMorgan Chase & Co. Interviews By Designations
- JPMorgan Chase & Co. Associate Interview Questions
- JPMorgan Chase & Co. Analyst Interview Questions
- JPMorgan Chase & Co. Software Engineer Interview Questions
- JPMorgan Chase & Co. Senior Associate Interview Questions
- JPMorgan Chase & Co. Software Developer Interview Questions
- JPMorgan Chase & Co. Team Lead Interview Questions
- JPMorgan Chase & Co. Senior Software Engineer Interview Questions
- JPMorgan Chase & Co. Business Analyst Interview Questions
- Show more
Interview Questions for Popular Designations
Interview Questions from Similar Companies
Fast track your campus placements
|
Associate
10.4k
salaries
|  ₹10 L/yr - ₹43.4 L/yr |
|
Team Lead
5.6k
salaries
| ₹5.7 L/yr - ₹16.7 L/yr |
|
Vice President
4.1k
salaries
| ₹20 L/yr - ₹70 L/yr |
|
Analyst
2.6k
salaries
| ₹6.5 L/yr - ₹26 L/yr |
|
Software Engineer
2.6k
salaries
| ₹11 L/yr - ₹35.3 L/yr |
Morgan Stanley
Goldman Sachs
TCS
Bank of America
- Home >
- Interviews >
- JPMorgan Chase & Co. Interview Questions >
- JPMorgan Chase & Co. SDE-2 Interview Questions for Experienced
