Microsoft SDE Intern Interview Experience
💼 LTIMindtree Interview Experience (On-Campus) | Fresher | 2026
Salesforce SMTS | Interview Experience | Rejected
JPMC | SDE2 (Associate) - Java Backend - Interview Experience + Compensation
Microsoft - SDE2 - Coding Round
Juspay 5/7 rounds experiance
Summary
I applied for an SDE role at Juspay and successfully navigated 5 out of 7 technical rounds, including coding challenges, an MCQ round, two hackathons, and a technical interview where I tackled problems like Rainwater Puddle Formation and Count Inversion Pairs. After clearing the initial technical interview, I completed the final hackathon round and am now awaiting further communication from the company.
Full Experience
🚀 My Juspay SDE Interview Journey "OFF CAMPUS"🚀
I cleared Juspay Technical Interview-I
A few months ago, I applied for the SDE role at Juspay through Internshala
Here's a breakdown of my experience across 5 out of 7 rounds:
1️⃣ Coding Round
Questions on Binary Search (Answer concept),
Graphs
One question I couldn't crack.
Solved 2/3
2️⃣ MCQ Round
Topics included Physics (motion, work-energy), and Math (combinations, permutations, probability),Others
3️⃣ Hackathon Part-A
Problem: Lock-Unlock Tree Upgrade system
Focused on tree-based logic and state transitions
4️⃣ Technical Interview - I (Elimination Round)
Interviewer: Nikita Gupta (2 hours)
Topics covered:
Two live coding rounds via screen sharing
1. Graphs (Disjoint Set Union problem): Rainwater Puddle Formation.....
2. Count Inversion Pairs(brute & optimal via divide & conquer)
Core CS Subjects: OS (scheduling), DBMS, CN, OOPs
React Lifecycle
✅ Cleared this round and received a call from HR the same day!
5️⃣ Hackathon Part-B
Conducted Over Slack Channel
8-hour challenge to make Part-A's solution thread-safe
Implemented with and without mutex using granular locking
Used parallelism & threading for better performance
I prepared overnight and gave it my best shot!
It's been 1.5 weeks ,I haven’t received any further communication from Juspay. Maybe the journey ends here .........
Interview Questions (4)
Problem: Lock-Unlock Tree Upgrade system Focused on tree-based logic and state transitions
Graphs (Disjoint Set Union problem): Rainwater Puddle Formation
Count Inversion Pairs(brute & optimal via divide & conquer)
8-hour challenge to make Part-A's solution thread-safe. Implemented with and without mutex using granular locking. Used parallelism & threading for better performance.
Preparation Tips
I prepared overnight and gave it my best shot! for Hackathon Part-B.