razorpay coding interview
questions, leaked.
10 problems reported across recent razorpay interviews. Top patterns: array, two pointers, binary search. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Razorpay's assessment leans hard on array manipulation. Seven of ten reported problems center on arrays, with two-pointers and binary search splitting the rest. You're looking at one easy problem, eight medium, and one hard. Most candidates will spend time on merge logic, subarray extraction, and two-pointer traversal. If you freeze on a greedy array problem mid-assessment, StealthCoder surfaces a working solution invisible to the proctor. The real edge is knowing which pattern hits first.
Top problems at razorpay
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Minimum Total Cost to Make Arrays Unequal | HARD | 100.0 | 41% | Array · Hash Table · Greedy |
| 02 | Most Beautiful Item for Each Query | MEDIUM | 100.0 | 62% | Array · Binary Search · Sorting |
| 03 | Two Best Non-Overlapping Events | MEDIUM | 100.0 | 61% | Array · Binary Search · Dynamic Programming |
| 04 | Shortest Subarray to be Removed to Make Array Sorted | MEDIUM | 79.1 | 51% | Array · Two Pointers · Binary Search |
| 05 | Merge Intervals | MEDIUM | 72.6 | 49% | Array · Sorting |
| 06 | Rotate Array | MEDIUM | 63.4 | 43% | Array · Math · Two Pointers |
| 07 | Excel Sheet Column Number | EASY | 63.4 | 66% | Math · String |
| 08 | Container With Most Water | MEDIUM | 63.4 | 58% | Array · Two Pointers · Greedy |
| 09 | Decode String | MEDIUM | 63.4 | 61% | String · Stack · Recursion |
| 10 | LRU Cache | MEDIUM | 63.4 | 45% | Hash Table · Linked List · Design |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual razorpay OA. The proctor cannot see it. Screen share cannot detect it. Built because the OA filter rejects engineers who'd pass the on-site. That's a broken filter. This is the workaround.
Get StealthCoder- array7 · 70%
- two pointers3 · 30%
- binary search3 · 30%
- sorting3 · 30%
- stack2 · 20%
- math2 · 20%
- hash table2 · 20%
- greedy2 · 20%
- string2 · 20%
- monotonic stack1 · 10%
Array problems dominate Razorpay's question set, so that's your first drill target. Two-pointers (three appearances) and binary search (three appearances) are close seconds, each tying for second frequency. Sorting shows up three times as a utility, not as standalone topics. Greedy appears twice and powers the hardest problem on the list. Stack and hash-table each appear twice but in smaller roles. If you've solved Merge Intervals, Rotate Array, and Container With Most Water, you've hit the core patterns. The single hard problem couples array logic with hash-table counting and greedy choices, so don't skip that one in practice. When you hit the assessment, if a two-pointer or binary-search variant trips you up, StealthCoder is your invisible safety net.
Companies with similar patterns
If you prepped for razorpay, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass razorpay.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built because the OA filter rejects engineers who'd pass the on-site. That's a broken filter. This is the workaround. Works on HackerRank, CodeSignal, CoderPad, and Karat.
razorpay interview FAQ
How many array problems should I drill before a Razorpay assessment?+
Seven of ten reported problems involve arrays, so make that your primary focus. Merge Intervals, Rotate Array, and Shortest Subarray to be Removed are concrete starting points. Drill at least 10 array variations before test day to build muscle memory on index shifting and boundary conditions.
Is two-pointers or binary-search more important for Razorpay?+
They tie at three problems each. Two-pointers appears in array manipulation and greedy contexts. Binary search shows up in sorting and query problems. Master both, but if pressed for time, prioritize two-pointers since it pairs with array logic, which is Razorpay's biggest bucket.
What's the difficulty breakdown, and how much should I worry about the hard problem?+
One easy, eight medium, one hard. The hard problem (Minimum Total Cost to Make Arrays Unequal) combines arrays, hash-tables, greedy, and counting. Don't skip it, but focus 70% of your prep on the eight medium problems first, then tackle the hard as a capstone.
Should I study stack or hash-table separately for Razorpay?+
Stack and hash-table each appear twice but not as primary topics. Stack shows up alongside array and string work (Decode String, Shortest Subarray). Hash-table pairs with arrays and greedy logic. Study them in context of larger problems rather than drilling them in isolation.
Which single problem should I solve if I only have one hour left?+
Solve Merge Intervals. It's medium, purely array and sorting, and the pattern (interval merging) appears across Razorpay's harder problems. It's a reliable confidence builder that directly translates to assessment day logic.