Skip to content
Placement Papers - Free Placement Papers for Top CompaniesPlacement Papers - Free Placement Papers for Top CompaniesPlacement Papers

Razorpay Placement Papers 2025

Overview

This page is a working set of Razorpay placement papers from 2025: from student reports questions, the 2025 online assessment pattern, and step-by-step solutions. Use it to see what Razorpay actually asked in the latest cycle, how hard the rounds were, and which themes (DSA, system design, aptitude, or role-specific topics) mattered most. Practice the problems below under timed conditions, then cross-check with the interview and preparation guides if you are targeting an upcoming Razorpay drive.

Razorpay Online Assessment 2025 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 2025 - actual questions & solutions

This section contains practice questions styled on Razorpay placement papers 2025 (recent-cycle 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: detect cycle in linked list

Show solution

Problem Statement: Return true if the linked list has a cycle.

Example:

Input: 3→2→0→-4→(back to 2)
Output: true

Solution (Java):

public boolean hasCycle(ListNode head) {
    ListNode slow = head, fast = head;
    while (fast != null && fast.next != null) {
        slow = slow.next;
        fast = fast.next.next;
        if (slow == fast) return true;
    }
    return false;
}

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

Question 2: 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 3: 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 4: climbing stairs

Show solution

Problem Statement: You can climb 1 or 2 steps. How many distinct ways to climb n stairs?

Example:

Input: n = 4
Output: 5

Solution (Java):

public int climbStairs(int n) {
    if (n <= 2) return n;
    int a = 1, b = 2;
    for (int i = 3; i <= n; i++) {
        int c = a + b; a = b; b = c;
    }
    return b;
}

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

Question 5: 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 6: binary tree level order

Show solution

Problem Statement: Return the level-order traversal of a binary tree.

Example:

Input: [3,9,20,null,null,15,7]
Output: [[3],[9,20],[15,7]]

Solution (Java):

public List<List<Integer>> levelOrder(TreeNode root) {
    List<List<Integer>> res = new ArrayList<>();
    if (root == null) return res;
    Queue<TreeNode> q = new ArrayDeque<>();
    q.add(root);
    while (!q.isEmpty()) {
        int sz = q.size();
        List<Integer> level = new ArrayList<>();
        for (int i = 0; i < sz; i++) {
            TreeNode n = q.poll();
            level.add(n.val);
            if (n.left != null) q.add(n.left);
            if (n.right != null) q.add(n.right);
        }
        res.add(level);
    }
    return res;
}

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

Question 7: reverse a string

Show solution

Problem Statement: Given a string, return it reversed.

Example:

Input: "placement"
Output: "tnemecalp"

Solution (Java):

public String reverse(String s) {
    return new StringBuilder(s).reverse().toString();
}

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

Question 8

Q8: 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 9

Q9: Which protocol is connection-oriented at the transport layer?

Solution:

TCP is connection-oriented; UDP is connectionless.

Answer: TCP

Question 10

Q10: Which data structure uses FIFO order?

Solution:

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

Answer: Queue

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 2025 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, AI-powered fraud detection
  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, AI/ML in fintech
  9. Enhanced Emphasis: Optimal solutions, AI-powered fraud detection, and cloud-native payment systems

Razorpay 2025 interview experiences

Based on recent candidate experiences from 2025 Razorpay interviews:

2025 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, AI/ML
  3. Onsite/Virtual Interviews (4-5 rounds, 45-60 minutes each):
  • Coding rounds (2-3): Algorithms, data structures, problem-solving
  • System Design rounds: AI-powered payment gateways, transaction processing, security systems, cloud-native architecture
  • Behavioral rounds: Problem-solving approach, security mindset, impact, AI/ML passion

2025 Interview Trends:

  • Increased emphasis on AI-powered fraud detection and cloud-native payment systems
  • More focus on optimal solutions and security best practices
  • Enhanced behavioral questions about security mindset and innovation
  • Questions about AI/ML applications in payment systems and fraud detection

Common 2025 Interview Topics:

  • Coding: Arrays, strings, trees, graphs, dynamic programming, payment algorithms
  • System Design: AI-powered payment gateways, transaction processing, security systems, cloud-native fintech architecture
  • Behavioral: Problem-solving, security mindset, teamwork, impact, AI/ML passion
  • Razorpay Technologies: Payment gateways, AI-powered fraud detection, transaction processing, cloud-native platforms

Success Tips:

  • Strong coding performance is essential - solve problems optimally
  • Understand payment gateway, AI-powered fraud detection, and cloud-native payment systems
  • Practice system design for AI-powered payment systems and security
  • Prepare examples demonstrating problem-solving and security mindset
  • Learn Razorpay’s products, AI features, and payment gateway technologies
  • Practice explaining your thought process clearly

For detailed interview experiences from 2025, visit Razorpay Interview Experience page.

Preparation tips for Razorpay 2025 pattern

  1. Master Coding Fundamentals: Focus on solving 2-3 coding problems correctly - arrays, trees, graphs, DP
  2. Payment Gateway Expertise: Strong understanding of payment gateways, AI-powered fraud detection, cloud-native payment systems
  3. Practice Previous Year Papers: Solve Razorpay OA papers from 2020-2025 to understand evolving 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, transactions, AI/ML in fintech
  7. System Design Mastery: Learn AI-powered payment gateway design, transaction processing, security systems, cloud-native architecture
  8. Security Knowledge: Understand security best practices for payment systems and AI-powered fraud detection
  9. Behavioral Preparation: Prepare examples using STAR format - problem-solving, security mindset, AI/ML passion
  10. Mock Tests: Take timed practice tests to improve speed and accuracy
  11. AI/ML in Fintech: Understand AI/ML applications in payment systems and fraud detection

Comments & Suggestions

2024 papers

Coding questions

Interview experience

Preparation guide

Razorpay hub

Similar companies

Paytm · PhonePe · CRED · Flipkart · Swiggy · Zomato