Razorpay Software Developer Interview Questions, Process, and Tips

Q1. LLD HLD HM rounds
Add your answer

Blood relation, coding and decoding, number system , percentage

Asked to write an in memory SQL database. Time was 1.5 hours. I made the mistake of choosing C++ and writing the code to make it very flexible and extensible. This led to me not being able to complete the task in the given time.
Tip: practice LLD round in a high level language like Python or Typescript. Speed is very important.

Round duration - 90 mins
Round difficulty - Hard

There were questions related to DP and DFS.

 

Q1. 
Trapping Rain Water Problem Statement
You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...read more
Ans. Brute Force Approach
The idea here is to travel over every elevation on the map and calculate the units of water the elevation can store.
 
Here is the algorithm :
 
1. Iterate over every elevation or element and find the maximum elevation on to the left and right of it. Say, the maximum elevation on to the left of the current elevation or element that we are looking at is ‘maxLeftHeight’ and the maximum elevation on...read more
Answered Anonymously
Add your answer

Round duration - 60 mins
Round difficulty - Medium

At first, I was asked about the different projects that I have done so far. We had a detailed discussion on the same.
He also checked my OOP concepts

Q1. Can you describe the process of designing an LRU Cache from scratch during your System Design Round?
Add your answer
Q2. 
Reverse Linked List Problem Statement
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
Input:
The first line of input is an intege...read more
Ans. Recursive Approach
One way is to use recursion to reverse the list. Divide the linked list in two halves, the first node and the rest of the list. Reverse the second half using recursion and append the first half, that is the first node at the end of the reversed linked list. Return the head of the reversed linked list.
 
Algorithm
 
• If the list contains only one node, return the head of the list.
• Else, divide the ...read more
Answered Anonymously
Add your answer
Q3. 
Middle of a Linked List
You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.
If there is an odd number of elements, return the ...read more
Ans. Count Nodes Approach
• If we want to know the midpoint of any linked list, it is very easy to do so if we know the number of elements in the linked list.
• We take a pointer ‘p’ and use it to traverse the linked list and until we find NULL we increment a variable ‘count’ to count the number of elements in the linked list.
• We then divide the number of elements by 2 to get the position of the middle element of the linked list.
• F...read more
Answered Anonymously
Add your answer

Round duration - 60 mins
Round difficulty - Medium

It is HR + Technical round
asked about the Behavioural questions and how you justify yourself in an argument .questions related to current technology.
They gave me feedback on how well I had performed so far and gave me suggestions on what more can I do to further improve myself.