JPMorgan Chase & Co. Sde1 Interview Questions and Answers

2 medium dsa que - one is of binary search, one is from graph

Q1. Define oops principle
Ans. 
OOPs principles are the fundamental concepts of object-oriented programming that help in designing and implementing software solutions.
• Encapsulation: Bundling data and methods that operate on the data into a single unit (class).

• Inheritance: Allowing a class to inherit properties and behavior from another class.

• Polymorphism: The ability of different classes to be treated as instances of a common superclass.

• Abstraction: ...read more
Answered by AI
Add your answer
Q2. Define os concepts
Ans. 
OS concepts refer to fundamental principles and components of operating systems.
• Process management - handling processes, scheduling, and resource allocation

• Memory management - managing memory allocation, virtual memory, and paging

• File system - organizing and accessing files on storage devices

• Device management - controlling and communicating with hardware devices

• Security and protection - ensuring system and data securit...read more
Answered by AI
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 - 30 minutes
Round difficulty - Easy

It was in the day time. I was asked the programming language of my choice. It was mostly focused on programming fundamentals. I was asked 2 questions based on Data Structures and Algorithms.

Q1. How can you detect a loop in a linked list?
Ans. 
A loop in a linked list can be detected using Floyd's Cycle Detection Algorithm.
• Use two pointers - slow and fast, where slow moves one step at a time and fast moves two steps at a time.

• If there is a loop, the two pointers will eventually meet at some point within the loop.

• To detect the start of the loop, reset one pointer to the head and move both pointers one step at a time until they meet again.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This round was mostly focused on my resume and projects.

Q1. Tell me about your projects.
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

It was in the evening. I went to their office in Gurgaon. It was taken by one of the technology director who had a lot of experience. 
 

Moderate level aptitude with basics

Moderate level data structure questions