Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
Razorpay interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Razorpay
upvote
share-icon
3 rounds | 5 Coding problems
Interview preparation journey
expand-icon
Preparation
Duration: 3 months
Topics: Data Structure and Algorithms ,C++,Java, Spring Boot, MySQL, System Design, OOPS, DBMS.
Tip
Tip

Tip 1 : Prepared data structure and algorithm + System Design
Tip 2 : Go through basic of CS fundamentals
 

Application process
Where: Linkedin
Eligibility: Not as such
Resume Tip
Resume tip

Tip 1 : Mention those things only in which you are confident
Tip 2 : Try to be good in code chef

Interview rounds
01
Round
Medium
Online Coding Test
Duration120 minutes
Interview date20 May 2022
Coding problem2

Two coding Question

1. Maximum Size Rectangle Sub-matrix With All 1's
Hard
10m average time
80% success
0/120
Asked in companies
Samsung R&D InstituteAmerican ExpressZS Associates

You are given an 'N' * 'M' sized binary-valued matrix 'MAT, where 'N' is the number of row...

View more
Problem approach

If the height of bars of the histogram is given then the largest area of the histogram can be found. This way in each row, the largest area of bars of the histogram can be found. To get the largest rectangle full of 1’s, update the next row with the previous row and find the largest area under the histogram, i.e. consider each 1’s as filled squares and 0’s with an empty square and consider each...

View more
Try solving now
2. Convert a given Binary Tree to Doubly Linked List
Moderate
15m average time
80% success
0/80
Asked in companies
FacebookMicrosoftAmazon

Given a Binary Tree, convert this binary tree to a Doubly Linked List.

A Binary Tree (BT) is a data structure in which each node has at most two children.

View more
Problem approach

The problem here is simpler as we don’t need to create a circular DLL, but a simple DLL. The idea behind its solution is quite simple and straight.

If the left subtree exists, process the left subtree
Recursively convert the left subtree to DLL.
Then find the inorder predecessor of the root in the left subtree (the inorder predecessor is the rightmost node in the left subtree).
...

View more
Try solving now
02
Round
Easy
Video Call
Duration75 minutes
Interview date28 May 2022
Coding problem2

Basic introduction
Java related question(diff. b/w Hashmap and hashtable, multithreading, oops question

1. Design a stack that supports getMin() in O(1) time and O(1) extra space
Moderate
15m average time
85% success
0/80
Asked in companies
FlipkartAdobeCisco

Create a stack data structure that allows operations such as push (adding an element), pop (removing the top element), top (retrieving the top element), and also provides a w...

View more
Problem approach

We define a variable minEle that stores the current minimum element in the stack. Now the interesting part is, how to handle the case when minimum element is removed. To handle this, we push “2x – minEle” into the stack instead of x so that previous minimum element can be retrieved using current minEle and its value stored in stack. Below are detailed steps and explanation of working.
Push(x...

View more
Try solving now
2. Maximum In Sliding Windows Of Size K
Moderate
20m average time
80% success
0/80
Asked in companies
AppleGoogleWalmart

Given an array/list of integers of length ‘N’,...

View more
Problem approach

Create a deque to store k elements.
Run a loop and insert first k elements in the deque. Before inserting the element, check if the element at the back of the queue is smaller than the current element, if it is so remove the element from the back of the deque, until all elements left in the deque are greater than the current element. Then insert the current element, at the back of the deque....

View more
Try solving now
03
Round
Easy
HR Round
Duration45 minutes
Interview date8 Jun 2022
Coding problem1

It was Hr round, around 3pm

1. Basic HR Questions

Asked some behavioural and conditional question.

Share a time you made a mistake at work and how you corrected it.

How you handle your stress when you have lots of work ?

Are you a multitasking person?




 

Problem approach

Tip 1 : be confident
Tip 2 : give genuine answer(put yourself in that place and than give answer) not from internet
 

Start a Discussion
Similar interview experiences
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Razorpay
1754 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 4 problems
Interviewed by Razorpay
0 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 4 problems
Interviewed by Razorpay
415 views
0 comments
0 upvotes
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Razorpay
339 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
97148 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
45361 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
28376 views
6 comments
0 upvotes