JPMorgan Chase & Co. Software Developer Interview Questions, Process, and Tips

Aptitude round it is very easy

Q1. Basic question there different from other
Add your answer

Very easy questions on stack and simple string questions

Q1. Project discussion
Add your answer

Q1. Why do u want to join us
Add your answer

Q1. Sorting, questions on reactive framework
Add your answer

Q1. In-depth questions for spring reactive and multi threading
Add your answer

Pseudo code on java problems

React coding to create login page

Q1. Salary discussion
Add your answer

Q1. OOPS Concepts should be clear
Add your answer
Q2. SOLID principles and explain all of them
Ans. 
SOLID principles are a set of five design principles for writing maintainable and scalable code.
• Single Responsibility Principle (SRP) - A class should have only one reason to change.

• Open/Closed Principle (OCP) - A class should be open for extension but closed for modification.

• Liskov Substitution Principle (LSP) - Subtypes should be substitutable for their base types.

• Interface Segregation Principle (ISP) - A client shou...read more
Answered by AI
Add your answer

Round duration - 65 Minutes
Round difficulty - Medium

This was an online proctured coding round where we had 2 questions to solve under 1 hour. Both the questions were preety standard and anyone with a decent grip on Data Structures and Algorithms can solve them.

Q1. 
Split Binary String Problem Statement
Chintu has a long binary string str. A binary string is a string that contains only 0 and 1. He considers a string to be 'beautiful' if and only if the number of 0's ...read more
Ans. 
Find the maximum number of beautiful substrings that a binary string can be split into.
• Count the number of 0's and 1's in the string.

• Iterate through the string and split it whenever the count of 0's and 1's becomes equal.

• Return the maximum number of beautiful substrings that can be formed.
Answered by AI
Add your answer
Q2. 
Shortest Path in a Binary Matrix Problem Statement
Given a binary matrix of size N * M where each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only...read more
Ans. 
Find the shortest path in a binary matrix from a source cell to a destination cell consisting only of 1s.
• Use Breadth First Search (BFS) algorithm to find the shortest path.

• Keep track of visited cells to avoid revisiting them.

• Update the path length as you traverse the matrix.

• Return -1 if no valid path exists.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 coding questions , the first one was related to Sorting and the second one was related to Hashing. After the coding questions, I was asked some concepts related to OOPS in general.

Q1. 
Rahul And Minimum Subarray Problem Statement
Rahul is mastering arrays. He is tasked to find the length of the smallest contiguous subarray in a given array/list ARR of size N, such that its sum exceeds a...read more
Ans. 
Find the length of the smallest subarray in a given array whose sum exceeds a specified value.
• Iterate through the array while keeping track of the sum of the current subarray.

• Use two pointers to maintain a sliding window approach to find the smallest subarray.

• Update the minimum length of the subarray whenever the sum exceeds the specified value.

• Return the length of the smallest subarray found.

• Handle cases where no suba...read more
Answered by AI
Add your answer
Q2. 
Count Subarrays with Sum Divisible by K
Given an array ARR and an integer K, your task is to count all subarrays whose sum is divisible by the given integer K.
Input:
The first line of input contains an...read more
Ans. 
Count subarrays with sum divisible by K in an array.
• Iterate through the array and keep track of prefix sum modulo K.

• Use a hashmap to store the frequency of prefix sum remainders.

• For each prefix sum remainder, count the number of subarrays that sum up to a multiple of K.

• Handle cases where the prefix sum itself is divisible by K.

• Return the total count of subarrays with sum divisible by K.
Answered by AI
Add your answer
Q3. What are virtual destructors in C++?
Ans. 
Virtual destructors in C++ are used to ensure that the correct destructor is called when deleting an object through a base class pointer.
• Virtual destructors are declared with the 'virtual' keyword in the base class to allow proper cleanup of derived class objects.

• When deleting an object through a base class pointer, having a virtual destructor ensures that the destructor of the derived class is called.

• Without a virtual...read more
Answered by AI
Add your answer
Q4. What is the difference between a constructor and a method in Object-Oriented Programming?
Ans. 
Constructor is a special method used to initialize objects, while a method is a function that performs a specific task.
• Constructor is called automatically when an object is created, while a method is called explicitly by the programmer.

• Constructors have the same name as the class, while methods have unique names.

• Constructors do not have a return type, while methods have a return type.

• Constructors are used to set initia...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 coding questions both related to Linked List followed by an interesting puzzle and then a question related to Probability.

Q1. 
Divide Linked List Into Two Problem Statement
You have been given a singly linked list of integers. Your task is to divide this list into two smaller singly linked lists wherein the nodes appear in an alt...read more
Ans. 
Divide a singly linked list into two smaller lists with nodes appearing in an alternating fashion.
• Iterate through the original linked list and assign nodes alternatively to the two smaller lists.

• Handle cases where creating either of the sub-lists is impossible by returning an empty list.

• Ensure to properly terminate the linked lists with -1 at the end of each list.

• Consider the constraints provided while implementing the...read more
Answered by AI
Add your answer
Q2. 
Intersection of Linked List Problem
You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.
Your task is to determine t...read more
Ans. 
Find the node where two linked lists merge.
• Traverse both lists to find their lengths and the difference in lengths

• Move the pointer of the longer list by the difference in lengths

• Move both pointers simultaneously until they meet at the merging point
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.

Q1. Why should we hire you?
Add your answer