Razorpay Placement Papers 2024

Overview

This page collects Razorpay placement papers from 2024 with previous-year questions, solutions, and the 2024 exam pattern. It is useful when you want real drive history: what the OA looked like, which question types repeated, and how solutions were approached. Work through the papers below to build speed and accuracy, then compare against newer 2025 material so your prep matches both established Razorpay patterns and the latest shifts.

2024 Pattern

The 2024 Razorpay placement process emphasized DSA mastery and payment gateway system design. Online assessment included 2-3 coding problems focusing on arrays, trees, graphs, and dynamic programming.

Razorpay Online Assessment 2024 pattern

Section	Questions	Time	Difficulty	Focus Areas
Coding Problems	2-3	90 min	Medium-Hard	Arrays, trees, graphs, DP

Total: 2-3 problems, 90 minutes

Platform: HackerRank or similar
Languages Allowed: Java, Python, C++, Go
Success Rate: ~15-20% cleared OA and advanced to interviews

Razorpay Placement Papers 2024 - actual questions & solutions

This section contains practice questions styled on Razorpay placement papers 2024 (previous-year pattern), with worked solutions. Use them as timed sectional drills - from student reports drives vary by college and role, so treat this as a high-signal practice bank, not an official paper dump.

Question 1: first non-repeating character

Show solution

Problem Statement: Return the first non-repeating character in a string, or ‘_’ if none.

Example:

Input: "swiss"
Output: 'w'

Solution (Java):

