Razorpay Coding Questions - DSA Problems & Solutions

Company Overview

This page contains Razorpay coding questions from Razorpay OA placement papers with detailed solutions.

Coding Focus

Razorpay OA coding section includes 2-3 problems focusing on DSA. Master arrays, trees, graphs, and dynamic programming to succeed.

Razorpay Coding Questions Overview

Razorpay OA Coding Section:

• Problems: 2-3 coding problems
• Time: 90 minutes
• Languages: Java, Python, C++, Go

Coding Problems

Question 1: Coin Change

Q1: Find the minimum number of coins needed to make up an amount.

Solution (Java):

public int coinChange(int[] coins, int amount) {
    int[] dp = new int[amount + 1];
    Arrays.fill(dp, amount + 1);
    dp[0] = 0;

    for (int i = 1; i <= amount; i++) {
        for (int coin : coins) {
            if (coin <= i) {
                dp[i] = Math.min(dp[i], dp[i - coin] + 1);
            }
        }
    }

    return dp[amount] > amount ? -1 : dp[amount];
}

Time Complexity: O(amount × coins.length)

Related Resources

Razorpay 2024 Papers

Previous year papers with coding questions

View 2024 Papers →

Razorpay Main Page

Complete Razorpay placement guide

View Main Page →

---

Practice Razorpay coding questions regularly!