razorpay Interview Questions — 10 DSA Problems
10 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.
Most frequently asked razorpay LeetCode questions for software engineering interviews.
- Minimum Total Cost to Make Arrays Unequal (HARD) — Array, Hash Table, Greedy, Counting
- Two Best Non-Overlapping Events (MEDIUM) — Array, Binary Search, Dynamic Programming, Sorting, Heap (Priority Queue)
- Most Beautiful Item for Each Query (MEDIUM) — Array, Binary Search, Sorting
- Shortest Subarray to be Removed to Make Array Sorted (MEDIUM) — Array, Two Pointers, Binary Search, Stack, Monotonic Stack
- Merge Intervals (MEDIUM) — Array, Sorting
- Excel Sheet Column Number (EASY) — Math, String
- Decode String (MEDIUM) — String, Stack, Recursion
- Container With Most Water (MEDIUM) — Array, Two Pointers, Greedy
- Rotate Array (MEDIUM) — Array, Math, Two Pointers
- LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
R
razorpay
10 questions tracked10 with solutions
Frequency scoreSorted highest → lowest frequency✓ Our Solution = we have a detailed walkthrough
Showing 10 of 10 questions
1ArrayHash TableGreedyCounting
2ArrayBinary SearchDynamic ProgrammingSorting+1
3ArrayBinary SearchSorting
4MediumShortest Subarray to be Removed to Make Array Sorted✓ Our Solution ArrayTwo PointersBinary SearchStack+1
10Hash TableLinked ListDesignDoubly-Linked List
