Razorpay Interview Questions, Process, and Tips

Round duration - 90 mins
Round difficulty - Hard

There were questions related to DP and DFS.

 

Q1. Trapping Rain Water
You have been given a long type array/list 'ARR' of size 'N'. It represents an elevation map wherein 'ARR[i]' denotes the elevation of the 'ith' bar. Pri...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 by CodingNinjas
View 2 more answers

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. System Design
System Design Round where I had to design an LRU Cache right from Scratch.
Add your answer
Q2. Reverse Linked List
You are given a Singly Linked List of integers. You need to reverse the Linked List by changing the links between nodes.
Input Format :
The first line of input contains a single integ...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 by CodingNinjas
View 1 more answer
Q3. Middle of Linked List
Given the head node of the singly linked list, return a pointer pointing to the middle of the linked list.
If there are an odd number of elements, return the middle element if there...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 by CodingNinjas
View 1 more 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.

Q1. DBMS Questions
Features like table, rows, columns, insertion, delete, update, primary key, indexes, constraints on columns.
Why would I be using NoSQL databases over SQL databases plus my particular inclinat...read more
Add your answer

Q1. Normal API questions and a coding question
Add your answer

Q1. General questions on experience and projects that i worked on
Add your answer

Q1. General behavioural questions
Add your answer