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

Round duration - 65 minutes
Round difficulty - Medium

It was around 6 pm and was held on Hackerrank. Having switched on WebCam during the entire duration was mandatory. We were required to solve 2 questions under 65 mins. Solving one problem completely, along with some of the test cases of another, was enough for getting shortlisted.

Q1. 
Rearrange Words in a Sentence
You are provided with a sentence 'TEXT'. Each word in the sentence is separated by a single space, and the sentence starts with a capital letter. Your task is to rearrange th...read more
Add your answer
Q2. 
Sudoku Validity Problem Statement
You are provided with a 9 x 9 2D matrix MATRIX containing digits (1-9) and empty cells indicated by 0.
Your task is to determine if there exists a method to fill all emp...read more
Add your answer

Round duration - 35 minutes
Round difficulty - Medium

The interview started with my brief introduction, and the interviewer then proceeded to ask some questions. I was asked to write a code for these two questions:
1. Find the distances between two given nodes of a binary tree.
2. Find the next greater number with the same set of digits.
After I was able to solve both questions, he proceeded to ask some questions about my projects. He seemed interested in the ML project and asked some basic questions regarding the same. We had a brief discussion on how Machine learning can be used in the Chemical Engineering field. He asked me why I was aspiring to become a software engineer despite having a Chemical engineering background. The round ended with me asking him about the types of projects interns are provided to work on at JPMC

Q1. 
Distance Between Two Nodes in a Binary Tree
Given a binary tree and the values of two distinct nodes, determine the distance between these two nodes in the tree. The distance is defined as the minimum num...read more
Add your answer
Q2. 
Next Greater Number Problem Statement
Given a string S which represents a number, determine the smallest number strictly greater than the original number composed of the same digits. Each digit's frequenc...read more
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

This round was comparatively short. It also started with my brief introduction. The interviewer then asked me about my area of interest, which was Data Structure and Algorithms. He asked me how to find the Nth node from the end in a linked list using a single traversal and LRU Cache implementation. He also seemed interested in the ML Project and asked to explain it in brief. He then gave me a situation wherein I had to make a model for a self-driving car. I gave him a basic idea of how the model will be trained, and he was satisfied. The round ended with him asking generic questions like 'Why JPMC?' , 'Why I chose to code despite belonging to the non-CSE background.'

Q1. 
Remove the Kth Node from the End of a Linked List
You are given a singly Linked List with 'N' nodes containing integer data and an integer 'K'. Your task is to delete the Kth node from the end of this Lin...read more
Add your answer
Q2. 
LRU Cache Problem Statement
Design and implement a data structure for the Least Recently Used (LRU) Cache to efficiently support the following operations:
1. get(key): Retrieve the value of the key if it...read more
Add your answer

Round duration - 10 minutes
Round difficulty - Easy

It was late at night (around 12:30 am) but was crisp and short. HR was really friendly. I was called for the HR round on the same day as the other two rounds. HR asked me why I chose JPMC and why I aspire to become a software engineer. He then asked me about my skill set and how I will enhance it if I got selected. He then asked if I had any questions for him, where I asked him how the virtual working environment has been different from the office experience at JPMC, and if there were any significant challenges.

Round duration - 30 minutes
Round difficulty - Medium

Q1. 
Populating Next Right Pointers in Each Node
Given a complete binary tree with 'N' nodes, your task is to determine the 'next' node immediately to the right in level order for each node in the given tree.
...read more
Ans. BFS approach
The idea here is to Perform BFS while maintaining all nodes of the same level together, which can be done by storing nodes of the same level in a queue data structure, then for a particular level, we start popping nodes one by one and set the ‘next’ pointer of the previously popped node to the current node.
 
Example :
 
• Perform BFS  and maintain a queue for all nodes at the current level.
• Now, mo...read more
Answered Anonymously
Add your answer

Round duration - 10 Minutes
Round difficulty - Easy

Round duration - 90 Minutes
Round difficulty - Easy

the test started at 4 in the evening. the test was conducted in the college only and all the questions were very basic .

Q1. 
Fastest Horse Problem Statement
Given ‘N’ horses running in separate lanes, each horse's finish time is provided in an array. You are tasked to process 'Q' queries. For each query, determine the time take...read more
Ans. Brute Force
For each query, we can simply loop between ‘L’ and ‘R’ and store the minimum time taken by a horse to complete the race in a variable, and return the value stored in that variable.
 
Algorithm for Each Query:
 
• Store the minimum time to complete the race in a variable ‘MINIMUMTIME’ and initialize it with a large enough number, in this case, 10^ 9 is sufficient.
• Iterate from ‘L’ to ‘R’ and if the time ta...read more
Answered Anonymously
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. Brute Force
• For each node in the first list, traverse the entire second list
• Check if any node in the second list coincides with the first list
  • If it does, return that node’s data
  • If it doesn’t, return -1
Space Complexity: O(1)Explanation:
O(1)
 
Since we only use constant space.
Time Complexity: O(m*n) - For 2d arraysExplanation:
O(N * M), where N and M are the lengths of the first and second linked lists respectively.&n...read more
Answered Anonymously
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

This was an online coding round where we had 2 questions of Medium to Hard level of difficulty to solve under 90 minutes. I was able to solve the 2nd question fully and the 1st one partially. 10 students were shortlisted for further rounds and I was one of them.

Q1. 
Longest Palindromic Substring Problem Statement
You are provided with a string STR of length N. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...read more
Add your answer
Q2. 
Count Subarrays with Given XOR Problem Statement
You are given an array of integers ARR and an integer X. Your task is to determine the number of subarrays of ARR whose bitwise XOR is equal to X.
Example...read more
Add your answer

Round duration - 70 Minutes
Round difficulty - Medium

This was a preety intense round where I had to solve 3 algorithmic questions under 70 minutes. I first explained my approach for each of these questions and also discussed why they were optimal in the first place with their respective time and space compleixities. The interviewer was quite impressed at the end of the round.

Q1. 
Kth Largest Number Problem Statement
You are given a continuous stream of numbers, and the task is to determine the kth largest number at any moment during the stream.
Explanation:
A specialized data st...read more
Add your answer
Q2. 
Merge Two Sorted Linked Lists Problem Statement
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
...read more
Add your answer
Q3. 
Stack using Two Queues Problem Statement
Develop a Stack Data Structure to store integer values using two Queues internally.
Your stack implementation should provide these public functions:
Explanation:
...read more
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This was a typical HR round with some standard Behavioral questions.

Q1. Can you tell me something about yourself?
Add your answer
Q2. What do you know about the company?
Add your answer