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
Ans. 
Rearrange words in a sentence based on increasing order of their length.
• Split the sentence into words and calculate the length of each word.

• Sort the words based on their lengths in increasing order.

• If two words have the same length, maintain their original order from the input sentence.
Answered by AI
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
Ans. 
Check if a valid Sudoku solution exists for a given 9x9 matrix with empty cells.
• Iterate through each row, column, and sub-matrix to ensure all digits from 1 to 9 appear exactly once.

• Use sets to keep track of digits seen in each row, column, and sub-matrix.

• If any digit is repeated in a row, column, or sub-matrix, return 'no'.

• If all rows, columns, and sub-matrices pass the validity check, return 'yes'.
Answered by AI
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
Ans. 
Calculate the distance between two nodes in a binary tree.
• Traverse the tree to find the paths from the root to each node

• Find the lowest common ancestor of the two nodes

• Calculate the distance by adding the distances from the LCA to each node
Answered by AI
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
Ans. 
The task is to find the smallest number greater than the given number with the same set of digits.
• Iterate from right to left to find the first digit that can be swapped with a smaller digit to make the number greater.

• Swap this digit with the smallest digit to its right that is greater than it.

• Sort all digits to the right of the swapped digit in ascending order to get the smallest number greater than the original.

• If no ...read more
Answered by AI
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
Ans. 
Implement a function to remove the Kth node from the end of a singly linked list.
• Traverse the list to find the length 'N' of the linked list.

• Calculate the position of the node to be removed from the beginning as 'N - K + 1'.

• Traverse the list again and remove the node at the calculated position.
Answered by AI
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
Ans. 
Design and implement a data structure for LRU Cache to efficiently support get and put operations.
• Implement a doubly linked list to maintain the order of recently used keys.

• Use a hashmap to store key-value pairs for quick access.

• Update the linked list and hashmap accordingly for get and put operations.

• Discard the least recently used item when the cache reaches its capacity.

• Handle edge cases like key not found in cache.

• ...read more
Answered by AI
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. 
Implement a function to populate next right pointers in a complete binary tree.
• Traverse the tree level by level using BFS

• For each node, set its next pointer to the next node in the same level

• Handle null nodes appropriately by setting next pointer to null

• Ensure the tree is a complete binary tree to guarantee correct output
Answered by AI
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. 
Given finish times of horses, determine fastest horse in specified lane ranges for multiple queries.
• Iterate through each query and find the minimum finish time within the specified range of horses.

• Use a nested loop to handle multiple test cases and queries efficiently.

• Ensure to handle edge cases like empty ranges or invalid inputs.

• Consider using a data structure like arrays to store finish times and process queries.
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.

• Traverse both lists simultaneously until they meet at the merging node.
Answered by AI
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
Ans. 
Given a string, find the longest palindromic substring, choosing the one with the smallest start index if multiple exist.
• Iterate through the string and expand around each character to find palindromes

• Keep track of the longest palindrome found and its starting index

• Return the longest palindromic substring with the smallest start index
Answered by AI
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
Ans. 
Count the number of subarrays in an array whose XOR is equal to a given value.
• Iterate through the array and keep track of XOR values and their frequencies using a hashmap.

• For each element, calculate the XOR with the previous elements to find subarrays with XOR equal to the given value.

• Use the hashmap to efficiently count the number of subarrays with the desired XOR value.

• Handle edge cases like XOR value being 0 separat...read more
Answered by AI
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
Ans. 
Design a data structure to find the kth largest number in a continuous stream of integers.
• Design a specialized data structure to handle continuous stream of numbers

• Implement add(DATA) function to add integers to the pool

• Implement getKthLargest() function to retrieve the kth largest number

• Maintain the pool of numbers and update it based on queries

• Output the kth largest number for each Type 2 query
Answered by AI
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
Ans. 
Merge two sorted linked lists into a single sorted linked list without using additional space.
• Create a dummy node to start the merged list

• Compare the values of the two linked lists and append the smaller value to the merged list

• Move the pointer of the merged list and the pointer of the smaller value's linked list

• Continue this process until one of the linked lists is fully traversed

• Append the remaining elements of the o
Answered by AI
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
Ans. 
Implement a stack using two queues to store integer values with specified functions.
• Use two queues to simulate stack operations efficiently.

• Maintain the top element in one of the queues for easy access.

• Ensure proper handling of edge cases like empty stack or invalid operations.

• Example: Push elements 5, 10, 15; Pop element 15; Check top element 10; Check size of stack; Check if stack is empty.
Answered by AI
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