Problem database last updated: June 20, 2025
10 problems · 1 Easy, 8 Medium, 1 Hard · Ranked #145 of 458
1 Easy
10% · avg 23%
8 Medium
80% · avg 59%
1 Hard
10% · avg 18%
Based on 10 reported problems, razorpay interviews are in line with industry averages - 10% Hard vs 18% overall. The majority (80%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, razorpay puts unusual emphasis on binary-search (30% of problems, 3.4x the industry average), greedy (20% of problems, 2.4x the industry average), stack (20% of problems, 2.3x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (70%), binary-search (30%), sorting (30%), two-pointers (30%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Minimum Total Cost to Make Arrays Unequal You are given two 0-indexed integer arrays nums1 and nums2, of equal length n. | Hard | Very Likely | arrayhash-tablegreedy | Solve |
Two Best Non-Overlapping Events You are given a 0-indexed 2D integer array of events where events[i] = [startTimei, endTimei, valuei]. The ith event starts at startTimei and ends at endTimei,... | Medium | Very Likely | arraybinary-searchdynamic-programming | Solve |
Most Beautiful Item for Each Query You are given a 2D integer array items where items[i] = [pricei, beautyi] denotes the price and beauty of an item respectively. | Medium | Very Likely | arraybinary-searchsorting | Solve |
Shortest Subarray to be Removed to Make Array Sorted Given an integer array arr, remove a subarray (can be empty) from arr such that the remaining elements in arr are non-decreasing. | Medium | Very Likely | arraytwo-pointersbinary-search | Solve |
Merge Intervals Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove... | Medium | Likely | arraysorting | Solve |
LRU Cache Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. | Medium | Likely | hash-tablelinked-listdesign | Solve |
Excel Sheet Column Number Given a string columnTitle that represents the column title as appears in an Excel sheet, return its corresponding column number. | Easy | Likely | mathstring | Solve |
Decode String Given an encoded string, return its decoded string. | Medium | Likely | stringstackrecursion | Solve |
Container With Most Water You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). | Medium | Likely | arraytwo-pointersgreedy | Solve |
Rotate Array Given an integer array nums, rotate the array to the right by k steps, where k is non-negative. | Medium | Likely | arraymathtwo-pointers | Solve |
Minimum Total Cost to Make Arrays Unequal
SolveYou are given two 0-indexed integer arrays nums1 and nums2, of equal length n.
Two Best Non-Overlapping Events
SolveYou are given a 0-indexed 2D integer array of events where events[i] = [startTimei, endTimei, valuei]. The ith event starts at startTimei and ends at endTimei,...
Most Beautiful Item for Each Query
SolveYou are given a 2D integer array items where items[i] = [pricei, beautyi] denotes the price and beauty of an item respectively.
Shortest Subarray to be Removed to Make Array Sorted
SolveGiven an integer array arr, remove a subarray (can be empty) from arr such that the remaining elements in arr are non-decreasing.
Merge Intervals
SolveGiven an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove...
LRU Cache
SolveDesign a data structure that follows the constraints of a Least Recently Used (LRU) cache.
Excel Sheet Column Number
SolveGiven a string columnTitle that represents the column title as appears in an Excel sheet, return its corresponding column number.
Decode String
SolveGiven an encoded string, return its decoded string.
Container With Most Water
SolveYou are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).
Rotate Array
SolveGiven an integer array nums, rotate the array to the right by k steps, where k is non-negative.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent razorpay interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
razorpay interviews focus heavily on array, binary-search, sorting problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. razorpay interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
razorpay has been reported to ask 10 distinct coding problems. The most common topics are array, binary-search, sorting. 1 are Easy difficulty, 8 are Medium, and 1 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 10 reported problems, razorpay interviews are in line with industry averages - 10% Hard vs 18% overall. 80% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, binary-search, sorting. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real razorpay coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a razorpay interview with AIarrow_forward
