JP Morgan Chase · OA → Onsite
In processJPMorgan Chase Intern Campus Rounds: 4 Experiences (Part 2 of 5)
JPMorgan Chase tech intern campus drives in India, 2019: four accounts of a HackerRank OA, one or two technical rounds and HR, with Josephus and DP tasks.
At a glance
- Process (2019 campus drives): HackerRank OA (60–90 minutes, two questions) → one or two technical interviews → HR; one campus added Pymetrics first (H15) and one a business round (H14).
- Asked in these reports: two OA tasks came up twice, a signed-direction Josephus variant and a maximum k-by-k square sum (H13, H16); interviews mixed live coding, OOP and CS theory, and resume talk.
- Difficulty: one candidate passed 6 of 9 tests on the Josephus task (H16); interviewers stopped long implementations once they had seen enough (H14, H15).
- Practise first: Josephus Survivor with Signed Direction and Maximum k-by-k Square Sum, the two tasks named twice.
Coverage: 4 campus accounts from 2019 (VIT Vellore, IIT Roorkee, NIT Calicut, RV College of Engineering), software engineering and developer summer intern roles. All four are more than three years old, so they sit in History below.
In this series
- Part 1: live finals and campus, entries 1–12, with the current question tables.
- Part 2 (current): four 2019 campus accounts, entries 13–16.
- Part 3: earlier rounds, entries 17–27.
- Part 4: Code for Good, entries 28–37.
- Part 5: Code for Good, entries 38–43.
What came up
All four 2019 candidates coded live and talked through their resume. Interviewers asked for implementations with explanations: sorting without the library sort, Bellman–Ford, AVL insertion, Fibonacci, an OOP game, and two design discussions where cost was the main constraint. Because every report here is older than three years, this part has no current topic or question table; each question stays in its entry, and the full current tables are in Part 1.
History (before 2023)
H13: two design discussions pushed on cost and connectivity
Interview date: September 23, 2019 · Report date: September 24, 2019 · Role: Software engineer summer intern · Location: VIT Vellore, India · Result: Rejected
The drive selected summer 2020 interns. The HackerRank test ran two or three weeks before the campus interviews: two questions in one hour. Seventy-eight of roughly 850–900 students were shortlisted.
Online assessment
- Maximum k-by-k Square Sum: find the k-by-k submatrix with the largest sum. The candidate said a brute-force solution was accepted.
- Josephus Survivor with Signed Direction: a pillow-passing version of Josephus with n students, passing clockwise or anticlockwise, removing every kth person and returning the survivor's index. The candidate did not remember the exact statement.
Technical interview 1 (about 35 minutes, mostly resume and OOP)
- Introduce yourself, including Toastmasters experience.
- Favorite OOP property (the candidate chose abstraction); whether abstract classes can be instantiated; C++ virtual functions; Java interface versus abstract class.
- Trace Three Cooperative Constructors: the print order of constructors when a derived object is created in a three-class multiple-inheritance example. The candidate discussed super(); the original diagram and program were not reproduced.
- BST properties.
- Fibonacci Number: recursively and with dynamic programming.
- Multithreading versus multiprocessing; database triggers, normalization and key differences.
Technical interview 2 (about 30–35 candidates reached it)
- How the candidate keeps up with technology and what they learned recently.
- Telephone Verification for Village Teaching Visits: check that NGO volunteers really teach in villages. The answer had to be cheap, work without internet and use phone calls. The interviewer pushed back on GPS, IoT and biometric ideas as too costly or needing connectivity.
- Low-Cost Access to a File Archive: cut download and access time for 90,000 server files of different sizes. Horizontal scaling was turned down on cost; indexing got a positive response.
The candidate's turn came at about 11:30 p.m., and each design discussion took eight to ten minutes. After a 30-minute wait they were told to leave without an HR round, and were rejected.
H14: no library sort, and an interviewer who wanted shorter code
Report date: August 17, 2019 · Role: Software developer summer intern · Location: IIT Roorkee, India · Result: Selected
Online assessment (65 minutes)
- Sort the Words: a word-sorting string problem. The candidate used hash maps; the report gives neither the ordering key nor the tokenization rules.
- Complete a Sudoku Board: solve a Sudoku board.
Technical
- Resume discussion, including about ten minutes on CSS, then APIs and basic software development.
- An array problem led into sorting: implement a sort without the library function. The candidate proposed merge sort; the interviewer wanted shorter code, so they explained quicksort and started coding it before being stopped.
Business round
- A technical architecture for a business problem; the problem itself was not described.
HR
- Why software after a strong result in another engineering branch?
- Background, motivation, achievements, weaknesses and preferred location.
The candidate heard they were selected about three hours later.
H15: Bellman–Ford, AVL inserts and two physical puzzles
Report date: August 7, 2019 · Role: Software developer intern · Location: NIT Calicut, India · Result: Selected (7 of the day's candidates)
Pymetrics came first, then a one-hour HackerRank test with two questions worth 40 and 60 marks. Fifty-six applicants advanced; the first technical interview cut that to 16 and the second to 11.
Online assessment
- Election Winner: from an array of vote names, return the name with the most votes, breaking ties by the alphabetically greatest name.
- Weighted Jobs from an Encoded Test Case: weighted job scheduling where the whole test case arrives as strings and has to be parsed into integers.
Technical 1
- Introduce yourself; what a CSS selector is; ways to apply CSS to HTML; new HTML5 features.
- The candidate's operating systems course project and why there were no other projects; which data structures they had implemented before.
- Find the Nth Node from the End: in a doubly linked list of unknown length, in one pass.
- Compare merge sort and quicksort.
- Check a String Palindrome.
Technical 2
- Introduce yourself.
- Bellman–Ford Shortest Paths in a language of their choice. The candidate said they were not comfortable coding graph problems.
- Build an AVL Tree by Insertion: explain AVL trees and insert the values 1 to 10. A height helper was allowed, and the interviewer stopped the implementation once they had seen enough.
- Puzzle: measure 45 minutes with two identical wires that each take 60 minutes to burn from one end at an uneven rate, plus matches.
- Puzzle: ten bags of 1,000 coins each, genuine coins weigh 1 gram and the counterfeit bag's coins weigh 1.1 grams; find the counterfeit bag with one accurate weighing.
HR
- Introduce yourself and your college; the lack of projects; working across a language and communication barrier.
The day lasted about twelve hours, and seven candidates were selected, including this one.
H16: a modified Josephus problem and an OOP game in Java
Interview date: August 2019 · Report date: November 25, 2019 · Role: Software engineering intern · Location: RV College of Engineering, India · Result: Selected
Online assessment (HackerRank, 90 minutes, two questions)
- Maximum k-by-k Square Sum in an n-by-n matrix; the candidate completed it.
- Josephus Survivor with Signed Direction: a modified Josephus problem that allowed negative values. The report does not say which parameter was signed. The candidate passed 6 of 9 tests.
Sixty of 250 applicants advanced, and 21 remained after the first technical interview.
Technical interview 1
- Introduce yourself; real-world uses of AI (the candidate suggested environment and healthcare).
- Tower of Hanoi: Return the Moves, recursively and iteratively.
- Find a Subset of Exactly K Elements with a Target Sum. The candidate pointed to a similar fixed-length contiguous-subarray problem, so whether the original asked for a subset or a window is not settled.
- Their earlier internship project in detail.
Technical interview 2
- One project in depth, plus OOP concepts.
- Implement an Object-Oriented Snakes and Ladders Game: the choice was Snakes and Ladders or a lift system. The candidate built Snakes and Ladders in Java and talked through its functions and class structure.
HR
- About yourself, why the company, and standard HR questions.
All 21 candidates went on to HR, and this candidate learned about 30 minutes later that they were selected.
Common questions
How long was the JPMorgan intern HackerRank OA in 2019?
Between 60 and 90 minutes for two questions: one hour at two campuses (H13, H15), 65 minutes at one (H14) and 90 minutes at another (H16).
How many interview rounds did JPMorgan campus intern drives have?
Two technical interviews plus HR at three campuses (H13, H15, H16); one campus had a technical round, a business round and HR (H14). H13's candidate was dropped before HR.
Did JPMorgan intern interviews include puzzles?
One of the four 2019 reports had two puzzles in its second technical round: burning wires to measure 45 minutes and finding a counterfeit coin bag with one weighing (H15).
Which JPMorgan intern OA questions repeated?
The signed-direction Josephus task and the maximum k-by-k square sum each appeared at two campuses in 2019 (H13, H16).
Keep practicing
- OA tasks from these drives: Josephus Survivor with Signed Direction and Maximum k-by-k Square Sum (H13, H16), Sort the Words and Complete a Sudoku Board (H14), Election Winner and Weighted Jobs from an Encoded Test Case (H15).
- Interview coding from these drives: Fibonacci Number and Trace Three Cooperative Constructors (H13), Implement Quicksort (H14), Bellman–Ford Shortest Paths, Build an AVL Tree by Insertion, Find the Nth Node from the End and Check a String Palindrome (H15), Tower of Hanoi, Find a Subset of Exactly K Elements and Snakes and Ladders in OOP (H16).
- Design discussions from H13: Telephone Verification for Village Teaching Visits and Low-Cost Access to a File Archive.
- JPMorgan Chase question banks: algorithms and system design (sign-in needed).
- Everything JPMorgan Chase in one place: the JPMorgan Chase interview page.
- More firsthand reports: the Experience feed.
In this series
Related JPMorgan Chase roundups: quant interns · Data & AI interns
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.