Razorpay Software Engineer Interview Questions
& Process
Real candidates share what happened, how many rounds they had,
and how the experience turned out.
Based on 170 interview experiences · FREE TO READ
Candidate interview experiences
First-hand accounts from people who interviewed at Razorpay.
Razorpay
Software Development Engineer
Entry Average Positive experience No offer 3 rounds
Interview process
Technical screen Onsite Technical screen
Interview formats
Coding Technical Behavioral
Razorpay came to our campus for hiring. It was a 3-4 round process. The first round was an online test. The second round was a Technical Interview where they asked questions like Merge sorted array, its time & space complexity, and some questions from OOPs. After that, the interviewer asked me to create the structure of a Bookstore. Then there was a final HM round where they asked questions. Unfortunately, I couldn't clear that round because my meeting got disconnected due to my laptop being too old.
Confirmed questions5 questions
- Can you introduce yourself and tell me about your background and academic projects?
- Could you explain how to merge sorted arrays?
- What is the time and space complexity for merging sorted arrays?
Razorpay
Senior Software Engineer
Senior Average Positive experience No offer 3 rounds
Interview process
Recruiter call Technical screen Onsite
Interview formats
Technical System Design Behavioral
The interview process was pretty put together and felt professional. First up was an initial screening where a recruiter chatted with me, giving a good rundown of the job, what they were looking for, and the whole timeline. It was a pretty chill and informative chat. Then came the technical round where the interviewer hit me with some practical frontend coding challenges, mainly around JavaScript, how browsers render stuff (like reflow/repaint), making things performant, and how the DOM actually works in real-world scenarios. We had a good back-and-forth, going beyond just code to see how I approach problems and think about performance. I really liked digging into concepts like React's virtual DOM versus the actual DOM. After that, there was a system/architecture design round. We talked about managing state and designing components for frontend apps. They gave me some helpful feedback that pointed out areas where I could improve, particularly in organizing my technical thoughts better. Even though I didn't move forward to the final stage, they offered some really thoughtful feedback that zeroed in on core principles and performance, which I actually found super useful.
Confirmed questions8 questions
- Tell me about the internal workings of React.
- Can you explain web fundamentals?
- Discuss practical frontend problems related to JavaScript.
Razorpay
Software Development Engineer
Entry Difficult Neutral experience No offer 2 rounds
Interview process
Technical screen Onsite
Interview formats
Coding System Design Technical Behavioral
Okay so the process had two main parts. First up was this machine coding round where I had to design a file sharing app, basically something that lets users send files to each other and also follow people and see who follows them. Then there was a hiring manager round where they hit me with CS fundamentals, OS stuff, and some behavioral questions.
Confirmed questions5 questions
- Can you design a file sharing app that allows multiple users to exchange files?
- How would you implement the functionality for users to follow others and view their follower lists?
- What are the fundamental concepts in Computer Science?
Razorpay Software Engineer Interview Questions
Quoted word for word from Razorpay interview reports.
“Find the first and last index of a given number in a sorted array using an algorithm with O(log N) time complexity.”
Read reports →“For a given number n, what is the smallest k where all bits of n in base k are 1?”
Read reports →“Find if there exists a triplet in an array such that a[i] < a[j] < a[k] and i < j < k.”
Read reports →“What's the minimum number of moves to gather all the 1s together in a binary array of length n, where each move shifts a 1 to an adjacent spot? Provide the minimum operations for each index from 1 to n.”
Read reports →“What is the smallest subarray that needs to be removed so that the remaining array sum is divisible by p?”
Read report →“Implement a stack data structure with two methods: getMax() to return the maximum element and max() to return and remove the maximum element.”
Read report →“Can you flatten a binary tree into a single list following preorder traversal sequence, ensuring only left children have values and right children are null?”
Read report →“Is it possible to transform the second string into the first string by changing all instances of one letter to another, performing this at most once?”
Read report →“Can you remove a subarray from an array of n integers such that the sum of the remaining elements is divisible by k?”
Read report →Formats, difficulty and experience
Across all 170 Razorpay interview reports.