public char firstUnique(String s) {
    int[] freq = new int[256];
    for (char c : s.toCharArray()) freq[c]++;
    for (char c : s.toCharArray()) if (freq[c] == 1) return c;
    return '_';
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 2: two sum

Show solution

Problem Statement: Given an array of integers and a target, return indices of two numbers that add up to target.

Example:

Input: nums = [2, 7, 11, 15], target = 9
Output: [0, 1]

Solution (Java):

public int[] twoSum(int[] nums, int target) {
    Map<Integer, Integer> map = new HashMap<>();
    for (int i = 0; i < nums.length; i++) {
        int need = target - nums[i];
        if (map.containsKey(need)) return new int[]{map.get(need), i};
        map.put(nums[i], i);
    }
    return new int[]{};
}

Time Complexity: O(n)
Space Complexity: O(n)

Question 3: check palindrome

Show solution

Problem Statement: Return true if the string reads the same forward and backward (ignore case).

Example:

Input: "Level"
Output: true

Solution (Java):

public boolean isPalindrome(String s) {
    s = s.toLowerCase();
    int i = 0, j = s.length() - 1;
    while (i < j) {
        if (s.charAt(i++) != s.charAt(j--)) return false;
    }
    return true;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 4: valid parentheses

Show solution

Problem Statement: Given a string of brackets, determine if it is valid.

Example:

Input: "()[]{}"
Output: true

Solution (Java):

public boolean isValid(String s) {
    Deque<Character> st = new ArrayDeque<>();
    Map<Character, Character> pair = Map.of(')', '(', ']', '[', '}', '{');
    for (char c : s.toCharArray()) {
        if (pair.containsValue(c)) st.push(c);
        else if (st.isEmpty() || st.pop() != pair.get(c)) return false;
    }
    return st.isEmpty();
}

Time Complexity: O(n)
Space Complexity: O(n)

Question 5: longest common prefix

Show solution

Problem Statement: Find the longest common prefix string amongst an array of strings.

Example:

Input: ["flower","flow","flight"]
Output: "fl"

Solution (Java):

public String longestCommonPrefix(String[] strs) {
    if (strs.length == 0) return "";
    String pref = strs[0];
    for (int i = 1; i < strs.length; i++) {
        while (!strs[i].startsWith(pref)) {
            pref = pref.substring(0, pref.length() - 1);
            if (pref.isEmpty()) return "";
        }
    }
    return pref;
}

Time Complexity: O(S)
Space Complexity: O(1)

Question 6: merge two sorted lists

Show solution

Problem Statement: Merge two sorted linked lists and return a new sorted list.

Example:

Input: 1→2→4 , 1→3→4
Output: 1→1→2→3→4→4

Solution (Java):

public ListNode mergeTwoLists(ListNode a, ListNode b) {
    ListNode dummy = new ListNode(0), cur = dummy;
    while (a != null && b != null) {
        if (a.val <= b.val) { cur.next = a; a = a.next; }
        else { cur.next = b; b = b.next; }
        cur = cur.next;
    }
    cur.next = (a != null) ? a : b;
    return dummy.next;
}

Time Complexity: O(n + m)
Space Complexity: O(1)

Question 7: maximum subarray sum

Show solution

Problem Statement: Find the contiguous subarray with the largest sum.

Example:

Input: [-2, 1, -3, 4, -1, 2, 1, -5, 4]
Output: 6  // [4, -1, 2, 1]

Solution (Java):

public int maxSubArray(int[] nums) {
    int best = nums[0], cur = nums[0];
    for (int i = 1; i < nums.length; i++) {
        cur = Math.max(nums[i], cur + nums[i]);
        best = Math.max(best, cur);
    }
    return best;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 8

Q8: Worst-case time complexity of quicksort is?

Solution:

Unbalanced partitions (already sorted with bad pivot) → O(n²).

Answer: O(n²)

Question 9

Q9: Which data structure uses FIFO order?

Solution:

FIFO = First In First Out → Queue. Stack is LIFO.

Answer: Queue

Question 10

Q10: Time complexity of binary search on a sorted array of n elements is?

Solution:

Each step halves the search space → O(log n).

Answer: O(log n)

Question 11

Q11: Virtual memory is typically implemented using?

Solution:

OS uses demand paging (and sometimes segmentation) to implement virtual memory.

Answer: Demand paging

Key insights from 2024 Razorpay Online Assessment

1. Coding Section is Critical: Must solve 2-3 coding problems correctly to advance
2. DSA Focus: Strong emphasis on arrays, strings, trees, graphs, and dynamic programming
3. Time Management: 2-3 problems in 90 minutes requires excellent speed and accuracy
4. Payment Gateway Focus: Problems often relate to payment systems, transactions, security
5. System Design: Asked for SDE-1/2 roles, payment gateway design for fintech roles
6. Success Rate: Only 15-20% cleared OA and advanced to interviews
7. Platform: HackerRank or Razorpay’s internal platform
8. Focus Areas: Arrays, trees, graphs, dynamic programming, payment systems

Razorpay 2024 interview experiences

Based on candidate experiences from 2024 Razorpay interviews:

2024 Interview Process:

1. Online Assessment (90 minutes): 2-3 coding problems
2. Technical Phone Screen (45-60 minutes): Coding problems, algorithm discussions, payment gateway concepts
3. Onsite Interviews (4-5 rounds, 45-60 minutes each):

• Coding rounds (2-3): Algorithms, data structures, problem-solving
• System Design rounds: Payment gateways, transaction processing, security systems
• Behavioral rounds: Problem-solving approach, security mindset, impact

Common 2024 Interview Topics:

• Coding: Arrays, strings, trees, graphs, dynamic programming, payment algorithms
• System Design: Payment gateways, transaction processing, security systems, fintech architecture
• Behavioral: Problem-solving, security mindset, teamwork, impact
• Razorpay Technologies: Payment gateways, transaction processing, security, fintech platforms

2024 Interview Questions Examples:

• Coin Change Problem
• Design Razorpay’s payment gateway (System Design)
• Design Razorpay’s transaction processing system (System Design)
• Security-related coding problems

Success Tips:

• Strong coding performance is essential - solve problems optimally
• Understand payment gateway and transaction processing concepts
• Practice system design for payment systems and security
• Prepare examples demonstrating problem-solving and security mindset
• Learn Razorpay’s products and payment gateway technologies
• Practice explaining your thought process clearly

For detailed interview experiences, visit Razorpay Interview Experience page.

Preparation tips for Razorpay 2024 pattern

1. Master Coding Fundamentals: Focus on solving 2-3 coding problems correctly - arrays, trees, graphs, DP
2. Payment Gateway Knowledge: Strong understanding of payment gateways, transaction processing, security
3. Practice Previous Year Papers: Solve Razorpay OA papers from 2020-2024 to understand patterns
4. Time Management: Practice completing 2-3 coding problems in 90 minutes
5. LeetCode Practice: Solve 200+ LeetCode problems focusing on arrays, strings, trees, graphs (medium-hard difficulty)
6. Fintech Focus: Practice problems related to payment systems and transactions
7. System Design Mastery: Learn payment gateway design, transaction processing, security systems
8. Security Knowledge: Understand security best practices for payment systems
9. Behavioral Preparation: Prepare examples using STAR format - problem-solving, security mindset, impact
10. Mock Tests: Take timed practice tests to improve speed and accuracy

Comments & Suggestions

Related resources

2025 papers→

Coding questions→

Interview experience→

Preparation guide→

Razorpay hub→

Similar companies

Paytm · PhonePe · CRED · Flipkart · Swiggy · Zomato