razorpay LeetCode interview questions

Explore razorpay questions from the all problems list. Search by title or topic, filter by difficulty, and track solved problems on this device.

Time range

Problems in range

Solved

0 / 11

Range progress

Problem list

Select a problem to open it on LeetCode.

Problem	Difficulty	Frequency	Acceptance
Minimum Total Cost to Make Arrays Unequal Array Hash Table Greedy +1 HARD	Hard	100.0%	0.4%
Two Best Non-Overlapping Events Array Binary Search Dynamic Programming +2 MEDIUM	Medium	97.2%	0.6%
Most Beautiful Item for Each Query Array Binary Search Sorting MEDIUM	Medium	97.2%	0.6%
Shortest Subarray to be Removed to Make Array Sorted Array Two Pointers Binary Search +2 MEDIUM	Medium	97.2%	0.5%
LRU Cache Hash Table Linked List Design +1 MEDIUM	Medium	90.4%	0.5%
Decode String String Stack Recursion MEDIUM	Medium	86.1%	0.6%
Merge Intervals Array Sorting Quicksort MEDIUM	Medium	64.5%	0.5%
Rotate Array Array Math Two Pointers MEDIUM	Medium	64.5%	0.5%
First Unique Character in a String Hash Table String Queue +1 EASY	Easy	64.5%	0.7%
Unique Paths Math Dynamic Programming Combinatorics MEDIUM	Medium	64.5%	0.7%
Smallest Good Base Math Binary Search HARD	Hard	64.5%	0.5%

Showing 1–11 of 11 matching problems · All Problems

razorpay LeetCode Interview Questions | Grind Practice