← Back to Directory

JPMorgan Chase interview notes, page 2 of 7

Large Enterprises

Most of these JPMorgan Chase write-ups come from Software Engineers (56), then Product Managers (8) and Machine Learning Engineers (2). The most reported rounds are the technical phone screen (33), the system design round (13), the hiring manager screen (8) and the behavioral / leadership round (5).

69 interview notes · updated Sep 2026

JPMorgan Chase·Software Engineer·Technical Phone Screen

Apr 2026
Went through a coding screen for a Software Engineer role at J.P. Morgan. One question, classic array problem, nothing too surprising but it's the kind of thing that trips you up if you go in rusty.
  • Given an array of integers and a target value, return the indices of the two numbers that sum to the target.

“Classic Two Sum.”

View Post

JPMorgan Chase·Software Engineer·Onsite - Behavioral / Leadership

Apr 2026
Behavioral round at JP Morgan Chase for a data engineer role. One question, but it had some real teeth to it.
  • How do you influence people when you have no direct authority over them, and how does that change depending on whether you're working with someone above or below you in the org?

“This tripped me up a bit because I kept conflating the two directions.”

View Post

JPMorgan Chase·Software Engineer·Technical Phone Screen

Apr 2026
JP Morgan coding round, just one algorithmic problem about gas stations on a circular route. Pretty classic greedy problem but the pressure of a finance interview made me second-guess myself the whole time.
  • Given n gas stations arranged in a circle, each with a known amount of gas and a known travel cost to the next station, find the starting station index from which you can complete a full loop clockwise with an empty tank. Return -1 if no such starting point exists.

“I knew this problem but still fumbled explaining my reasoning out loud.”

View Post

JPMorgan Chase·Software Engineer·Technical Phone Screen

Apr 2026
JP Morgan software engineer interview with a coding question that looked deceptively simple on the surface. It's basically a string parsing problem but the edge cases pile up fast if you're not careful about state.
  • Given an array of strings representing document lines, build a table of contents: lines starting with '# ' are chapters, lines starting with '## ' are sections under the most recent chapter, everything else is ignored. Number chapters as 1, 2, 3... and sections as 1.1, 1.2... Return the result as an ordered array of strings.

“The numbering logic tripped me up more than I expected.”

View Post

JPMorgan Chase·Software Engineer·Technical Phone Screen

Apr 2026
Technical phone screen for a backend Software Engineer role at J.P. Morgan, focused almost entirely on Java internals. Two main areas: concurrent collections and Java 8 functional features. Felt like the interviewer wanted real mechanics, not buzzwords.
  • What are the key differences between HashMap and ConcurrentHashMap, and how does ConcurrentHashMap allow concurrent access without locking the entire structure?
  • How do putIfAbsent and computeIfAbsent fix the race condition in a check-then-act sequence on a ConcurrentHashMap, and what atomicity does each actually guarantee?
  • Why does ConcurrentHashMap disallow null keys and values when HashMap permits them?
  • How do you use lambda expressions in practice? Walk through a concrete before-and-after transformation.
  • What are the most common misuses of the Streams API, particularly around laziness, short-circuiting, and parallel streams with shared mutable state?
  • How do you use Optional correctly, and what are the situations where it should not be used?
  • When would you choose Collections.synchronizedMap or CopyOnWriteArrayList over ConcurrentHashMap?

“I started with the thread-safety angle which was the right call.”

View Post

JPMorgan Chase·Product Manager·Hiring Manager Screen

May 2026
Interviewed for a PM role at JP Morgan Chase. Just the one question I can remember clearly, product need justification, which sounds straightforward but tripped me up more than I expected.
  • How do you determine whether there is a real need for a product?

“I fumbled around talking about user research and market gaps but it felt pretty surface level.”

View Post

JPMorgan Chase·Software Engineer·Onsite - Behavioral / Leadership

May 2026
Behavioral round at JP Morgan for a software engineer role. Two big questions, both pretty standard but they wanted real depth on the conflict one.
  • Walk me through a project you're proud of: what problem it solved, what you specifically did, the impact it had, and what you took away from it.
  • Tell me about a real conflict you had with a coworker, something technical or around ownership or priorities. How did you handle the conversation and what was the outcome?

“I had a project ready but fumbled the 'specific contribution' part.”

View Post

JPMorgan Chase·Software Engineer·Technical Phone Screen

May 2026
Got a coding question at JP Morgan for a software engineer role, pretty standard greedy string construction problem. Nothing too wild but it required you to actually think through the approach carefully.
  • Given a string and an integer repeatLimit, construct the lexicographically largest string such that no character appears more than repeatLimit times consecutively. You don't have to use all characters.

“Knew immediately it was a greedy problem but fumbled the implementation for a bit.”

View Post

JPMorgan Chase·Product Manager·Onsite - Product Sense / Strategy

May 2026
Product sense round for a PM role at JPMorgan Chase, centered on the Payments Developer Portal. One question, pretty open-ended, and the kind of thing that sounds easy until you're actually in it.
  • You're the PM for JPMorgan Chase's Payments Developer Portal. Design a new feature to improve customer adoption.

“I went straight to the user segments because I figured that's where the signal would be.”

View Post

JPMorgan Chase·Software Engineer·Technical Phone Screen

May 2026
Interviewed for a software engineering role at J.P. Morgan and got two algorithmic problems back to back. Nothing too outrageous but the second one took me longer than I'd like to admit.
  • You have a circular array of n computers, each either on (1) or off (0). Find the maximum number of on computers in any contiguous block of k adjacent computers.
  • Given two strings where the first is exactly one character longer than the second, and the second can be formed by removing exactly one character from the first, return all indices in the first string where removing that character produces the second string.

“Sliding window was the right move but the circular part tripped me up initially.”

View Post