JPMorgan Chase & Co. Sdet Lead Interview Questions and Answers

Q1. OOPS Concepts,Java Coding,Testing
Add your answer

Q1. Selenium, APIs, Automation
Add your answer

2 coding question, 1 section of business aptitude and 1 section english.

Q1. Design a chess game.
Ans. 
A classic chess game with standard rules and pieces.
• Create a board with 8x8 squares

• Place 16 pieces on each side: 1 king, 1 queen, 2 rooks, 2 knights, 2 bishops, and 8 pawns

• Define the movement rules for each piece

• Implement special moves like castling and en passant

• Check for checkmate and stalemate conditions

• Allow for player vs player or player vs computer gameplay
Answered by AI
Add your answer
Q2. N queens problem. Minimum steps by knight.
Ans. 
The N Queens problem is to place N chess queens on an NxN board so that no two queens threaten each other. Minimum steps by knight is a variation of this problem.
• The N Queens problem is a classic problem in computer science and can be solved using backtracking.

• The minimum steps by knight variation involves placing N knights on an NxN board so that no two knights threaten each other.

• This problem can also be solved using...read more
Answered by AI
Add your answer

Q1. Hr questions were asked. And location preference.
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

It was a L1 technical round where questions from DS algo were asked, along with my work exp and projects. It was a face to face video round with 2 panel members

Q1. 
Number of Islands Problem Statement
You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...read more
Ans. 
import java.io.*;
import java.util.*;
public class Main
{
public static void DFS(int[][] input, int i, int j, int row, int col){
if(i<0||j<0||i>row-1||j>col-1){
return;
}
if(input[i][j]==1){
input[i][j]=0;
DFS(input,i+1,j,row,col);
DFS(input,i-1,j,row,col);
DFS(input,i,j+1,row,col);
DFS(input,i,j-1,row,col);
}
}

public static int countNumber(int[][] input, int row, int col){
int count =0;
for(int i=0;i {
for(int j=0;j if(inpu...read more
Answered Anonymously
Add your answer
Q2. How can you prevent the breaking of the singleton pattern using reflections?
Ans. 
Tip 1 : Provide correct answer i you know
Tip 2 : Revise Java concepts
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

It was a System design round and the interviewer was very friendly, he gave ample hints and it was a productive interaction.

Q1. Design an LRU (Least Recently Used) cache.
Ans. 
Tip 1 : Practise System Design well
Tip 2 : Ask questions wherein necessary
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

It was a standard manager where I was asked many questions related to my work exp and behavioural questions