JPMorgan Chase & Co. SDE-2 Interview Questions, Process, and Tips

DSA, Leetcode medium -2 problems

Q1. Easy Leetcode Problem: Count of substrings with no repeating characters
Ans. 
Count substrings with unique characters in a given string
• Use a sliding window approach to keep track of unique characters in a substring

• Use a set to store characters in the current window and update the window accordingly

• Increment the count of valid substrings whenever a new character is added to the set
Answered by AI
Add your answer
Q2. Debugging a Java Code
Ans. 
Debugging a Java code involves identifying and fixing errors in the code to ensure it runs correctly.
• Start by understanding the error message or symptoms of the issue.

• Use debugging tools like breakpoints, watches, and logging to track the flow of the code.

• Review the code logic and check for common mistakes like typos, incorrect variable assignments, or logic errors.

• Test different scenarios to reproduce the issue and na...read more
Answered by AI
Add your answer

Q1. Design Parking System
Ans. 
Design a parking system with different types of parking spots
• Create classes for different types of parking spots (e.g. compact, regular, handicap)

• Implement methods for checking availability, reserving, and releasing spots

• Consider implementing a parking lot class to manage all parking spots
Answered by AI
Add your answer

Round duration - 80 minutes
Round difficulty - Medium

Q1. 
Longest Increasing Path in Matrix Problem Statement
Given a 2-D matrix mat with 'N' rows and 'M' columns, where each element at position (i, j) is mat[i][j], determine the length of the longest increasing...read more
Ans. Recursion
Algorithm
 
• This is a recursive approach.
• Make a recursive function ‘helper(row, col)’ and call this function with (0, 0). In each recursive step do the following-:
  • Initialize an integer variable ‘temp’: = 0.
  • If cell (row+1, c) exist and mat[row+1][col] > mat[row][col], then recursively call ‘helper(row+1, col)’ and update ‘temp’ with maximum of ‘temp’ and value return by ‘helper(row+1, col)’.
  • If cell (row, ...read more
Answered Anonymously
Add your answer

Round duration - 50 minutes
Round difficulty - Hard

It was purely Data Structures and Maths.

Q1. 
Arithmetic Progression Queries Problem Statement
Given an integer array ARR of size N, perform the following operations:
- update(l, r, val): Add (val + i) to arr[l + i] for all 0 ≤ i ≤ r - l.
- rangeSu...read more
Ans. Brute Force
In this approach, for each operation, we will be simply doing what we need to do to perform that task. For update operation, we will iterate over the array and update the given value in increasing order as mentioned in the problem description update operation. Similarly, for rangesum operation, we will iterate over the array for the given range and add all elements. For example, consider the input array as [...read more
Answered Anonymously
Add your answer

Round duration - 70 Minutes
Round difficulty - Easy

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...read more
Ans. Using Hashing
The approach is to use hashing. We can maintain two HashMaps. One HashMap can be used to know which character corresponds to which word. The other HashMap can be used to know whether a particular word has already been matched with any other character or not. 
 
So, for each character in the pattern, we check for its corresponding word in the first map. If the character is not present in the first m...read more
Answered Anonymously
Add your answer