JPMC On-Campus Internship Experience (2028 Batch)
Summary
I completed JPMC's on‑campus internship interview process, clearing the online assessment and HireVue stages, and proceeded to the Code for Good hackathon.
Full Experience
College: Tier-1 (NIT) Branch: CSE CGPA Criteria: 8.5+ (or 85%) Backlogs: None allowed
Stipend & Perks 💰
- Monthly Stipend: ₹80,000
- Relocation Bonus: ₹50,000 (one-time)
Process Overview (Summer Internship)
1. Student Presentation 📅 9th March
2. Application Window 📅 9th – 12th March
3. Online Technical Assessment 📅 25th – 26th March
4. HireVue Video Interview 📅 25th – 29th March
5. Code for Good Hackathon (Final Round) 📅 6th, 20th June & 4th July
Online Assessment Questions (OA)
Q1. Minimum Servers Problem
- Given
nservers with capacities (powers of 2) - Find minimum number of servers whose sum = expected_load
- Each server used at most once
- Return
-1if not possible
👉 Concept: Greedy + Bit Manipulation (subset sum optimized using powers of 2)
Q2. Binary Password Security
- Given binary string (0s and 1s)
- Split into substrings such that: • Each substring has even length • Each substring has same characters
- Find minimum flips required
👉 Concept: Greedy / String grouping
Preparation Tips
- Focus on LeetCode Medium (Greedy + Bit + Strings)
- Practice OA-style questions (not too hard but tricky)
- Be ready for behavioral questions (HireVue)
- Hackathon round tests teamwork + development skills
Overall Experience
The OA was easy to moderate — more about logic clarity than hardcore DSA. Main elimination happens in OA + HireVue, while Code for Good is the deciding round.
If you’re preparing, don’t just grind hard DP—focus on patterns and problem‑solving speed.
Feel free to ask for solutions or prep strategy 👍
Interview Questions (2)
Minimum Servers Problem
Given n servers with capacities that are powers of 2, find the minimum number of servers whose sum equals expected_load. Each server can be used at most once. Return -1 if it is not possible.
Concept/Approach: Use a greedy strategy combined with bit manipulation. Since capacities are powers of 2, treat the problem as a subset‑sum where you repeatedly take the largest available server that does not exceed the remaining load, updating the remaining load accordingly. If the remaining load becomes zero, the count of selected servers is the answer; otherwise return -1.
Binary Password Security
Given a binary string (containing only 0 and 1), split it into substrings such that each substring:
- Has an even length.
- Consists of identical characters (all
0s or all1s). Find the minimum number of character flips required to achieve such a partition.
Concept/Approach: Use a greedy/string‑grouping method. Scan the string, form groups of even length with the same character, and flip characters when necessary to satisfy the even‑length constraint while minimizing total flips.
Preparation Tips
- Focus on LeetCode Medium (Greedy + Bit + Strings)
- Practice OA‑style questions (not too hard but tricky)
- Be ready for behavioral questions (HireVue)
- Hackathon round tests teamwork + development skills