JPMorgan Chase

Role: Software Developer Intern

College: Not Specified

Interview Date: Not Specified

Interview Type: On-Campus/Internship

Result: Selected (Inferred)

Difficulty: Medium

Rounds: 5 rounds

Topics Asked: Dynamic Programming, HTML, CSS, Data Structures (Array, LinkedList, Stack, Queue, Tree, Graphs), Bellman Ford Algorithm, OOPS concepts, DBMS (joins, keys, normalization), OS (scheduling, deadlock).

Experience:

The process started with a **Pymetrics Test** to assess traits, which the candidate found enjoyable.

The **Online Round** was a 1-hour coding test on HackerRank with 2 questions.

• Question 1 (40 marks): An easy question about deciding the result of an election. Input was a string array of votes. The winner had the maximum votes, and in case of a tie, the alphabetically greatest name won.
• Question 2 (60 marks): A relatively tough Dynamic Programming question, the "Weighted Job Scheduling" problem. The challenge was that the entire test case was in string format, requiring conversion to integers within the 1-hour time limit.

Around 56 students were shortlisted for the next rounds after solving at least one problem.

Technical Round 1: This round was perceived as tougher due to a strict interviewer. After an introduction, the interviewer reviewed the resume and asked questions based on HTML and CSS, which were mentioned. Then, the interviewer delved into Data Structures, asking about implemented structures (Array, LinkedList, Stack, Queue, Tree, Graphs) and algorithms implemented in graphs. The candidate explained the Bellman Ford Algorithm clearly and was asked to code it in their favorite language. Further questions covered OOPS concepts (polymorphism, abstraction, inheritance, encapsulation), DBMS (different types of joins, primary key, foreign key, normalization, ACID properties), and OS (different types of scheduling, deadlock and its prevention).

Technical Round 2: This round was easier. The interviewer was generous and greeted the candidate warmly, asking for an introduction while reviewing the resume. Questions focused on data structures implemented and algorithms in graphs, specifically Bellman Ford Algorithm, which the candidate explained and coded.

HR Round: This round was described as "very chill" and covered general HR questions like "Tell me about yourself," "Why JPMC?", "Where do you see yourself in 5 years?", "Why should we hire you?", and "Do you have any questions for me?".

Tips: The candidate suggested having a strong grasp of basics, practicing DSA, having a good resume, confidence, and strong communication skills.