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

Q1. Core Java, Java 8 features, OOPS Concepts, Design Patterns used in project, Spring core, Spring Security, Spring transaction management, Spring JPA
Add your answer

Q1. Project Experience, DSA related questions, scenario based questions
Add your answer

CodeVue coding test, one coding questions based on regular expressions

Q1. Contract Negotiation, Previous Experiences
Add your answer

Q1. Investment banks mostly ask multithreading questions or core concepts of java language.
Add your answer

Q1. In 2nd round also, they asked java and spring related questions.
Add your answer

There was one coding round that contains one average type algo and we have to write the program for that.

Round duration - 90 Minutes
Round difficulty - Medium

Q1. Split Binary String
Chintu has a long binary string ‘str’. A binary string is a string that contains only 0 and 1. He considers a string ‘beautiful’ if and only if the number of 0's and 1's in the ...read more
Ans. Iterative approach
The key idea in solving this problem is to simply iterate through the given string and keep the count of 1s and 0s in the string. Whenever we have the count of 1 and 0 to be equal, we increment the count of beautiful strings by 1. If we find no beautiful string, we simply return -1.
 
The algorithm will be -
 
• Take two variables ‘cnt0’ and ‘cnt1’ to store the count of 0s and 1s respectively. Als...read more
Answered Anonymously
Add your answer
Q2. Merge overlapping intervals
Given 'N' number of intervals, where each interval contains two integers denoting the boundaries of the interval. The task is to merge all the overlapping intervals and ...read more
Ans. Brute Force
1. We are given the function MERGEINTERVALS(), which takes a 2D vector representing the vector of intervals and returns another 2D vector which is the vector of merged intervals.
2. We create another function ISOVERLAP() to check if the current interval overlaps with the other interval.
3. Now we create an empty 2D vector “RES” to store finally merged intervals and another boolean vector “VIS” to mark if the current in...read more
Answered Anonymously
Add your answer

Round duration - 100 Minutes
Round difficulty - Medium

It was a video interview in which 2 questions were asked u have 2 chances for each question to record your video. It was conducted on hirepro website.
 

Round duration - 35 Minutes
Round difficulty - Easy

The interviewer asked me to explain my project, 2 situation based questions and asked to solve a question on Trees

Q1. Left View Of Binary Tree
Given a binary tree. Print the Left View of the Tree.
Example :
If the input tree is as depicted in the picture: 
The Left View of the tree will be:  2 35 2 
Input format :
...read more
Ans. Recursive Approach
This problem can be solved through recursion.We will maintain max_level variable which will keep track of maxLevel and will pass current level in recursion as argument. Whenever we see a node whose current level is more than maxLevel then we will print that node as that will be first node for that current level. Also update maxLevel with current level.
Space Complexity: O(n)Explanation:
O(N), where ‘N’...read more
Answered Anonymously
Add your answer

Round duration - 10 Minutes
Round difficulty - Easy