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

Paytm Placement Papers 2024

Overview

This page collects Paytm 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 Paytm patterns and the latest shifts.

Paytm Online Assessment 2024 pattern

Section Questions Time Difficulty
Coding Problems 2-3 60 min Medium-Hard
Debugging 1 30 min Medium

Paytm Placement Papers 2024 - actual questions & solutions

This section contains practice questions styled on Paytm 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: 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 2: 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 3: 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 4: 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 5: 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 6: rotate array right by k

Show solution

Problem Statement: Rotate the array to the right by k steps.

Example:

Input: [1,2,3,4,5,6,7], k = 3
Output: [5,6,7,1,2,3,4]

Solution (Java):

public void rotate(int[] nums, int k) {
    k %= nums.length;
    reverse(nums, 0, nums.length - 1);
    reverse(nums, 0, k - 1);
    reverse(nums, k, nums.length - 1);
}
void reverse(int[] a, int l, int r) {
    while (l < r) { int t = a[l]; a[l++] = a[r]; a[r--] = t; }
}

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

Question 7: 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 8

Q8: Which normal form removes transitive dependency?

Solution:

1NF: atomic values. 2NF: no partial dependency. 3NF: no transitive dependency.

Answer: 3NF

Question 9

Q9: In OOP, hiding internal details and showing only essential features is called?

Solution:

This is the definition of Encapsulation (often paired with abstraction in interviews).

Answer: Encapsulation

Question 10

Q10: Virtual memory is typically implemented using?

Solution:

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

Answer: Demand paging

Question 11

Q11: Which data structure uses FIFO order?

Solution:

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

Answer: Queue

Hiring volume

  • Total Hires: 180+ freshers
  • SDE-1: 162+ selections

Salary packages

  • SDE-1: ₹16-22 LPA

Key insights from 2024 Paytm 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. Debugging: Always included - practice debugging skills thoroughly
  5. Fintech Focus: Problems often relate to payment systems, transactions, security
  6. System Design: Asked for SDE-1/2 roles, payment gateway design for fintech roles
  7. Success Rate: Only 10-15% cleared OA and advanced to interviews
  8. Platform: HackerRank or Paytm’s internal platform

Paytm 2024 interview experiences

Based on candidate experiences from 2024 Paytm interviews:

2024 Interview Process:

  1. Online Assessment (90 minutes): 2-3 coding problems + 1 debugging question
  2. Technical Phone Screen (45-60 minutes): Coding problems, algorithm discussions
  3. Onsite Interviews (4-5 rounds, 45-60 minutes each):
  • Coding rounds (2-3): Algorithms, data structures, problem-solving
  • System Design round: Payment systems, fintech architecture for SDE-1+ roles
  • Behavioral round: Problem-solving approach, security mindset, impact

Common 2024 Interview Topics:

  • Coding: Arrays, strings, trees, graphs, dynamic programming
  • System Design: Payment gateway design, transaction processing, security systems
  • Debugging: Code fixes, logic errors, security vulnerabilities
  • Behavioral: Problem-solving examples, security mindset, impact on business metrics
  • Fintech Knowledge: Payment systems, transaction processing, security best practices

2024 Interview Questions Examples:

  • Array and string manipulation problems
  • Tree and graph problems
  • Design Paytm’s payment gateway (System Design)
  • Design Paytm’s wallet system (System Design)
  • Security-related coding problems

Success Tips:

  • Strong coding performance is essential - solve problems optimally
  • Practice debugging skills - this section is always included
  • Learn fintech system design - payment gateways, transaction processing, security
  • Prepare examples demonstrating problem-solving and security mindset
  • Practice explaining your thought process clearly
  • Focus on time management - 2-3 problems in 90 minutes
  • Understand payment systems and security best practices

For detailed interview experiences, visit Paytm Interview Experience page.

Preparation tips for Paytm 2024 pattern

  1. Master Coding Fundamentals: Focus on solving 2-3 coding problems correctly - arrays, strings, trees, graphs
  2. Practice Previous Year Papers: Solve Paytm OA papers from 2020-2024 to understand patterns
  3. Time Management: Practice completing 2-3 coding problems in 60 minutes, debugging in 30 minutes
  4. Debugging Practice: Practice debugging code - identify and fix logic errors, security issues
  5. System Design Basics: Learn fintech system design - payment gateways, transaction processing for SDE-1+
  6. LeetCode Practice: Solve 200+ LeetCode problems focusing on arrays, strings, trees (medium-hard difficulty)
  7. Fintech Focus: Practice problems related to payment systems and transactions
  8. Mock Tests: Take timed practice tests to improve speed and accuracy
  9. Security Knowledge: Understand security best practices for payment systems
  10. Dynamic Programming: Practice DP problems - frequently asked

Comments & Suggestions

2025 papers

Coding questions

Interview experience

Preparation guide

Paytm hub

Similar companies

PhonePe · Razorpay · CRED · Flipkart · Swiggy · Zomato