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
Sharing My Razorpay SDE Intern OA Experience
Summary
I recently appeared for the Razorpay SDE intern online assessment. It was a challenging experience with objective questions and three coding problems, and I was able to solve only one.
Full Experience
I recently appeared for the Razorpay SDE intern online assessment, and it was quite challenging yet insightful. The assessment was divided into two main sections. The first section was an objective section that consisted of 10 hard-level questions, covering concepts such as FCFS and SJF scheduling algorithms, along with stack and queue operations. Following this, there was a coding section which presented three problems of varying difficulty levels. Despite my best efforts, I was only able to solve one of these problems. This experience, while tough, truly highlighted areas where I need to improve, especially in dynamic programming, graph algorithms, and binary search, and provided valuable insights for future preparation.
Interview Questions (3)
You are given three integers N, M, and K, and you need to find the count of N-digit numbers satisfying the following conditions:
- Prime-indexed positions (e.g., 2, 3, 5, 7...) should have prime digits (2, 3, 5, 7).
- Non-prime-indexed positions (e.g., 1, 4, 6, 8...) should have non-prime digits (0, 1, 4, 6, 8, 9).
Example: For N=3, M=4, K=2, valid numbers include: 122, 422, 622, 822, 922.
The goal was to count all such numbers modulo 10^9 + 7.
You are given n servers numbered from 1 to n, with server n being the master server. Each server can send a message forward or backward based on a given time. The task was to calculate the minimum time required for each server to send a message to the master server. If a server couldn’t reach the master, the result should be -1.
You are given N wooden cubes with distinct side lengths arranged in non-decreasing order. The first and last cubes are fixed. The task was to remove exactly K cubes to minimize the maximum difference (diff) between the side lengths of two adjacent cubes.