I recently appeared for the Razorpay SDE intern online assessment and wanted to share my experience with you all. The assessment was quite challenging but insightful, comprising the following:

🔢 Objective Section
The first section consisted of 10 hard-level objective questions covering concepts like:

First Come First Serve (FCFS) and Shortest Job First (SJF) scheduling algorithms
Stack and queue operations
💻 Coding Section
There were 3 coding problems of varying difficulty levels:

Dynamic Programming
Problem: 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).
The number must leave a remainder of
𝐾
K when divided by
𝑀
M.
Example: For
𝑁

3
N=3,
𝑀

4
M=4,
𝐾

2
K=2, valid numbers include: 122, 422, 622, 822, 922.
The goal was to count all such numbers modulo
1
0
9
+
7
10
9
+7.

Graph Algorithms
Problem: 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.

Binary Search
Problem: 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.

Despite my best efforts, I was able to solve only one problem. While it was a challenging experience, it also highlighted areas for improvement and gave me valuable insights.

To anyone preparing for such assessments: focus on sharpening your problem-solving skills, especially around dynamic programming, graph algorithms, and binary search. Practice is key!