JPMC | SDE | Feb 2026 | Rejected

jpmorgan chase logo
jpmorgan chase
· Software Development Engineer
March 3, 2026 · 2 reads

Summary

I interviewed for a Software Development Engineer role at JPMorgan Chase in February 2026 and was ultimately rejected. The interview consisted of a mix of Data Structures & Algorithms, Java-specific questions, and system design concepts.

Full Experience

Round 1:
Dsa
Longest substring without repeating characters
Java:
Association and composition
When do we use stream when not to use stream
Whats the most used data structure by me? When should I use it, when not to use it
If we have our required value in application.yml how to access those values in our test files
Solid principles
Whats reactive java, when should we use it?
Syntax of retry for webclient
IO file handling
Multithreading
If we have a file in a subfolder we know the path of main folder, how can we find the file in java
Streams parallel, how does it work internally
Findfirst vs findany in streams
Stub vs mock
Peek method for collections when its used
How do we retry in reactive java
Observer vs observable
Functional interface? Supplier vs consumer?

Not from my interview, heard from a friend
If we have a linked list where 0th node and n-1th node is a pair, 1st node and n-2th node is a pair and so on, find the highest pair sum in the linked list

Verdict: Rejected

Interview Questions (19)

1.

Longest Substring Without Repeating Characters

Data Structures & Algorithms·Medium

Find the length of the longest substring in a given string without repeating characters.

2.

Difference between Association and Composition

Other

Explain the concepts of association and composition in object-oriented programming, highlighting their differences and when to use each.

3.

Java Streams Usage

Other

Discuss the appropriate scenarios for using Java Streams and when it might be better to avoid them.

4.

Most Used Data Structure and Usage Scenarios

Behavioral

Describe the data structure I use most frequently, and explain its appropriate and inappropriate use cases.

5.

Accessing YAML Configuration in Test Files

Other

Explain how to access values defined in an application.yml file within test files.

6.

SOLID Principles

System Design

Explain the SOLID principles of object-oriented design.

7.

Reactive Java Introduction and Use Cases

System Design

Define Reactive Java and discuss scenarios where its use is beneficial.

8.

WebClient Retry Syntax

Other

Provide the syntax for implementing retry logic with WebClient.

9.

Java I/O File Handling

Other

Discuss concepts and methods related to file input/output handling in Java.

10.

Multithreading Concepts

System Design

Explain fundamental concepts of multithreading in Java.

11.

Finding a File in a Subfolder in Java

Other

Given the path of a main folder, describe how to find a specific file located within one of its subfolders using Java.

12.

Internal Working of Parallel Streams

Other

Explain the internal mechanisms and how parallel streams function in Java.

13.

Difference between findFirst and findAny in Java Streams

Other

Explain the distinction and use cases for findFirst() and findAny() methods in Java Streams.

14.

Stub vs Mock

Other

Differentiate between stubs and mocks in the context of software testing.

15.

Usage of peek method in Java Streams

Other

Explain the purpose and common use cases for the peek() method in Java Streams.

16.

Retry Mechanism in Reactive Java

System Design

Describe how to implement a retry mechanism in Reactive Java applications.

17.

Observer vs Observable Pattern

System Design

Explain the Observer and Observable pattern, highlighting their roles and interaction.

18.

Functional Interface, Supplier vs Consumer

Other

Define what a functional interface is in Java, and explain the differences and use cases for the Supplier and Consumer functional interfaces.

19.

Highest Pair Sum in Paired Linked List

Data Structures & Algorithms·Medium

Given a linked list where the 0th node and (n-1)th node form a pair, the 1st node and (n-2)th node form a pair, and so on, find the highest sum among all such pairs.

📣 Found this helpful? Please share it with friends who are preparing for interviews!

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!